./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ea18b6ba0d977117db11fbdff34c486def646c3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 00:46:05,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:46:05,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:46:05,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:46:05,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:46:05,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:46:05,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:46:05,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:46:05,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:46:05,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:46:05,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:46:05,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:46:05,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:46:05,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:46:05,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:46:05,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:46:05,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:46:05,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:46:05,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:46:05,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:46:05,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:46:05,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:46:05,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:46:05,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:46:05,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:46:05,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:46:05,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:46:05,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:46:05,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:46:05,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:46:05,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:46:05,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:46:05,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:46:05,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:46:05,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:46:05,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:46:05,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:46:05,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:46:05,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:46:05,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:46:05,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:46:05,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 00:46:05,644 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:46:05,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:46:05,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:46:05,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:46:05,646 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:46:05,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:46:05,647 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:46:05,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 00:46:05,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:46:05,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:46:05,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:46:05,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:46:05,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:46:05,648 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:46:05,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:46:05,649 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:46:05,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:46:05,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:46:05,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:46:05,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:46:05,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:46:05,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:46:05,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:46:05,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:46:05,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:46:05,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 00:46:05,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 00:46:05,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:46:05,652 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:46:05,653 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ea18b6ba0d977117db11fbdff34c486def646c3 [2020-10-20 00:46:05,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:46:05,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:46:05,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:46:05,873 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:46:05,874 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:46:05,874 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2020-10-20 00:46:05,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2e88acd/7d3c47355771423381786aa5bf63df75/FLAGbfd3e9a36 [2020-10-20 00:46:06,520 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:46:06,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2020-10-20 00:46:06,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2e88acd/7d3c47355771423381786aa5bf63df75/FLAGbfd3e9a36 [2020-10-20 00:46:06,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2e88acd/7d3c47355771423381786aa5bf63df75 [2020-10-20 00:46:06,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:46:06,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:46:06,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:46:06,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:46:06,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:46:06,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:46:06" (1/1) ... [2020-10-20 00:46:06,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29ba1116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:06, skipping insertion in model container [2020-10-20 00:46:06,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:46:06" (1/1) ... [2020-10-20 00:46:06,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:46:06,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:46:07,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:46:07,417 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:46:07,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:46:07,531 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:46:07,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:07 WrapperNode [2020-10-20 00:46:07,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:46:07,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:46:07,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:46:07,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:46:07,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:07" (1/1) ... [2020-10-20 00:46:07,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:07" (1/1) ... [2020-10-20 00:46:07,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:46:07,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:46:07,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:46:07,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:46:07,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:07" (1/1) ... [2020-10-20 00:46:07,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:07" (1/1) ... [2020-10-20 00:46:07,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:07" (1/1) ... [2020-10-20 00:46:07,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:07" (1/1) ... [2020-10-20 00:46:07,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:07" (1/1) ... [2020-10-20 00:46:07,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:07" (1/1) ... [2020-10-20 00:46:07,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:07" (1/1) ... [2020-10-20 00:46:07,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:46:07,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:46:07,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:46:07,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:46:07,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:46:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 00:46:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 00:46:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:46:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 00:46:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 00:46:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 00:46:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:46:07,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:46:08,379 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:46:08,380 INFO L298 CfgBuilder]: Removed 60 assume(true) statements. [2020-10-20 00:46:08,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:46:08 BoogieIcfgContainer [2020-10-20 00:46:08,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:46:08,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:46:08,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:46:08,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:46:08,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:46:06" (1/3) ... [2020-10-20 00:46:08,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef1601b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:46:08, skipping insertion in model container [2020-10-20 00:46:08,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:07" (2/3) ... [2020-10-20 00:46:08,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef1601b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:46:08, skipping insertion in model container [2020-10-20 00:46:08,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:46:08" (3/3) ... [2020-10-20 00:46:08,392 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2020-10-20 00:46:08,405 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:46:08,418 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-10-20 00:46:08,439 INFO L253 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-10-20 00:46:08,491 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:46:08,491 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:46:08,491 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:46:08,492 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:46:08,492 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:46:08,492 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:46:08,492 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:46:08,493 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:46:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2020-10-20 00:46:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-20 00:46:08,525 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:08,526 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-20 00:46:08,527 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:08,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:08,534 INFO L82 PathProgramCache]: Analyzing trace with hash 28696838, now seen corresponding path program 1 times [2020-10-20 00:46:08,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:08,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315333074] [2020-10-20 00:46:08,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:08,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:08,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315333074] [2020-10-20 00:46:08,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:08,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:46:08,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305970354] [2020-10-20 00:46:08,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:08,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:08,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:08,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:08,772 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 3 states. [2020-10-20 00:46:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:08,858 INFO L93 Difference]: Finished difference Result 223 states and 369 transitions. [2020-10-20 00:46:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:08,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-20 00:46:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:08,874 INFO L225 Difference]: With dead ends: 223 [2020-10-20 00:46:08,874 INFO L226 Difference]: Without dead ends: 111 [2020-10-20 00:46:08,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-20 00:46:08,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2020-10-20 00:46:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-20 00:46:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2020-10-20 00:46:08,956 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 5 [2020-10-20 00:46:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:08,957 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2020-10-20 00:46:08,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2020-10-20 00:46:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 00:46:08,958 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:08,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:08,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 00:46:08,959 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:08,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:08,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1244560352, now seen corresponding path program 1 times [2020-10-20 00:46:08,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:08,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712771755] [2020-10-20 00:46:08,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:09,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712771755] [2020-10-20 00:46:09,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:09,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:46:09,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29593008] [2020-10-20 00:46:09,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:09,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:09,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:09,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:09,030 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 3 states. [2020-10-20 00:46:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:09,071 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2020-10-20 00:46:09,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:09,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-20 00:46:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:09,073 INFO L225 Difference]: With dead ends: 94 [2020-10-20 00:46:09,075 INFO L226 Difference]: Without dead ends: 91 [2020-10-20 00:46:09,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:09,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-20 00:46:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-10-20 00:46:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-20 00:46:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2020-10-20 00:46:09,101 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 11 [2020-10-20 00:46:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:09,101 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2020-10-20 00:46:09,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2020-10-20 00:46:09,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 00:46:09,104 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:09,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:09,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 00:46:09,105 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:09,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:09,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1244619934, now seen corresponding path program 1 times [2020-10-20 00:46:09,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:09,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564379027] [2020-10-20 00:46:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:09,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564379027] [2020-10-20 00:46:09,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:09,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:46:09,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195522694] [2020-10-20 00:46:09,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:46:09,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:09,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:46:09,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:46:09,221 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 4 states. [2020-10-20 00:46:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:09,327 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2020-10-20 00:46:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:46:09,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-20 00:46:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:09,329 INFO L225 Difference]: With dead ends: 92 [2020-10-20 00:46:09,330 INFO L226 Difference]: Without dead ends: 89 [2020-10-20 00:46:09,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:46:09,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-20 00:46:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2020-10-20 00:46:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-20 00:46:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2020-10-20 00:46:09,338 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 11 [2020-10-20 00:46:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:09,339 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2020-10-20 00:46:09,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:46:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2020-10-20 00:46:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 00:46:09,340 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:09,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:09,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 00:46:09,341 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:09,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash -394307937, now seen corresponding path program 1 times [2020-10-20 00:46:09,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:09,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505878150] [2020-10-20 00:46:09,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:09,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505878150] [2020-10-20 00:46:09,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:09,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:46:09,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270128909] [2020-10-20 00:46:09,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:09,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:09,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:09,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:09,398 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 3 states. [2020-10-20 00:46:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:09,460 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2020-10-20 00:46:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:09,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-20 00:46:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:09,462 INFO L225 Difference]: With dead ends: 90 [2020-10-20 00:46:09,462 INFO L226 Difference]: Without dead ends: 84 [2020-10-20 00:46:09,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:09,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-20 00:46:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2020-10-20 00:46:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-20 00:46:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2020-10-20 00:46:09,471 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 16 [2020-10-20 00:46:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:09,471 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2020-10-20 00:46:09,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2020-10-20 00:46:09,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 00:46:09,472 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:09,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:09,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 00:46:09,473 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:09,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:09,474 INFO L82 PathProgramCache]: Analyzing trace with hash 662126649, now seen corresponding path program 1 times [2020-10-20 00:46:09,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:09,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006547525] [2020-10-20 00:46:09,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:09,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006547525] [2020-10-20 00:46:09,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:09,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:46:09,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692651431] [2020-10-20 00:46:09,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:46:09,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:09,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:46:09,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:46:09,542 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 4 states. [2020-10-20 00:46:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:09,633 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2020-10-20 00:46:09,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:46:09,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-20 00:46:09,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:09,635 INFO L225 Difference]: With dead ends: 151 [2020-10-20 00:46:09,635 INFO L226 Difference]: Without dead ends: 127 [2020-10-20 00:46:09,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:46:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-20 00:46:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 79. [2020-10-20 00:46:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-20 00:46:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2020-10-20 00:46:09,644 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 17 [2020-10-20 00:46:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:09,644 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2020-10-20 00:46:09,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:46:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2020-10-20 00:46:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 00:46:09,646 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:09,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:09,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 00:46:09,646 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:09,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:09,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1970937841, now seen corresponding path program 1 times [2020-10-20 00:46:09,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:09,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66803582] [2020-10-20 00:46:09,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:09,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66803582] [2020-10-20 00:46:09,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:09,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:46:09,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492727470] [2020-10-20 00:46:09,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:09,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:09,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:09,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:09,686 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 3 states. [2020-10-20 00:46:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:09,704 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2020-10-20 00:46:09,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:09,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-20 00:46:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:09,706 INFO L225 Difference]: With dead ends: 155 [2020-10-20 00:46:09,706 INFO L226 Difference]: Without dead ends: 106 [2020-10-20 00:46:09,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-20 00:46:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2020-10-20 00:46:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-20 00:46:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2020-10-20 00:46:09,714 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 21 [2020-10-20 00:46:09,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:09,727 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2020-10-20 00:46:09,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:09,728 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2020-10-20 00:46:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 00:46:09,729 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:09,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:09,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 00:46:09,730 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:09,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:09,730 INFO L82 PathProgramCache]: Analyzing trace with hash 968549259, now seen corresponding path program 1 times [2020-10-20 00:46:09,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:09,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146484134] [2020-10-20 00:46:09,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:09,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146484134] [2020-10-20 00:46:09,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:09,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:46:09,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35154842] [2020-10-20 00:46:09,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:09,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:09,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:09,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:09,771 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 3 states. [2020-10-20 00:46:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:09,789 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2020-10-20 00:46:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:09,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-10-20 00:46:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:09,791 INFO L225 Difference]: With dead ends: 82 [2020-10-20 00:46:09,791 INFO L226 Difference]: Without dead ends: 79 [2020-10-20 00:46:09,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-20 00:46:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-20 00:46:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-20 00:46:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2020-10-20 00:46:09,798 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 22 [2020-10-20 00:46:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:09,798 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2020-10-20 00:46:09,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2020-10-20 00:46:09,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 00:46:09,800 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:09,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:09,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 00:46:09,801 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:09,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:09,801 INFO L82 PathProgramCache]: Analyzing trace with hash -800273617, now seen corresponding path program 1 times [2020-10-20 00:46:09,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:09,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630137366] [2020-10-20 00:46:09,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:09,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630137366] [2020-10-20 00:46:09,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:09,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:46:09,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119686549] [2020-10-20 00:46:09,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:09,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:09,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:09,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:09,835 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 3 states. [2020-10-20 00:46:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:09,847 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2020-10-20 00:46:09,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:09,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-20 00:46:09,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:09,849 INFO L225 Difference]: With dead ends: 83 [2020-10-20 00:46:09,849 INFO L226 Difference]: Without dead ends: 80 [2020-10-20 00:46:09,850 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-20 00:46:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-10-20 00:46:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-20 00:46:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2020-10-20 00:46:09,855 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 24 [2020-10-20 00:46:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:09,855 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2020-10-20 00:46:09,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2020-10-20 00:46:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 00:46:09,857 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:09,857 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:09,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 00:46:09,858 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash -800214035, now seen corresponding path program 1 times [2020-10-20 00:46:09,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:09,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907381579] [2020-10-20 00:46:09,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:09,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907381579] [2020-10-20 00:46:09,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:09,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:46:09,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195566799] [2020-10-20 00:46:09,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:46:09,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:09,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:46:09,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:46:09,934 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 4 states. [2020-10-20 00:46:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:10,021 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2020-10-20 00:46:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:46:10,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-20 00:46:10,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:10,024 INFO L225 Difference]: With dead ends: 81 [2020-10-20 00:46:10,024 INFO L226 Difference]: Without dead ends: 78 [2020-10-20 00:46:10,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:46:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-20 00:46:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-10-20 00:46:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-20 00:46:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2020-10-20 00:46:10,036 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 24 [2020-10-20 00:46:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:10,037 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2020-10-20 00:46:10,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:46:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2020-10-20 00:46:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 00:46:10,038 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:10,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:10,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 00:46:10,038 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:10,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:10,039 INFO L82 PathProgramCache]: Analyzing trace with hash 785556314, now seen corresponding path program 1 times [2020-10-20 00:46:10,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:10,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007656129] [2020-10-20 00:46:10,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:10,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007656129] [2020-10-20 00:46:10,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:10,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 00:46:10,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133050292] [2020-10-20 00:46:10,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 00:46:10,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:10,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 00:46:10,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:46:10,320 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 7 states. [2020-10-20 00:46:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:10,821 INFO L93 Difference]: Finished difference Result 246 states and 273 transitions. [2020-10-20 00:46:10,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 00:46:10,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-10-20 00:46:10,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:10,825 INFO L225 Difference]: With dead ends: 246 [2020-10-20 00:46:10,825 INFO L226 Difference]: Without dead ends: 243 [2020-10-20 00:46:10,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-20 00:46:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-10-20 00:46:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 93. [2020-10-20 00:46:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-20 00:46:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2020-10-20 00:46:10,833 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 25 [2020-10-20 00:46:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:10,834 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2020-10-20 00:46:10,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 00:46:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2020-10-20 00:46:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 00:46:10,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:10,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:10,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 00:46:10,836 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:10,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1603204764, now seen corresponding path program 1 times [2020-10-20 00:46:10,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:10,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811750986] [2020-10-20 00:46:10,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:10,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811750986] [2020-10-20 00:46:10,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:10,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:46:10,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041767706] [2020-10-20 00:46:10,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:46:10,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:10,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:46:10,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:46:10,868 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 4 states. [2020-10-20 00:46:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:10,990 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2020-10-20 00:46:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:46:10,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-20 00:46:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:10,991 INFO L225 Difference]: With dead ends: 216 [2020-10-20 00:46:10,991 INFO L226 Difference]: Without dead ends: 148 [2020-10-20 00:46:10,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:46:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-10-20 00:46:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 93. [2020-10-20 00:46:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-20 00:46:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2020-10-20 00:46:10,997 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 25 [2020-10-20 00:46:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:10,997 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2020-10-20 00:46:10,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:46:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2020-10-20 00:46:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 00:46:10,998 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:10,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:10,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 00:46:10,999 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:10,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:10,999 INFO L82 PathProgramCache]: Analyzing trace with hash -390939942, now seen corresponding path program 1 times [2020-10-20 00:46:10,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:11,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517280443] [2020-10-20 00:46:11,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:11,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517280443] [2020-10-20 00:46:11,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:11,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 00:46:11,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931260715] [2020-10-20 00:46:11,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 00:46:11,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:11,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 00:46:11,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:46:11,073 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 6 states. [2020-10-20 00:46:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:11,328 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2020-10-20 00:46:11,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 00:46:11,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-20 00:46:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:11,330 INFO L225 Difference]: With dead ends: 223 [2020-10-20 00:46:11,330 INFO L226 Difference]: Without dead ends: 169 [2020-10-20 00:46:11,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-20 00:46:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-10-20 00:46:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 100. [2020-10-20 00:46:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-20 00:46:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2020-10-20 00:46:11,336 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 25 [2020-10-20 00:46:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:11,336 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2020-10-20 00:46:11,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 00:46:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2020-10-20 00:46:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 00:46:11,337 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:11,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:11,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 00:46:11,338 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:11,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:11,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1462211504, now seen corresponding path program 1 times [2020-10-20 00:46:11,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:11,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099724847] [2020-10-20 00:46:11,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:11,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:46:11,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099724847] [2020-10-20 00:46:11,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:11,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:46:11,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934241561] [2020-10-20 00:46:11,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:11,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:11,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:11,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:11,396 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 3 states. [2020-10-20 00:46:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:11,447 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2020-10-20 00:46:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:11,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-10-20 00:46:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:11,448 INFO L225 Difference]: With dead ends: 100 [2020-10-20 00:46:11,448 INFO L226 Difference]: Without dead ends: 97 [2020-10-20 00:46:11,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-20 00:46:11,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-20 00:46:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-20 00:46:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2020-10-20 00:46:11,458 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 27 [2020-10-20 00:46:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:11,459 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2020-10-20 00:46:11,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2020-10-20 00:46:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-20 00:46:11,463 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:11,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:11,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 00:46:11,463 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash -443744732, now seen corresponding path program 1 times [2020-10-20 00:46:11,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:11,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251090893] [2020-10-20 00:46:11,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:11,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251090893] [2020-10-20 00:46:11,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:11,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 00:46:11,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122002889] [2020-10-20 00:46:11,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 00:46:11,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:11,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 00:46:11,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:46:11,696 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 7 states. [2020-10-20 00:46:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:12,127 INFO L93 Difference]: Finished difference Result 245 states and 273 transitions. [2020-10-20 00:46:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 00:46:12,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-10-20 00:46:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:12,129 INFO L225 Difference]: With dead ends: 245 [2020-10-20 00:46:12,130 INFO L226 Difference]: Without dead ends: 242 [2020-10-20 00:46:12,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-20 00:46:12,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-10-20 00:46:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 100. [2020-10-20 00:46:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-20 00:46:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2020-10-20 00:46:12,138 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 28 [2020-10-20 00:46:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:12,138 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2020-10-20 00:46:12,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 00:46:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2020-10-20 00:46:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-20 00:46:12,139 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:12,139 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:12,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 00:46:12,139 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:12,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:12,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1509598737, now seen corresponding path program 1 times [2020-10-20 00:46:12,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:12,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774551674] [2020-10-20 00:46:12,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:12,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774551674] [2020-10-20 00:46:12,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:12,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 00:46:12,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879238078] [2020-10-20 00:46:12,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 00:46:12,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 00:46:12,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:46:12,219 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 6 states. [2020-10-20 00:46:12,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:12,451 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2020-10-20 00:46:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 00:46:12,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-10-20 00:46:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:12,453 INFO L225 Difference]: With dead ends: 216 [2020-10-20 00:46:12,453 INFO L226 Difference]: Without dead ends: 170 [2020-10-20 00:46:12,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-20 00:46:12,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-10-20 00:46:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 100. [2020-10-20 00:46:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-20 00:46:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2020-10-20 00:46:12,462 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 30 [2020-10-20 00:46:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:12,462 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2020-10-20 00:46:12,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 00:46:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2020-10-20 00:46:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-20 00:46:12,463 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:12,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:12,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 00:46:12,464 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:12,464 INFO L82 PathProgramCache]: Analyzing trace with hash -295839597, now seen corresponding path program 1 times [2020-10-20 00:46:12,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:12,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216969743] [2020-10-20 00:46:12,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:46:12,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216969743] [2020-10-20 00:46:12,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:12,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 00:46:12,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46252535] [2020-10-20 00:46:12,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:46:12,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:12,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:46:12,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:46:12,521 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 5 states. [2020-10-20 00:46:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:12,649 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2020-10-20 00:46:12,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:46:12,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-10-20 00:46:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:12,651 INFO L225 Difference]: With dead ends: 150 [2020-10-20 00:46:12,651 INFO L226 Difference]: Without dead ends: 132 [2020-10-20 00:46:12,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:46:12,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-20 00:46:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2020-10-20 00:46:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-20 00:46:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2020-10-20 00:46:12,665 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 30 [2020-10-20 00:46:12,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:12,665 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2020-10-20 00:46:12,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:46:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2020-10-20 00:46:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-20 00:46:12,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:12,667 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:12,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 00:46:12,668 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:12,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:12,669 INFO L82 PathProgramCache]: Analyzing trace with hash 303753301, now seen corresponding path program 1 times [2020-10-20 00:46:12,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:12,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616660217] [2020-10-20 00:46:12,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 00:46:12,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616660217] [2020-10-20 00:46:12,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:12,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 00:46:12,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432728833] [2020-10-20 00:46:12,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:46:12,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:12,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:46:12,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:46:12,757 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand 5 states. [2020-10-20 00:46:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:12,984 INFO L93 Difference]: Finished difference Result 285 states and 332 transitions. [2020-10-20 00:46:12,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:46:12,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-10-20 00:46:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:12,986 INFO L225 Difference]: With dead ends: 285 [2020-10-20 00:46:12,987 INFO L226 Difference]: Without dead ends: 192 [2020-10-20 00:46:12,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:46:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-10-20 00:46:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 121. [2020-10-20 00:46:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-20 00:46:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2020-10-20 00:46:13,000 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 30 [2020-10-20 00:46:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:13,000 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2020-10-20 00:46:13,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:46:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2020-10-20 00:46:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-20 00:46:13,001 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:13,001 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:13,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 00:46:13,001 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:13,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:13,002 INFO L82 PathProgramCache]: Analyzing trace with hash 163204691, now seen corresponding path program 1 times [2020-10-20 00:46:13,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:13,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969899368] [2020-10-20 00:46:13,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:13,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969899368] [2020-10-20 00:46:13,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51258240] [2020-10-20 00:46:13,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:46:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:13,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 00:46:13,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:13,204 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:46:13,205 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:13,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:13,217 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:46:13,217 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:13,223 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:13,224 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:13,224 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-10-20 00:46:13,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:13,261 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-10-20 00:46:13,262 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:13,273 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:13,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:13,278 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-10-20 00:46:13,279 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:13,289 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:13,289 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:13,289 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2020-10-20 00:46:13,348 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-20 00:46:13,349 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:13,357 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:13,361 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:13,361 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2020-10-20 00:46:13,363 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:13,367 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:13,367 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:13,367 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2020-10-20 00:46:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:13,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:46:13,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2020-10-20 00:46:13,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144988945] [2020-10-20 00:46:13,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 00:46:13,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:13,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 00:46:13,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 00:46:13,378 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 8 states. [2020-10-20 00:46:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:13,748 INFO L93 Difference]: Finished difference Result 218 states and 250 transitions. [2020-10-20 00:46:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 00:46:13,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-10-20 00:46:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:13,750 INFO L225 Difference]: With dead ends: 218 [2020-10-20 00:46:13,750 INFO L226 Difference]: Without dead ends: 151 [2020-10-20 00:46:13,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-20 00:46:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-10-20 00:46:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 122. [2020-10-20 00:46:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-20 00:46:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2020-10-20 00:46:13,758 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 30 [2020-10-20 00:46:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:13,758 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2020-10-20 00:46:13,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 00:46:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2020-10-20 00:46:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 00:46:13,759 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:13,759 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:13,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-20 00:46:13,975 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash 241363572, now seen corresponding path program 1 times [2020-10-20 00:46:13,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:13,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149059759] [2020-10-20 00:46:13,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:14,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149059759] [2020-10-20 00:46:14,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:14,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:46:14,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685424495] [2020-10-20 00:46:14,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:14,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:14,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:14,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:14,012 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand 3 states. [2020-10-20 00:46:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:14,034 INFO L93 Difference]: Finished difference Result 240 states and 282 transitions. [2020-10-20 00:46:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:14,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-10-20 00:46:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:14,036 INFO L225 Difference]: With dead ends: 240 [2020-10-20 00:46:14,036 INFO L226 Difference]: Without dead ends: 178 [2020-10-20 00:46:14,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-10-20 00:46:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 147. [2020-10-20 00:46:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-20 00:46:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2020-10-20 00:46:14,044 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 171 transitions. Word has length 33 [2020-10-20 00:46:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:14,045 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 171 transitions. [2020-10-20 00:46:14,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:14,045 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2020-10-20 00:46:14,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 00:46:14,045 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:14,045 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:14,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 00:46:14,046 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:14,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:14,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1703627734, now seen corresponding path program 1 times [2020-10-20 00:46:14,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:14,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893367796] [2020-10-20 00:46:14,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:14,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893367796] [2020-10-20 00:46:14,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266101714] [2020-10-20 00:46:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:46:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:14,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 00:46:14,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:14,172 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:46:14,173 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:14,184 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:14,191 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:46:14,191 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:14,195 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:14,195 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:14,196 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-10-20 00:46:14,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:14,206 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-10-20 00:46:14,207 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:14,221 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:14,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:14,226 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-10-20 00:46:14,227 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:14,235 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:14,236 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:14,236 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2020-10-20 00:46:14,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:14,272 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-10-20 00:46:14,273 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:14,281 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:14,285 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-20 00:46:14,285 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2020-10-20 00:46:14,287 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:14,291 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:14,292 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:14,292 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-10-20 00:46:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:46:14,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:46:14,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-10-20 00:46:14,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532484952] [2020-10-20 00:46:14,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 00:46:14,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:14,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 00:46:14,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:46:14,302 INFO L87 Difference]: Start difference. First operand 147 states and 171 transitions. Second operand 7 states. [2020-10-20 00:46:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:14,639 INFO L93 Difference]: Finished difference Result 274 states and 312 transitions. [2020-10-20 00:46:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 00:46:14,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-10-20 00:46:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:14,642 INFO L225 Difference]: With dead ends: 274 [2020-10-20 00:46:14,642 INFO L226 Difference]: Without dead ends: 240 [2020-10-20 00:46:14,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-20 00:46:14,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-10-20 00:46:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 176. [2020-10-20 00:46:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-20 00:46:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 211 transitions. [2020-10-20 00:46:14,652 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 211 transitions. Word has length 33 [2020-10-20 00:46:14,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:14,652 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 211 transitions. [2020-10-20 00:46:14,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 00:46:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 211 transitions. [2020-10-20 00:46:14,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 00:46:14,653 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:14,653 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:14,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:46:14,868 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1555502369, now seen corresponding path program 1 times [2020-10-20 00:46:14,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:14,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405020599] [2020-10-20 00:46:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 00:46:14,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 00:46:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 00:46:14,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 00:46:14,940 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 00:46:14,941 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 00:46:14,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 00:46:14,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 12:46:14 BoogieIcfgContainer [2020-10-20 00:46:14,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 00:46:14,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 00:46:14,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 00:46:14,994 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 00:46:14,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:46:08" (3/4) ... [2020-10-20 00:46:14,997 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 00:46:15,051 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 00:46:15,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 00:46:15,052 INFO L168 Benchmark]: Toolchain (without parser) took 8171.66 ms. Allocated memory was 41.4 MB in the beginning and 89.7 MB in the end (delta: 48.2 MB). Free memory was 18.0 MB in the beginning and 41.3 MB in the end (delta: -23.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:15,053 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 31.5 MB. Free memory was 7.8 MB in the beginning and 7.7 MB in the end (delta: 45.5 kB). Peak memory consumption was 45.5 kB. Max. memory is 14.3 GB. [2020-10-20 00:46:15,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.65 ms. Allocated memory was 41.4 MB in the beginning and 43.5 MB in the end (delta: 2.1 MB). Free memory was 17.2 MB in the beginning and 20.9 MB in the end (delta: -3.7 MB). Peak memory consumption was 8.8 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:15,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.38 ms. Allocated memory is still 43.5 MB. Free memory was 20.9 MB in the beginning and 18.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:15,054 INFO L168 Benchmark]: Boogie Preprocessor took 44.99 ms. Allocated memory is still 43.5 MB. Free memory was 18.2 MB in the beginning and 15.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:15,055 INFO L168 Benchmark]: RCFGBuilder took 745.91 ms. Allocated memory was 43.5 MB in the beginning and 45.6 MB in the end (delta: 2.1 MB). Free memory was 15.7 MB in the beginning and 13.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.2 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:15,056 INFO L168 Benchmark]: TraceAbstraction took 6608.96 ms. Allocated memory was 45.6 MB in the beginning and 89.7 MB in the end (delta: 44.0 MB). Free memory was 12.3 MB in the beginning and 44.7 MB in the end (delta: -32.3 MB). Peak memory consumption was 11.7 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:15,056 INFO L168 Benchmark]: Witness Printer took 57.73 ms. Allocated memory is still 89.7 MB. Free memory was 44.7 MB in the beginning and 41.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:15,059 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 31.5 MB. Free memory was 7.8 MB in the beginning and 7.7 MB in the end (delta: 45.5 kB). Peak memory consumption was 45.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 643.65 ms. Allocated memory was 41.4 MB in the beginning and 43.5 MB in the end (delta: 2.1 MB). Free memory was 17.2 MB in the beginning and 20.9 MB in the end (delta: -3.7 MB). Peak memory consumption was 8.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 58.38 ms. Allocated memory is still 43.5 MB. Free memory was 20.9 MB in the beginning and 18.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 44.99 ms. Allocated memory is still 43.5 MB. Free memory was 18.2 MB in the beginning and 15.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 745.91 ms. Allocated memory was 43.5 MB in the beginning and 45.6 MB in the end (delta: 2.1 MB). Free memory was 15.7 MB in the beginning and 13.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.2 MB. Max. memory is 14.3 GB. * TraceAbstraction took 6608.96 ms. Allocated memory was 45.6 MB in the beginning and 89.7 MB in the end (delta: 44.0 MB). Free memory was 12.3 MB in the beginning and 44.7 MB in the end (delta: -32.3 MB). Peak memory consumption was 11.7 MB. Max. memory is 14.3 GB. * Witness Printer took 57.73 ms. Allocated memory is still 89.7 MB. Free memory was 44.7 MB in the beginning and 41.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 992]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) [L1004] COND FALSE !(!(list != ((void*)0))) [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner [L1004] list->inner->inner = ((void*)0) [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list [L1023] COND FALSE !(!(((void*)0) != end)) [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner [L1031] COND TRUE len == 0 [L1032] len = 1 [L1035] COND FALSE !(!(((void*)0) != inner)) [L1036] EXPR inner->inner [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 [L1040] EXPR inner->inner [L1040] inner = inner->inner [L1029] COND TRUE ((void*)0) != inner [L1031] COND FALSE !(len == 0) [L1034] len = 2 [L1035] COND FALSE !(!(((void*)0) != inner)) [L1036] EXPR inner->inner [L1036] COND TRUE !(((void*)0) == inner->inner) [L992] COND FALSE !(0) [L992] __assert_fail ("0", "sll-01-2.c", 12, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 110 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.4s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1749 SDtfs, 1984 SDslu, 2722 SDs, 0 SdLazy, 1347 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 792 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 567 NumberOfCodeBlocks, 567 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 119370 SizeOfPredicates, 13 NumberOfNonLiveVariables, 242 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 11/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...