/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:32:17,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:32:17,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:32:17,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:32:17,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:32:17,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:32:17,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:32:17,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:32:17,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:32:17,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:32:17,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:32:17,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:32:17,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:32:17,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:32:17,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:32:17,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:32:17,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:32:17,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:32:17,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:32:17,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:32:17,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:32:17,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:32:17,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:32:17,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:32:17,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:32:17,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:32:17,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:32:17,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:32:17,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:32:17,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:32:17,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:32:17,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:32:17,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:32:17,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:32:17,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:32:17,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:32:17,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:32:17,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:32:17,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:32:17,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:32:17,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:32:17,558 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 10:32:17,602 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:32:17,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:32:17,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:32:17,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:32:17,605 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:32:17,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:32:17,606 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:32:17,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:32:17,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:32:17,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:32:17,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:32:17,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:32:17,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:32:17,609 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:32:17,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:32:17,609 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:32:17,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:32:17,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:32:17,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:32:17,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:32:17,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:32:17,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:32:17,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:32:17,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:32:17,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:32:17,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:32:17,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:32:17,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:32:17,612 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:32:17,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-21 10:32:18,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:32:18,095 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:32:18,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:32:18,102 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:32:18,103 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:32:18,104 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2020-09-21 10:32:18,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b8232e536/41c31f8159b54f9cb2ec59e1e4b17302/FLAGd5b4995cb [2020-09-21 10:32:18,828 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:32:18,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2020-09-21 10:32:18,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b8232e536/41c31f8159b54f9cb2ec59e1e4b17302/FLAGd5b4995cb [2020-09-21 10:32:19,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b8232e536/41c31f8159b54f9cb2ec59e1e4b17302 [2020-09-21 10:32:19,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:32:19,071 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:32:19,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:32:19,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:32:19,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:32:19,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:32:19" (1/1) ... [2020-09-21 10:32:19,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a91d473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:19, skipping insertion in model container [2020-09-21 10:32:19,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:32:19" (1/1) ... [2020-09-21 10:32:19,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:32:19,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:32:19,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:32:19,819 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:32:20,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:32:20,289 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:32:20,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:20 WrapperNode [2020-09-21 10:32:20,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:32:20,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:32:20,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:32:20,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:32:20,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:20" (1/1) ... [2020-09-21 10:32:20,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:20" (1/1) ... [2020-09-21 10:32:20,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:20" (1/1) ... [2020-09-21 10:32:20,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:20" (1/1) ... [2020-09-21 10:32:20,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:20" (1/1) ... [2020-09-21 10:32:20,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:20" (1/1) ... [2020-09-21 10:32:20,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:20" (1/1) ... [2020-09-21 10:32:20,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:32:20,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:32:20,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:32:20,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:32:20,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:20" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-21 10:32:20,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:32:20,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:32:20,526 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-21 10:32:20,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:32:20,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:32:20,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-21 10:32:20,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2020-09-21 10:32:20,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-09-21 10:32:20,527 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2020-09-21 10:32:20,527 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-21 10:32:20,527 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-21 10:32:20,527 INFO L130 BoogieDeclarations]: Found specification of procedure read [2020-09-21 10:32:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure write [2020-09-21 10:32:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2020-09-21 10:32:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2020-09-21 10:32:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2020-09-21 10:32:20,529 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-09-21 10:32:20,529 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-09-21 10:32:20,529 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:32:20,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:32:20,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:32:21,899 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:32:21,900 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:32:21,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:32:21 BoogieIcfgContainer [2020-09-21 10:32:21,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:32:21,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:32:21,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:32:21,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:32:21,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:32:19" (1/3) ... [2020-09-21 10:32:21,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71622eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:32:21, skipping insertion in model container [2020-09-21 10:32:21,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:20" (2/3) ... [2020-09-21 10:32:21,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71622eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:32:21, skipping insertion in model container [2020-09-21 10:32:21,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:32:21" (3/3) ... [2020-09-21 10:32:21,931 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2020-09-21 10:32:21,944 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:32:21,961 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:32:21,983 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:32:22,018 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:32:22,018 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:32:22,018 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:32:22,019 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:32:22,019 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:32:22,019 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:32:22,019 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:32:22,019 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:32:22,050 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states. [2020-09-21 10:32:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-21 10:32:22,070 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:22,071 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:22,072 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:22,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:22,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1057297283, now seen corresponding path program 1 times [2020-09-21 10:32:22,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:22,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1476976261] [2020-09-21 10:32:22,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:23,169 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-09-21 10:32:23,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:23,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1476976261] [2020-09-21 10:32:23,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:23,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:32:23,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485310834] [2020-09-21 10:32:23,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:32:23,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:23,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:32:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:23,330 INFO L87 Difference]: Start difference. First operand 343 states. Second operand 4 states. [2020-09-21 10:32:23,625 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-09-21 10:32:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:25,691 INFO L93 Difference]: Finished difference Result 685 states and 1182 transitions. [2020-09-21 10:32:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:25,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2020-09-21 10:32:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:25,728 INFO L225 Difference]: With dead ends: 685 [2020-09-21 10:32:25,729 INFO L226 Difference]: Without dead ends: 555 [2020-09-21 10:32:25,734 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-09-21 10:32:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 553. [2020-09-21 10:32:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2020-09-21 10:32:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 828 transitions. [2020-09-21 10:32:25,831 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 828 transitions. Word has length 153 [2020-09-21 10:32:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:25,835 INFO L479 AbstractCegarLoop]: Abstraction has 553 states and 828 transitions. [2020-09-21 10:32:25,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:32:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 828 transitions. [2020-09-21 10:32:25,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-21 10:32:25,846 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:25,846 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:25,848 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:32:25,848 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:25,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:25,848 INFO L82 PathProgramCache]: Analyzing trace with hash -795620650, now seen corresponding path program 1 times [2020-09-21 10:32:25,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:25,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [468064463] [2020-09-21 10:32:25,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:26,499 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-09-21 10:32:26,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:26,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [468064463] [2020-09-21 10:32:26,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:26,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:32:26,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752484660] [2020-09-21 10:32:26,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:32:26,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:26,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:32:26,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:26,600 INFO L87 Difference]: Start difference. First operand 553 states and 828 transitions. Second operand 4 states. [2020-09-21 10:32:26,892 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-09-21 10:32:28,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:28,409 INFO L93 Difference]: Finished difference Result 1181 states and 1813 transitions. [2020-09-21 10:32:28,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:28,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2020-09-21 10:32:28,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:28,421 INFO L225 Difference]: With dead ends: 1181 [2020-09-21 10:32:28,422 INFO L226 Difference]: Without dead ends: 967 [2020-09-21 10:32:28,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:28,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2020-09-21 10:32:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965. [2020-09-21 10:32:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2020-09-21 10:32:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1456 transitions. [2020-09-21 10:32:28,512 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1456 transitions. Word has length 153 [2020-09-21 10:32:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:28,513 INFO L479 AbstractCegarLoop]: Abstraction has 965 states and 1456 transitions. [2020-09-21 10:32:28,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:32:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1456 transitions. [2020-09-21 10:32:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-21 10:32:28,517 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:28,517 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:28,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:32:28,518 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:28,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:28,518 INFO L82 PathProgramCache]: Analyzing trace with hash -597767463, now seen corresponding path program 1 times [2020-09-21 10:32:28,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:28,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [224054542] [2020-09-21 10:32:28,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:29,045 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-09-21 10:32:29,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:29,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [224054542] [2020-09-21 10:32:29,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:29,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:29,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528470159] [2020-09-21 10:32:29,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:29,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:29,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:29,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:29,124 INFO L87 Difference]: Start difference. First operand 965 states and 1456 transitions. Second operand 5 states. [2020-09-21 10:32:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:32,035 INFO L93 Difference]: Finished difference Result 2816 states and 4241 transitions. [2020-09-21 10:32:32,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:32,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2020-09-21 10:32:32,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:32,046 INFO L225 Difference]: With dead ends: 2816 [2020-09-21 10:32:32,046 INFO L226 Difference]: Without dead ends: 1864 [2020-09-21 10:32:32,049 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:32:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2020-09-21 10:32:32,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1862. [2020-09-21 10:32:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1862 states. [2020-09-21 10:32:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2783 transitions. [2020-09-21 10:32:32,129 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2783 transitions. Word has length 153 [2020-09-21 10:32:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:32,129 INFO L479 AbstractCegarLoop]: Abstraction has 1862 states and 2783 transitions. [2020-09-21 10:32:32,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:32:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2783 transitions. [2020-09-21 10:32:32,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-09-21 10:32:32,134 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:32,134 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:32,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:32:32,135 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:32,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:32,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2072677733, now seen corresponding path program 1 times [2020-09-21 10:32:32,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:32,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [205066806] [2020-09-21 10:32:32,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:32,426 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-09-21 10:32:32,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:32,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [205066806] [2020-09-21 10:32:32,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:32,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:32:32,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115466392] [2020-09-21 10:32:32,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:32:32,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:32,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:32:32,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:32,482 INFO L87 Difference]: Start difference. First operand 1862 states and 2783 transitions. Second operand 4 states. [2020-09-21 10:32:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:35,708 INFO L93 Difference]: Finished difference Result 5540 states and 8279 transitions. [2020-09-21 10:32:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:32:35,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2020-09-21 10:32:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:35,730 INFO L225 Difference]: With dead ends: 5540 [2020-09-21 10:32:35,730 INFO L226 Difference]: Without dead ends: 3710 [2020-09-21 10:32:35,735 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2020-09-21 10:32:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 1864. [2020-09-21 10:32:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1864 states. [2020-09-21 10:32:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2785 transitions. [2020-09-21 10:32:35,912 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2785 transitions. Word has length 154 [2020-09-21 10:32:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:35,912 INFO L479 AbstractCegarLoop]: Abstraction has 1864 states and 2785 transitions. [2020-09-21 10:32:35,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:32:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2785 transitions. [2020-09-21 10:32:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-09-21 10:32:35,916 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:35,917 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:35,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:32:35,917 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:35,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:35,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1511435868, now seen corresponding path program 1 times [2020-09-21 10:32:35,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:35,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [167459435] [2020-09-21 10:32:35,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:36,329 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-09-21 10:32:36,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:36,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [167459435] [2020-09-21 10:32:36,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:36,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:32:36,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031092692] [2020-09-21 10:32:36,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:32:36,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:36,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:32:36,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:36,413 INFO L87 Difference]: Start difference. First operand 1864 states and 2785 transitions. Second operand 4 states. [2020-09-21 10:32:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:39,322 INFO L93 Difference]: Finished difference Result 4914 states and 7336 transitions. [2020-09-21 10:32:39,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:32:39,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2020-09-21 10:32:39,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:39,341 INFO L225 Difference]: With dead ends: 4914 [2020-09-21 10:32:39,341 INFO L226 Difference]: Without dead ends: 3235 [2020-09-21 10:32:39,346 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2020-09-21 10:32:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3233. [2020-09-21 10:32:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3233 states. [2020-09-21 10:32:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4772 transitions. [2020-09-21 10:32:39,499 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4772 transitions. Word has length 155 [2020-09-21 10:32:39,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:39,499 INFO L479 AbstractCegarLoop]: Abstraction has 3233 states and 4772 transitions. [2020-09-21 10:32:39,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:32:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4772 transitions. [2020-09-21 10:32:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-09-21 10:32:39,506 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:39,506 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:39,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:32:39,507 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:39,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:39,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1385252583, now seen corresponding path program 1 times [2020-09-21 10:32:39,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:39,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28790616] [2020-09-21 10:32:39,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:40,094 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-09-21 10:32:40,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:40,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [28790616] [2020-09-21 10:32:40,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:40,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:40,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805427862] [2020-09-21 10:32:40,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:40,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:40,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:40,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:40,177 INFO L87 Difference]: Start difference. First operand 3233 states and 4772 transitions. Second operand 5 states. [2020-09-21 10:32:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:42,422 INFO L93 Difference]: Finished difference Result 6674 states and 9798 transitions. [2020-09-21 10:32:42,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:42,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2020-09-21 10:32:42,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:42,440 INFO L225 Difference]: With dead ends: 6674 [2020-09-21 10:32:42,441 INFO L226 Difference]: Without dead ends: 3384 [2020-09-21 10:32:42,448 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:32:42,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2020-09-21 10:32:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3382. [2020-09-21 10:32:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2020-09-21 10:32:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4939 transitions. [2020-09-21 10:32:42,651 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4939 transitions. Word has length 155 [2020-09-21 10:32:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:42,652 INFO L479 AbstractCegarLoop]: Abstraction has 3382 states and 4939 transitions. [2020-09-21 10:32:42,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:32:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4939 transitions. [2020-09-21 10:32:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-09-21 10:32:42,658 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:42,658 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:42,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:32:42,659 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:42,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1576644232, now seen corresponding path program 1 times [2020-09-21 10:32:42,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:42,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [253695688] [2020-09-21 10:32:42,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:43,076 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-09-21 10:32:43,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:43,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [253695688] [2020-09-21 10:32:43,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:43,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:43,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012379477] [2020-09-21 10:32:43,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:43,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:43,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:43,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:43,139 INFO L87 Difference]: Start difference. First operand 3382 states and 4939 transitions. Second operand 5 states. [2020-09-21 10:32:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:45,889 INFO L93 Difference]: Finished difference Result 9818 states and 14271 transitions. [2020-09-21 10:32:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:45,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2020-09-21 10:32:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:45,915 INFO L225 Difference]: With dead ends: 9818 [2020-09-21 10:32:45,916 INFO L226 Difference]: Without dead ends: 6508 [2020-09-21 10:32:45,923 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:32:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2020-09-21 10:32:46,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6506. [2020-09-21 10:32:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2020-09-21 10:32:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 9375 transitions. [2020-09-21 10:32:46,208 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 9375 transitions. Word has length 155 [2020-09-21 10:32:46,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:46,209 INFO L479 AbstractCegarLoop]: Abstraction has 6506 states and 9375 transitions. [2020-09-21 10:32:46,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:32:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 9375 transitions. [2020-09-21 10:32:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-09-21 10:32:46,219 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:46,219 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, 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, 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, 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, 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-09-21 10:32:46,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:32:46,219 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:46,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:46,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1957058650, now seen corresponding path program 1 times [2020-09-21 10:32:46,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:46,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2027029491] [2020-09-21 10:32:46,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:46,554 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-09-21 10:32:46,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:46,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2027029491] [2020-09-21 10:32:46,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:46,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:32:46,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606039293] [2020-09-21 10:32:46,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:32:46,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:46,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:32:46,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:46,622 INFO L87 Difference]: Start difference. First operand 6506 states and 9375 transitions. Second operand 4 states. [2020-09-21 10:32:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:49,062 INFO L93 Difference]: Finished difference Result 19324 states and 27821 transitions. [2020-09-21 10:32:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:32:49,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2020-09-21 10:32:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:49,109 INFO L225 Difference]: With dead ends: 19324 [2020-09-21 10:32:49,109 INFO L226 Difference]: Without dead ends: 12934 [2020-09-21 10:32:49,123 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12934 states. [2020-09-21 10:32:49,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12934 to 6518. [2020-09-21 10:32:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6518 states. [2020-09-21 10:32:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6518 states to 6518 states and 9387 transitions. [2020-09-21 10:32:49,550 INFO L78 Accepts]: Start accepts. Automaton has 6518 states and 9387 transitions. Word has length 156 [2020-09-21 10:32:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:49,551 INFO L479 AbstractCegarLoop]: Abstraction has 6518 states and 9387 transitions. [2020-09-21 10:32:49,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:32:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 6518 states and 9387 transitions. [2020-09-21 10:32:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-09-21 10:32:49,560 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:49,561 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, 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, 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, 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, 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-09-21 10:32:49,561 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:32:49,561 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:49,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1213815913, now seen corresponding path program 1 times [2020-09-21 10:32:49,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:49,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [164940017] [2020-09-21 10:32:49,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:49,957 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-09-21 10:32:49,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:50,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [164940017] [2020-09-21 10:32:50,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:50,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:50,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890128546] [2020-09-21 10:32:50,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:50,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:50,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:50,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:50,014 INFO L87 Difference]: Start difference. First operand 6518 states and 9387 transitions. Second operand 5 states. [2020-09-21 10:32:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:52,847 INFO L93 Difference]: Finished difference Result 18922 states and 27149 transitions. [2020-09-21 10:32:52,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:52,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2020-09-21 10:32:52,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:52,873 INFO L225 Difference]: With dead ends: 18922 [2020-09-21 10:32:52,873 INFO L226 Difference]: Without dead ends: 12530 [2020-09-21 10:32:52,886 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:32:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12530 states. [2020-09-21 10:32:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12530 to 12528. [2020-09-21 10:32:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12528 states. [2020-09-21 10:32:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12528 states to 12528 states and 17805 transitions. [2020-09-21 10:32:53,569 INFO L78 Accepts]: Start accepts. Automaton has 12528 states and 17805 transitions. Word has length 157 [2020-09-21 10:32:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:53,570 INFO L479 AbstractCegarLoop]: Abstraction has 12528 states and 17805 transitions. [2020-09-21 10:32:53,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:32:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 12528 states and 17805 transitions. [2020-09-21 10:32:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-09-21 10:32:53,584 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:53,584 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, 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, 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, 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, 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-09-21 10:32:53,584 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:32:53,585 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:53,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:53,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1311057701, now seen corresponding path program 1 times [2020-09-21 10:32:53,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:53,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28823422] [2020-09-21 10:32:53,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:53,965 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-09-21 10:32:53,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:54,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [28823422] [2020-09-21 10:32:54,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:54,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:54,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153814517] [2020-09-21 10:32:54,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:54,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:54,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:54,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:54,023 INFO L87 Difference]: Start difference. First operand 12528 states and 17805 transitions. Second operand 5 states. [2020-09-21 10:32:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:57,483 INFO L93 Difference]: Finished difference Result 35514 states and 50451 transitions. [2020-09-21 10:32:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:57,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2020-09-21 10:32:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:57,524 INFO L225 Difference]: With dead ends: 35514 [2020-09-21 10:32:57,525 INFO L226 Difference]: Without dead ends: 23325 [2020-09-21 10:32:57,547 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:32:57,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23325 states. [2020-09-21 10:32:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23325 to 23323. [2020-09-21 10:32:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23323 states. [2020-09-21 10:32:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23323 states to 23323 states and 32794 transitions. [2020-09-21 10:32:59,224 INFO L78 Accepts]: Start accepts. Automaton has 23323 states and 32794 transitions. Word has length 159 [2020-09-21 10:32:59,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:59,224 INFO L479 AbstractCegarLoop]: Abstraction has 23323 states and 32794 transitions. [2020-09-21 10:32:59,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:32:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 23323 states and 32794 transitions. [2020-09-21 10:32:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-09-21 10:32:59,244 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:59,244 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, 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, 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, 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, 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-09-21 10:32:59,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:32:59,244 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash -408643491, now seen corresponding path program 1 times [2020-09-21 10:32:59,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:59,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2039819587] [2020-09-21 10:32:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:59,714 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-09-21 10:32:59,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:59,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2039819587] [2020-09-21 10:32:59,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:59,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:59,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025372895] [2020-09-21 10:32:59,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:59,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:59,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:59,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:59,771 INFO L87 Difference]: Start difference. First operand 23323 states and 32794 transitions. Second operand 5 states. [2020-09-21 10:33:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:33:03,076 INFO L93 Difference]: Finished difference Result 32909 states and 46146 transitions. [2020-09-21 10:33:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:33:03,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2020-09-21 10:33:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:33:03,100 INFO L225 Difference]: With dead ends: 32909 [2020-09-21 10:33:03,100 INFO L226 Difference]: Without dead ends: 23325 [2020-09-21 10:33:03,117 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:33:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23325 states. [2020-09-21 10:33:04,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23325 to 23036. [2020-09-21 10:33:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23036 states. [2020-09-21 10:33:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23036 states to 23036 states and 32382 transitions. [2020-09-21 10:33:04,131 INFO L78 Accepts]: Start accepts. Automaton has 23036 states and 32382 transitions. Word has length 159 [2020-09-21 10:33:04,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:33:04,132 INFO L479 AbstractCegarLoop]: Abstraction has 23036 states and 32382 transitions. [2020-09-21 10:33:04,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:33:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 23036 states and 32382 transitions. [2020-09-21 10:33:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-09-21 10:33:04,148 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:33:04,148 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, 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, 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, 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, 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-09-21 10:33:04,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:33:04,148 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:33:04,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:33:04,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1879081270, now seen corresponding path program 1 times [2020-09-21 10:33:04,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:33:04,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1889710792] [2020-09-21 10:33:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:33:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:33:04,243 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:33:04,243 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:33:04,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:33:04,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:33:04 BoogieIcfgContainer [2020-09-21 10:33:04,302 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:33:04,304 INFO L168 Benchmark]: Toolchain (without parser) took 45236.14 ms. Allocated memory was 141.0 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 101.7 MB in the beginning and 895.1 MB in the end (delta: -793.3 MB). Peak memory consumption was 315.5 MB. Max. memory is 7.1 GB. [2020-09-21 10:33:04,304 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 10:33:04,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1219.50 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 101.1 MB in the beginning and 169.2 MB in the end (delta: -68.1 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. [2020-09-21 10:33:04,306 INFO L168 Benchmark]: Boogie Preprocessor took 125.23 ms. Allocated memory is still 205.0 MB. Free memory was 169.2 MB in the beginning and 165.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-09-21 10:33:04,306 INFO L168 Benchmark]: RCFGBuilder took 1499.44 ms. Allocated memory was 205.0 MB in the beginning and 237.0 MB in the end (delta: 32.0 MB). Free memory was 165.1 MB in the beginning and 142.1 MB in the end (delta: 23.0 MB). Peak memory consumption was 78.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:33:04,307 INFO L168 Benchmark]: TraceAbstraction took 42381.70 ms. Allocated memory was 237.0 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 140.7 MB in the beginning and 895.1 MB in the end (delta: -754.4 MB). Peak memory consumption was 258.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:33:04,310 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1219.50 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 101.1 MB in the beginning and 169.2 MB in the end (delta: -68.1 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.23 ms. Allocated memory is still 205.0 MB. Free memory was 169.2 MB in the beginning and 165.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1499.44 ms. Allocated memory was 205.0 MB in the beginning and 237.0 MB in the end (delta: 32.0 MB). Free memory was 165.1 MB in the beginning and 142.1 MB in the end (delta: 23.0 MB). Peak memory consumption was 78.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42381.70 ms. Allocated memory was 237.0 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 140.7 MB in the beginning and 895.1 MB in the end (delta: -754.4 MB). Peak memory consumption was 258.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 910]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L15] msg_t nomsg = (msg_t )-1; [L16] port_t p12 = 0; [L17] char p12_old = '\x0'; [L18] char p12_new = '\x0'; [L19] _Bool ep12 = 0; [L20] port_t p13 = 0; [L21] char p13_old = '\x0'; [L22] char p13_new = '\x0'; [L23] _Bool ep13 = 0; [L24] port_t p21 = 0; [L25] char p21_old = '\x0'; [L26] char p21_new = '\x0'; [L27] _Bool ep21 = 0; [L28] port_t p23 = 0; [L29] char p23_old = '\x0'; [L30] char p23_new = '\x0'; [L31] _Bool ep23 = 0; [L32] port_t p31 = 0; [L33] char p31_old = '\x0'; [L34] char p31_new = '\x0'; [L35] _Bool ep31 = 0; [L36] port_t p32 = 0; [L37] char p32_old = '\x0'; [L38] char p32_new = '\x0'; [L39] _Bool ep32 = 0; [L40] char id1 = '\x0'; [L41] unsigned char r1 = '\x0'; [L42] char st1 = '\x0'; [L43] char nl1 = '\x0'; [L44] char m1 = '\x0'; [L45] char max1 = '\x0'; [L46] _Bool mode1 = 0; [L47] _Bool newmax1 = 0; [L48] char id2 = '\x0'; [L49] unsigned char r2 = '\x0'; [L50] char st2 = '\x0'; [L51] char nl2 = '\x0'; [L52] char m2 = '\x0'; [L53] char max2 = '\x0'; [L54] _Bool mode2 = 0; [L55] _Bool newmax2 = 0; [L56] char id3 = '\x0'; [L57] unsigned char r3 = '\x0'; [L58] char st3 = '\x0'; [L59] char nl3 = '\x0'; [L60] char m3 = '\x0'; [L61] char max3 = '\x0'; [L62] _Bool mode3 = 0; [L63] _Bool newmax3 = 0; [L67] void (*nodes[3])() = { &node1, &node2, &node3 }; [L71] int __return_1873; [L72] int __return_2019; [L73] int __return_2152; [L74] int __return_2288; [L75] int __return_2426; [L76] int __return_2551; [L79] int main__c1; [L80] int main__i2; [L81] main__c1 = 0 [L82] ep12 = __VERIFIER_nondet_bool() [L83] ep13 = __VERIFIER_nondet_bool() [L84] ep21 = __VERIFIER_nondet_bool() [L85] ep23 = __VERIFIER_nondet_bool() [L86] ep31 = __VERIFIER_nondet_bool() [L87] ep32 = __VERIFIER_nondet_bool() [L88] id1 = __VERIFIER_nondet_char() [L89] r1 = __VERIFIER_nondet_uchar() [L90] st1 = __VERIFIER_nondet_char() [L91] nl1 = __VERIFIER_nondet_char() [L92] m1 = __VERIFIER_nondet_char() [L93] max1 = __VERIFIER_nondet_char() [L94] mode1 = __VERIFIER_nondet_bool() [L95] newmax1 = __VERIFIER_nondet_bool() [L96] id2 = __VERIFIER_nondet_char() [L97] r2 = __VERIFIER_nondet_uchar() [L98] st2 = __VERIFIER_nondet_char() [L99] nl2 = __VERIFIER_nondet_char() [L100] m2 = __VERIFIER_nondet_char() [L101] max2 = __VERIFIER_nondet_char() [L102] mode2 = __VERIFIER_nondet_bool() [L103] newmax2 = __VERIFIER_nondet_bool() [L104] id3 = __VERIFIER_nondet_char() [L105] r3 = __VERIFIER_nondet_uchar() [L106] st3 = __VERIFIER_nondet_char() [L107] nl3 = __VERIFIER_nondet_char() [L108] m3 = __VERIFIER_nondet_char() [L109] max3 = __VERIFIER_nondet_char() [L110] mode3 = __VERIFIER_nondet_bool() [L111] newmax3 = __VERIFIER_nondet_bool() [L113] _Bool init__r121; [L114] _Bool init__r131; [L115] _Bool init__r211; [L116] _Bool init__r231; [L117] _Bool init__r311; [L118] _Bool init__r321; [L119] _Bool init__r122; [L120] int init__tmp; [L121] _Bool init__r132; [L122] int init__tmp___0; [L123] _Bool init__r212; [L124] int init__tmp___1; [L125] _Bool init__r232; [L126] int init__tmp___2; [L127] _Bool init__r312; [L128] int init__tmp___3; [L129] _Bool init__r322; [L130] int init__tmp___4; [L131] int init__tmp___5; [L132] init__r121 = ep12 [L133] init__r131 = ep13 [L134] init__r211 = ep21 [L135] init__r231 = ep23 [L136] init__r311 = ep31 [L137] init__r321 = ep32 [L138] COND FALSE !(!(init__r121 == 0)) [L2454] COND FALSE !(!(init__r131 == 0)) [L2470] init__tmp = 0 [L142] init__r122 = (_Bool)init__tmp [L143] COND FALSE !(!(init__r131 == 0)) [L2431] COND FALSE !(!(init__r121 == 0)) [L2447] init__tmp___0 = 0 [L147] init__r132 = (_Bool)init__tmp___0 [L148] COND FALSE !(!(init__r211 == 0)) [L2408] COND FALSE !(!(init__r231 == 0)) [L2424] init__tmp___1 = 0 [L152] init__r212 = (_Bool)init__tmp___1 [L153] COND FALSE !(!(init__r231 == 0)) [L2385] COND FALSE !(!(init__r211 == 0)) [L2401] init__tmp___2 = 0 [L157] init__r232 = (_Bool)init__tmp___2 [L158] COND FALSE !(!(init__r311 == 0)) [L2362] COND FALSE !(!(init__r321 == 0)) [L2378] init__tmp___3 = 0 [L162] init__r312 = (_Bool)init__tmp___3 [L163] COND FALSE !(!(init__r321 == 0)) [L2339] COND FALSE !(!(init__r311 == 0)) [L2355] init__tmp___4 = 0 [L167] init__r322 = (_Bool)init__tmp___4 [L168] COND TRUE ((int)id1) != ((int)id2) [L170] COND TRUE ((int)id1) != ((int)id3) [L172] COND TRUE ((int)id2) != ((int)id3) [L174] COND TRUE ((int)id1) >= 0 [L176] COND TRUE ((int)id2) >= 0 [L178] COND TRUE ((int)id3) >= 0 [L180] COND TRUE ((int)r1) == 0 [L182] COND TRUE ((int)r2) == 0 [L184] COND TRUE ((int)r3) == 0 [L186] COND TRUE ((int)max1) == ((int)id1) [L188] COND TRUE ((int)max2) == ((int)id2) [L190] COND TRUE ((int)max3) == ((int)id3) [L192] COND TRUE ((int)st1) == 0 [L194] COND TRUE ((int)st2) == 0 [L196] COND TRUE ((int)st3) == 0 [L198] COND TRUE ((int)nl1) == 0 [L200] COND TRUE ((int)nl2) == 0 [L202] COND TRUE ((int)nl3) == 0 [L204] COND TRUE ((int)mode1) == 0 [L206] COND TRUE ((int)mode2) == 0 [L208] COND TRUE ((int)mode3) == 0 [L210] COND TRUE !(newmax1 == 0) [L212] COND TRUE !(newmax2 == 0) [L214] COND TRUE !(newmax3 == 0) [L216] init__tmp___5 = 1 [L217] __return_1873 = init__tmp___5 [L218] main__i2 = __return_1873 [L219] COND TRUE main__i2 != 0 [L221] p12_old = nomsg [L222] p12_new = nomsg [L223] p13_old = nomsg [L224] p13_new = nomsg [L225] p21_old = nomsg [L226] p21_new = nomsg [L227] p23_old = nomsg [L228] p23_new = nomsg [L229] p31_old = nomsg [L230] p31_new = nomsg [L231] p32_old = nomsg [L232] p32_new = nomsg [L233] main__i2 = 0 [L235] _Bool node1__newmax; [L236] node1__newmax = 0 [L237] COND FALSE !(!(mode1 == 0)) [L243] COND TRUE ((int)r1) < 2 [L245] COND FALSE !(!(ep12 == 0)) [L258] COND FALSE !(!(ep13 == 0)) [L271] mode1 = 1 [L273] _Bool node2__newmax; [L274] node2__newmax = 0 [L275] COND FALSE !(!(mode2 == 0)) [L281] COND TRUE ((int)r2) < 2 [L283] COND FALSE !(!(ep21 == 0)) [L296] COND FALSE !(!(ep23 == 0)) [L309] mode2 = 1 [L311] _Bool node3__newmax; [L312] node3__newmax = 0 [L313] COND FALSE !(!(mode3 == 0)) [L319] COND TRUE ((int)r3) < 2 [L321] COND FALSE !(!(ep31 == 0)) [L334] COND FALSE !(!(ep32 == 0)) [L347] mode3 = 1 [L348] p12_old = p12_new [L349] p12_new = nomsg [L350] p13_old = p13_new [L351] p13_new = nomsg [L352] p21_old = p21_new [L353] p21_new = nomsg [L354] p23_old = p23_new [L355] p23_new = nomsg [L356] p31_old = p31_new [L357] p31_new = nomsg [L358] p32_old = p32_new [L359] p32_new = nomsg [L361] int check__tmp; [L362] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 [L364] COND TRUE (((int)st1) + ((int)nl1)) <= 1 [L366] COND TRUE (((int)st2) + ((int)nl2)) <= 1 [L368] COND TRUE (((int)st3) + ((int)nl3)) <= 1 [L370] COND FALSE !(((int)r1) >= 2) [L376] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 [L378] COND TRUE ((int)r1) < 2 [L380] COND FALSE !(((int)r1) >= 2) [L386] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 [L388] COND TRUE ((int)r1) < 2 [L390] check__tmp = 1 [L391] __return_2019 = check__tmp [L392] main__c1 = __return_2019 [L394] _Bool __tmp_1; [L395] __tmp_1 = main__c1 [L396] _Bool assert__arg; [L397] assert__arg = __tmp_1 [L398] COND FALSE !(assert__arg == 0) [L405] _Bool node1__newmax; [L406] node1__newmax = 0 [L407] COND TRUE !(mode1 == 0) [L409] COND FALSE !(r1 == 255) [L415] r1 = r1 + 1 [L416] COND FALSE !(!(ep21 == 0)) [L425] COND FALSE !(!(ep31 == 0)) [L434] newmax1 = node1__newmax [L435] COND FALSE !(((int)r1) == 2) [L441] mode1 = 0 [L443] _Bool node2__newmax; [L444] node2__newmax = 0 [L445] COND TRUE !(mode2 == 0) [L447] COND FALSE !(r2 == 255) [L453] r2 = r2 + 1 [L454] COND FALSE !(!(ep12 == 0)) [L463] COND FALSE !(!(ep32 == 0)) [L472] newmax2 = node2__newmax [L473] COND FALSE !(((int)r2) == 2) [L479] mode2 = 0 [L481] _Bool node3__newmax; [L482] node3__newmax = 0 [L483] COND TRUE !(mode3 == 0) [L485] COND FALSE !(r3 == 255) [L491] r3 = r3 + 1 [L492] COND FALSE !(!(ep13 == 0)) [L501] COND FALSE !(!(ep23 == 0)) [L510] newmax3 = node3__newmax [L511] COND FALSE !(((int)r3) == 2) [L517] mode3 = 0 [L518] p12_old = p12_new [L519] p12_new = nomsg [L520] p13_old = p13_new [L521] p13_new = nomsg [L522] p21_old = p21_new [L523] p21_new = nomsg [L524] p23_old = p23_new [L525] p23_new = nomsg [L526] p31_old = p31_new [L527] p31_new = nomsg [L528] p32_old = p32_new [L529] p32_new = nomsg [L531] int check__tmp; [L532] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 [L534] COND TRUE (((int)st1) + ((int)nl1)) <= 1 [L536] COND TRUE (((int)st2) + ((int)nl2)) <= 1 [L538] COND TRUE (((int)st3) + ((int)nl3)) <= 1 [L540] COND FALSE !(((int)r1) >= 2) [L546] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 [L548] COND TRUE ((int)r1) < 2 [L550] COND FALSE !(((int)r1) >= 2) [L556] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 [L558] COND TRUE ((int)r1) < 2 [L560] check__tmp = 1 [L561] __return_2152 = check__tmp [L562] main__c1 = __return_2152 [L564] _Bool __tmp_2; [L565] __tmp_2 = main__c1 [L566] _Bool assert__arg; [L567] assert__arg = __tmp_2 [L568] COND FALSE !(assert__arg == 0) [L575] _Bool node1__newmax; [L576] node1__newmax = 0 [L577] COND FALSE !(!(mode1 == 0)) [L583] COND TRUE ((int)r1) < 2 [L585] COND FALSE !(!(ep12 == 0)) [L598] COND FALSE !(!(ep13 == 0)) [L611] mode1 = 1 [L613] _Bool node2__newmax; [L614] node2__newmax = 0 [L615] COND FALSE !(!(mode2 == 0)) [L621] COND TRUE ((int)r2) < 2 [L623] COND FALSE !(!(ep21 == 0)) [L636] COND FALSE !(!(ep23 == 0)) [L649] mode2 = 1 [L651] _Bool node3__newmax; [L652] node3__newmax = 0 [L653] COND FALSE !(!(mode3 == 0)) [L659] COND TRUE ((int)r3) < 2 [L661] COND FALSE !(!(ep31 == 0)) [L674] COND FALSE !(!(ep32 == 0)) [L687] mode3 = 1 [L688] p12_old = p12_new [L689] p12_new = nomsg [L690] p13_old = p13_new [L691] p13_new = nomsg [L692] p21_old = p21_new [L693] p21_new = nomsg [L694] p23_old = p23_new [L695] p23_new = nomsg [L696] p31_old = p31_new [L697] p31_new = nomsg [L698] p32_old = p32_new [L699] p32_new = nomsg [L701] int check__tmp; [L702] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 [L704] COND TRUE (((int)st1) + ((int)nl1)) <= 1 [L706] COND TRUE (((int)st2) + ((int)nl2)) <= 1 [L708] COND TRUE (((int)st3) + ((int)nl3)) <= 1 [L710] COND FALSE !(((int)r1) >= 2) [L716] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 [L718] COND TRUE ((int)r1) < 2 [L720] COND FALSE !(((int)r1) >= 2) [L726] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 [L728] COND TRUE ((int)r1) < 2 [L730] check__tmp = 1 [L731] __return_2288 = check__tmp [L732] main__c1 = __return_2288 [L734] _Bool __tmp_3; [L735] __tmp_3 = main__c1 [L736] _Bool assert__arg; [L737] assert__arg = __tmp_3 [L738] COND FALSE !(assert__arg == 0) [L745] _Bool node1__newmax; [L746] node1__newmax = 0 [L747] COND TRUE !(mode1 == 0) [L749] COND FALSE !(r1 == 255) [L755] r1 = r1 + 1 [L756] COND FALSE !(!(ep21 == 0)) [L765] COND FALSE !(!(ep31 == 0)) [L774] newmax1 = node1__newmax [L775] COND TRUE ((int)r1) == 2 [L777] COND TRUE ((int)max1) == ((int)id1) [L779] st1 = 1 [L781] mode1 = 0 [L783] _Bool node2__newmax; [L784] node2__newmax = 0 [L785] COND TRUE !(mode2 == 0) [L787] COND FALSE !(r2 == 255) [L793] r2 = r2 + 1 [L794] COND FALSE !(!(ep12 == 0)) [L803] COND FALSE !(!(ep32 == 0)) [L812] newmax2 = node2__newmax [L813] COND TRUE ((int)r2) == 2 [L815] COND TRUE ((int)max2) == ((int)id2) [L817] st2 = 1 [L819] mode2 = 0 [L821] _Bool node3__newmax; [L822] node3__newmax = 0 [L823] COND TRUE !(mode3 == 0) [L825] COND FALSE !(r3 == 255) [L831] r3 = r3 + 1 [L832] COND FALSE !(!(ep13 == 0)) [L841] COND FALSE !(!(ep23 == 0)) [L850] newmax3 = node3__newmax [L851] COND TRUE ((int)r3) == 2 [L853] COND TRUE ((int)max3) == ((int)id3) [L855] st3 = 1 [L857] mode3 = 0 [L858] p12_old = p12_new [L859] p12_new = nomsg [L860] p13_old = p13_new [L861] p13_new = nomsg [L862] p21_old = p21_new [L863] p21_new = nomsg [L864] p23_old = p23_new [L865] p23_new = nomsg [L866] p31_old = p31_new [L867] p31_new = nomsg [L868] p32_old = p32_new [L869] p32_new = nomsg [L871] int check__tmp; [L872] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1568] check__tmp = 0 [L900] __return_2426 = check__tmp [L901] main__c1 = __return_2426 [L904] _Bool __tmp_4; [L905] __tmp_4 = main__c1 [L906] _Bool assert__arg; [L907] assert__arg = __tmp_4 [L908] COND TRUE assert__arg == 0 [L910] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 347 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 42.2s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 30.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8368 SDtfs, 8425 SDslu, 4959 SDs, 0 SdLazy, 8906 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23323occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 8567 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1868 NumberOfCodeBlocks, 1868 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1698 ConstructedInterpolants, 0 QuantifiedInterpolants, 965054 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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...