/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_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:31:32,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:31:32,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:31:32,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:31:32,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:31:32,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:31:32,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:31:32,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:31:32,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:31:32,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:31:32,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:31:32,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:31:32,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:31:32,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:31:32,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:31:32,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:31:32,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:31:32,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:31:33,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:31:33,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:31:33,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:31:33,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:31:33,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:31:33,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:31:33,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:31:33,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:31:33,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:31:33,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:31:33,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:31:33,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:31:33,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:31:33,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:31:33,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:31:33,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:31:33,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:31:33,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:31:33,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:31:33,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:31:33,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:31:33,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:31:33,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:31:33,026 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:31:33,055 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:31:33,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:31:33,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:31:33,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:31:33,057 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:31:33,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:31:33,057 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:31:33,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:31:33,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:31:33,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:31:33,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:31:33,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:31:33,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:31:33,059 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:31:33,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:31:33,059 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:31:33,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:31:33,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:31:33,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:31:33,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:31:33,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:31:33,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:31:33,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:31:33,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:31:33,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:31:33,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:31:33,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:31:33,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:31:33,062 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:31:33,062 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:31:33,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:31:33,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:31:33,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:31:33,562 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:31:33,563 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:31:33,564 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2020-09-21 10:31:33,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/118256a36/05f2b9de68254b2fb5c611ab5c61130a/FLAG2449090e5 [2020-09-21 10:31:34,300 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:31:34,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2020-09-21 10:31:34,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/118256a36/05f2b9de68254b2fb5c611ab5c61130a/FLAG2449090e5 [2020-09-21 10:31:34,530 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/118256a36/05f2b9de68254b2fb5c611ab5c61130a [2020-09-21 10:31:34,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:31:34,550 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:31:34,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:31:34,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:31:34,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:31:34,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:31:34" (1/1) ... [2020-09-21 10:31:34,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d5df5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:31:34, skipping insertion in model container [2020-09-21 10:31:34,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:31:34" (1/1) ... [2020-09-21 10:31:34,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:31:34,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:31:35,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:31:35,343 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:31:35,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:31:35,907 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:31:35,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:31:35 WrapperNode [2020-09-21 10:31:35,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:31:35,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:31:35,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:31:35,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:31:35,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:31:35" (1/1) ... [2020-09-21 10:31:35,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:31:35" (1/1) ... [2020-09-21 10:31:35,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:31:35" (1/1) ... [2020-09-21 10:31:35,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:31:35" (1/1) ... [2020-09-21 10:31:35,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:31:35" (1/1) ... [2020-09-21 10:31:36,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:31:35" (1/1) ... [2020-09-21 10:31:36,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:31:35" (1/1) ... [2020-09-21 10:31:36,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:31:36,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:31:36,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:31:36,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:31:36,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:31:35" (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:31:36,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:31:36,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:31:36,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-21 10:31:36,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:31:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:31:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-21 10:31:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2020-09-21 10:31:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-09-21 10:31:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2020-09-21 10:31:36,143 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-21 10:31:36,143 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-21 10:31:36,143 INFO L130 BoogieDeclarations]: Found specification of procedure read [2020-09-21 10:31:36,143 INFO L130 BoogieDeclarations]: Found specification of procedure write [2020-09-21 10:31:36,143 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2020-09-21 10:31:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2020-09-21 10:31:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2020-09-21 10:31:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-09-21 10:31:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-09-21 10:31:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:31:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:31:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:31:37,633 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:31:37,633 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:31:37,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:31:37 BoogieIcfgContainer [2020-09-21 10:31:37,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:31:37,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:31:37,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:31:37,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:31:37,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:31:34" (1/3) ... [2020-09-21 10:31:37,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23727a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:31:37, skipping insertion in model container [2020-09-21 10:31:37,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:31:35" (2/3) ... [2020-09-21 10:31:37,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23727a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:31:37, skipping insertion in model container [2020-09-21 10:31:37,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:31:37" (3/3) ... [2020-09-21 10:31:37,652 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2020-09-21 10:31:37,665 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:31:37,676 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-09-21 10:31:37,701 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-09-21 10:31:37,736 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:31:37,736 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:31:37,736 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:31:37,736 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:31:37,737 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:31:37,737 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:31:37,737 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:31:37,737 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:31:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states. [2020-09-21 10:31:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-09-21 10:31:37,787 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:31:37,788 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] [2020-09-21 10:31:37,789 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:31:37,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:31:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash -731921028, now seen corresponding path program 1 times [2020-09-21 10:31:37,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:31:37,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1743412614] [2020-09-21 10:31:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:31:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:38,910 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-09-21 10:31:38,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:31:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:39,024 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:31:39,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1743412614] [2020-09-21 10:31:39,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:31:39,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:31:39,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572998865] [2020-09-21 10:31:39,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:31:39,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:31:39,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:31:39,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:31:39,056 INFO L87 Difference]: Start difference. First operand 387 states. Second operand 4 states. [2020-09-21 10:31:39,393 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2020-09-21 10:31:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:31:42,084 INFO L93 Difference]: Finished difference Result 708 states and 1251 transitions. [2020-09-21 10:31:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:31:42,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2020-09-21 10:31:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:31:42,114 INFO L225 Difference]: With dead ends: 708 [2020-09-21 10:31:42,115 INFO L226 Difference]: Without dead ends: 553 [2020-09-21 10:31:42,120 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:31:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-09-21 10:31:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 551. [2020-09-21 10:31:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2020-09-21 10:31:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 806 transitions. [2020-09-21 10:31:42,222 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 806 transitions. Word has length 139 [2020-09-21 10:31:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:31:42,223 INFO L479 AbstractCegarLoop]: Abstraction has 551 states and 806 transitions. [2020-09-21 10:31:42,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:31:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 806 transitions. [2020-09-21 10:31:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-09-21 10:31:42,230 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:31:42,230 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] [2020-09-21 10:31:42,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:31:42,231 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:31:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:31:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash 807798716, now seen corresponding path program 1 times [2020-09-21 10:31:42,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:31:42,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [436452939] [2020-09-21 10:31:42,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:31:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:42,830 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-09-21 10:31:42,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:31:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:42,879 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:31:42,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [436452939] [2020-09-21 10:31:42,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:31:42,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:31:42,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448583146] [2020-09-21 10:31:42,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:31:42,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:31:42,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:31:42,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:31:42,883 INFO L87 Difference]: Start difference. First operand 551 states and 806 transitions. Second operand 4 states. [2020-09-21 10:31:43,162 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2020-09-21 10:31:45,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:31:45,306 INFO L93 Difference]: Finished difference Result 1108 states and 1675 transitions. [2020-09-21 10:31:45,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:31:45,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2020-09-21 10:31:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:31:45,313 INFO L225 Difference]: With dead ends: 1108 [2020-09-21 10:31:45,313 INFO L226 Difference]: Without dead ends: 891 [2020-09-21 10:31:45,316 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:31:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2020-09-21 10:31:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2020-09-21 10:31:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2020-09-21 10:31:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1322 transitions. [2020-09-21 10:31:45,365 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1322 transitions. Word has length 139 [2020-09-21 10:31:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:31:45,366 INFO L479 AbstractCegarLoop]: Abstraction has 889 states and 1322 transitions. [2020-09-21 10:31:45,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:31:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1322 transitions. [2020-09-21 10:31:45,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-09-21 10:31:45,370 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:31:45,370 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] [2020-09-21 10:31:45,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:31:45,371 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:31:45,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:31:45,372 INFO L82 PathProgramCache]: Analyzing trace with hash -332552132, now seen corresponding path program 1 times [2020-09-21 10:31:45,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:31:45,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [692926765] [2020-09-21 10:31:45,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:31:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:45,894 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-09-21 10:31:45,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:31:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:45,975 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:31:45,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [692926765] [2020-09-21 10:31:45,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:31:45,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:31:45,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463031847] [2020-09-21 10:31:45,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:31:45,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:31:45,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:31:45,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:31:45,980 INFO L87 Difference]: Start difference. First operand 889 states and 1322 transitions. Second operand 5 states. [2020-09-21 10:31:49,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:31:49,108 INFO L93 Difference]: Finished difference Result 2594 states and 3851 transitions. [2020-09-21 10:31:49,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:31:49,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2020-09-21 10:31:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:31:49,118 INFO L225 Difference]: With dead ends: 2594 [2020-09-21 10:31:49,118 INFO L226 Difference]: Without dead ends: 1718 [2020-09-21 10:31:49,122 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:31:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2020-09-21 10:31:49,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1690. [2020-09-21 10:31:49,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2020-09-21 10:31:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2499 transitions. [2020-09-21 10:31:49,222 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2499 transitions. Word has length 139 [2020-09-21 10:31:49,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:31:49,223 INFO L479 AbstractCegarLoop]: Abstraction has 1690 states and 2499 transitions. [2020-09-21 10:31:49,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:31:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2499 transitions. [2020-09-21 10:31:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-21 10:31:49,228 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:31:49,229 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] [2020-09-21 10:31:49,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:31:49,229 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:31:49,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:31:49,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1153443372, now seen corresponding path program 1 times [2020-09-21 10:31:49,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:31:49,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [421836076] [2020-09-21 10:31:49,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:31:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:49,542 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-09-21 10:31:49,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:31:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:49,605 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:31:49,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [421836076] [2020-09-21 10:31:49,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:31:49,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:31:49,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288435527] [2020-09-21 10:31:49,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:31:49,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:31:49,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:31:49,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:31:49,609 INFO L87 Difference]: Start difference. First operand 1690 states and 2499 transitions. Second operand 4 states. [2020-09-21 10:31:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:31:51,807 INFO L93 Difference]: Finished difference Result 5024 states and 7427 transitions. [2020-09-21 10:31:51,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:31:51,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-09-21 10:31:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:31:51,829 INFO L225 Difference]: With dead ends: 5024 [2020-09-21 10:31:51,829 INFO L226 Difference]: Without dead ends: 3366 [2020-09-21 10:31:51,835 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:31:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3366 states. [2020-09-21 10:31:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3366 to 1692. [2020-09-21 10:31:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1692 states. [2020-09-21 10:31:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2501 transitions. [2020-09-21 10:31:51,965 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 2501 transitions. Word has length 140 [2020-09-21 10:31:51,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:31:51,967 INFO L479 AbstractCegarLoop]: Abstraction has 1692 states and 2501 transitions. [2020-09-21 10:31:51,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:31:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2501 transitions. [2020-09-21 10:31:51,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-09-21 10:31:51,971 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:31:51,971 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] [2020-09-21 10:31:51,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:31:51,972 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:31:51,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:31:51,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2018819803, now seen corresponding path program 1 times [2020-09-21 10:31:51,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:31:51,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1607444411] [2020-09-21 10:31:51,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:31:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:52,454 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-09-21 10:31:52,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:31:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:52,526 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:31:52,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1607444411] [2020-09-21 10:31:52,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:31:52,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:31:52,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605276249] [2020-09-21 10:31:52,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:31:52,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:31:52,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:31:52,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:31:52,530 INFO L87 Difference]: Start difference. First operand 1692 states and 2501 transitions. Second operand 5 states. [2020-09-21 10:31:54,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:31:54,997 INFO L93 Difference]: Finished difference Result 4920 states and 7255 transitions. [2020-09-21 10:31:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:31:54,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2020-09-21 10:31:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:31:55,014 INFO L225 Difference]: With dead ends: 4920 [2020-09-21 10:31:55,014 INFO L226 Difference]: Without dead ends: 3262 [2020-09-21 10:31:55,018 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:31:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2020-09-21 10:31:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3234. [2020-09-21 10:31:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2020-09-21 10:31:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 4739 transitions. [2020-09-21 10:31:55,186 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 4739 transitions. Word has length 141 [2020-09-21 10:31:55,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:31:55,186 INFO L479 AbstractCegarLoop]: Abstraction has 3234 states and 4739 transitions. [2020-09-21 10:31:55,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:31:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 4739 transitions. [2020-09-21 10:31:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-09-21 10:31:55,193 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:31:55,193 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] [2020-09-21 10:31:55,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:31:55,194 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:31:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:31:55,194 INFO L82 PathProgramCache]: Analyzing trace with hash -551640981, now seen corresponding path program 1 times [2020-09-21 10:31:55,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:31:55,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [567691353] [2020-09-21 10:31:55,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:31:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:55,520 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-09-21 10:31:55,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:31:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:55,560 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:31:55,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [567691353] [2020-09-21 10:31:55,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:31:55,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:31:55,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856238633] [2020-09-21 10:31:55,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:31:55,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:31:55,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:31:55,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:31:55,563 INFO L87 Difference]: Start difference. First operand 3234 states and 4739 transitions. Second operand 4 states. [2020-09-21 10:31:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:31:58,987 INFO L93 Difference]: Finished difference Result 9618 states and 14089 transitions. [2020-09-21 10:31:58,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:31:58,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2020-09-21 10:31:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:31:59,015 INFO L225 Difference]: With dead ends: 9618 [2020-09-21 10:31:59,016 INFO L226 Difference]: Without dead ends: 6432 [2020-09-21 10:31:59,022 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:31:59,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6432 states. [2020-09-21 10:31:59,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6432 to 3238. [2020-09-21 10:31:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3238 states. [2020-09-21 10:31:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 4743 transitions. [2020-09-21 10:31:59,197 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 4743 transitions. Word has length 142 [2020-09-21 10:31:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:31:59,197 INFO L479 AbstractCegarLoop]: Abstraction has 3238 states and 4743 transitions. [2020-09-21 10:31:59,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:31:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 4743 transitions. [2020-09-21 10:31:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-09-21 10:31:59,203 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:31:59,203 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] [2020-09-21 10:31:59,203 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:31:59,205 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:31:59,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:31:59,205 INFO L82 PathProgramCache]: Analyzing trace with hash -2117388245, now seen corresponding path program 1 times [2020-09-21 10:31:59,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:31:59,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2130124805] [2020-09-21 10:31:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:31:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:59,575 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-09-21 10:31:59,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:31:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:31:59,630 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:31:59,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2130124805] [2020-09-21 10:31:59,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:31:59,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:31:59,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899814109] [2020-09-21 10:31:59,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:31:59,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:31:59,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:31:59,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:31:59,634 INFO L87 Difference]: Start difference. First operand 3238 states and 4743 transitions. Second operand 4 states. [2020-09-21 10:32:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:02,928 INFO L93 Difference]: Finished difference Result 8535 states and 12504 transitions. [2020-09-21 10:32:02,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:32:02,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2020-09-21 10:32:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:02,950 INFO L225 Difference]: With dead ends: 8535 [2020-09-21 10:32:02,950 INFO L226 Difference]: Without dead ends: 5581 [2020-09-21 10:32:02,957 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:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5581 states. [2020-09-21 10:32:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5581 to 5553. [2020-09-21 10:32:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5553 states. [2020-09-21 10:32:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5553 states to 5553 states and 8032 transitions. [2020-09-21 10:32:03,344 INFO L78 Accepts]: Start accepts. Automaton has 5553 states and 8032 transitions. Word has length 143 [2020-09-21 10:32:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:03,344 INFO L479 AbstractCegarLoop]: Abstraction has 5553 states and 8032 transitions. [2020-09-21 10:32:03,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:32:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5553 states and 8032 transitions. [2020-09-21 10:32:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-09-21 10:32:03,361 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:03,361 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] [2020-09-21 10:32:03,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:32:03,362 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:03,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:03,362 INFO L82 PathProgramCache]: Analyzing trace with hash 755501102, now seen corresponding path program 1 times [2020-09-21 10:32:03,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:03,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1198376056] [2020-09-21 10:32:03,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:03,789 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-09-21 10:32:03,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:03,829 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:03,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1198376056] [2020-09-21 10:32:03,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:03,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:03,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187827629] [2020-09-21 10:32:03,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:03,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:03,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:03,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:03,837 INFO L87 Difference]: Start difference. First operand 5553 states and 8032 transitions. Second operand 5 states. [2020-09-21 10:32:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:06,146 INFO L93 Difference]: Finished difference Result 11458 states and 16461 transitions. [2020-09-21 10:32:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:06,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2020-09-21 10:32:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:06,169 INFO L225 Difference]: With dead ends: 11458 [2020-09-21 10:32:06,170 INFO L226 Difference]: Without dead ends: 5789 [2020-09-21 10:32:06,179 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:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5789 states. [2020-09-21 10:32:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5789 to 5761. [2020-09-21 10:32:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5761 states. [2020-09-21 10:32:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5761 states to 5761 states and 8216 transitions. [2020-09-21 10:32:06,444 INFO L78 Accepts]: Start accepts. Automaton has 5761 states and 8216 transitions. Word has length 143 [2020-09-21 10:32:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:06,444 INFO L479 AbstractCegarLoop]: Abstraction has 5761 states and 8216 transitions. [2020-09-21 10:32:06,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:32:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 5761 states and 8216 transitions. [2020-09-21 10:32:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-09-21 10:32:06,453 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:06,454 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] [2020-09-21 10:32:06,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:32:06,454 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:06,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1606177018, now seen corresponding path program 1 times [2020-09-21 10:32:06,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:06,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1134449675] [2020-09-21 10:32:06,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:06,878 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-09-21 10:32:06,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:06,936 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:06,936 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1134449675] [2020-09-21 10:32:06,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:06,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:06,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634435581] [2020-09-21 10:32:06,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:06,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:06,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:06,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:06,938 INFO L87 Difference]: Start difference. First operand 5761 states and 8216 transitions. Second operand 5 states. [2020-09-21 10:32:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:10,222 INFO L93 Difference]: Finished difference Result 8092 states and 11511 transitions. [2020-09-21 10:32:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:10,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2020-09-21 10:32:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:10,234 INFO L225 Difference]: With dead ends: 8092 [2020-09-21 10:32:10,235 INFO L226 Difference]: Without dead ends: 5789 [2020-09-21 10:32:10,240 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:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5789 states. [2020-09-21 10:32:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5789 to 5553. [2020-09-21 10:32:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5553 states. [2020-09-21 10:32:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5553 states to 5553 states and 7958 transitions. [2020-09-21 10:32:10,491 INFO L78 Accepts]: Start accepts. Automaton has 5553 states and 7958 transitions. Word has length 143 [2020-09-21 10:32:10,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:10,492 INFO L479 AbstractCegarLoop]: Abstraction has 5553 states and 7958 transitions. [2020-09-21 10:32:10,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:32:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 5553 states and 7958 transitions. [2020-09-21 10:32:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-09-21 10:32:10,500 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:10,500 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] [2020-09-21 10:32:10,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:32:10,501 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:10,501 INFO L82 PathProgramCache]: Analyzing trace with hash 758328694, now seen corresponding path program 1 times [2020-09-21 10:32:10,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:10,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [23177170] [2020-09-21 10:32:10,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:10,960 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-09-21 10:32:10,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:11,004 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:11,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [23177170] [2020-09-21 10:32:11,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:11,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:32:11,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105837439] [2020-09-21 10:32:11,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:32:11,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:32:11,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:11,007 INFO L87 Difference]: Start difference. First operand 5553 states and 7958 transitions. Second operand 4 states. [2020-09-21 10:32:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:13,492 INFO L93 Difference]: Finished difference Result 13301 states and 19028 transitions. [2020-09-21 10:32:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:32:13,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2020-09-21 10:32:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:13,512 INFO L225 Difference]: With dead ends: 13301 [2020-09-21 10:32:13,512 INFO L226 Difference]: Without dead ends: 10998 [2020-09-21 10:32:13,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10998 states. [2020-09-21 10:32:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10998 to 5561. [2020-09-21 10:32:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2020-09-21 10:32:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7966 transitions. [2020-09-21 10:32:13,835 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7966 transitions. Word has length 144 [2020-09-21 10:32:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:13,835 INFO L479 AbstractCegarLoop]: Abstraction has 5561 states and 7966 transitions. [2020-09-21 10:32:13,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:32:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7966 transitions. [2020-09-21 10:32:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-09-21 10:32:13,843 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:13,843 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] [2020-09-21 10:32:13,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:32:13,843 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:13,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1519114445, now seen corresponding path program 1 times [2020-09-21 10:32:13,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:13,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1971095500] [2020-09-21 10:32:13,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:14,279 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-09-21 10:32:14,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:14,334 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:14,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1971095500] [2020-09-21 10:32:14,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:14,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:14,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831444235] [2020-09-21 10:32:14,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:14,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:14,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:14,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:14,336 INFO L87 Difference]: Start difference. First operand 5561 states and 7966 transitions. Second operand 5 states. [2020-09-21 10:32:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:17,912 INFO L93 Difference]: Finished difference Result 16216 states and 23165 transitions. [2020-09-21 10:32:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:17,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2020-09-21 10:32:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:17,936 INFO L225 Difference]: With dead ends: 16216 [2020-09-21 10:32:17,936 INFO L226 Difference]: Without dead ends: 10702 [2020-09-21 10:32:17,946 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:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10702 states. [2020-09-21 10:32:18,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10702 to 10682. [2020-09-21 10:32:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10682 states. [2020-09-21 10:32:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10682 states to 10682 states and 15106 transitions. [2020-09-21 10:32:18,575 INFO L78 Accepts]: Start accepts. Automaton has 10682 states and 15106 transitions. Word has length 145 [2020-09-21 10:32:18,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:18,576 INFO L479 AbstractCegarLoop]: Abstraction has 10682 states and 15106 transitions. [2020-09-21 10:32:18,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:32:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 10682 states and 15106 transitions. [2020-09-21 10:32:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-09-21 10:32:18,587 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:18,588 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] [2020-09-21 10:32:18,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:32:18,588 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:18,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:18,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1320083815, now seen corresponding path program 1 times [2020-09-21 10:32:18,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:18,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1267931239] [2020-09-21 10:32:18,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:32:18,676 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:32:18,677 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:32:18,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:32:18,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:32:18 BoogieIcfgContainer [2020-09-21 10:32:18,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:32:18,737 INFO L168 Benchmark]: Toolchain (without parser) took 44192.19 ms. Allocated memory was 138.4 MB in the beginning and 880.8 MB in the end (delta: 742.4 MB). Free memory was 99.3 MB in the beginning and 529.4 MB in the end (delta: -430.1 MB). Peak memory consumption was 312.3 MB. Max. memory is 7.1 GB. [2020-09-21 10:32:18,738 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 10:32:18,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1358.67 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 98.7 MB in the beginning and 164.4 MB in the end (delta: -65.7 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:32:18,740 INFO L168 Benchmark]: Boogie Preprocessor took 113.05 ms. Allocated memory is still 203.4 MB. Free memory was 164.4 MB in the beginning and 159.3 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2020-09-21 10:32:18,741 INFO L168 Benchmark]: RCFGBuilder took 1618.72 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 159.3 MB in the beginning and 113.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2020-09-21 10:32:18,741 INFO L168 Benchmark]: TraceAbstraction took 41092.30 ms. Allocated memory was 234.9 MB in the beginning and 880.8 MB in the end (delta: 645.9 MB). Free memory was 113.1 MB in the beginning and 529.4 MB in the end (delta: -416.3 MB). Peak memory consumption was 229.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:32:18,744 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.28 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1358.67 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 98.7 MB in the beginning and 164.4 MB in the end (delta: -65.7 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.05 ms. Allocated memory is still 203.4 MB. Free memory was 164.4 MB in the beginning and 159.3 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1618.72 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 159.3 MB in the beginning and 113.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41092.30 ms. Allocated memory was 234.9 MB in the beginning and 880.8 MB in the end (delta: 645.9 MB). Free memory was 113.1 MB in the beginning and 529.4 MB in the end (delta: -416.3 MB). Peak memory consumption was 229.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 814]: 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] char id2 = '\x0'; [L48] unsigned char r2 = '\x0'; [L49] char st2 = '\x0'; [L50] char nl2 = '\x0'; [L51] char m2 = '\x0'; [L52] char max2 = '\x0'; [L53] _Bool mode2 = 0; [L54] char id3 = '\x0'; [L55] unsigned char r3 = '\x0'; [L56] char st3 = '\x0'; [L57] char nl3 = '\x0'; [L58] char m3 = '\x0'; [L59] char max3 = '\x0'; [L60] _Bool mode3 = 0; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L68] int __return_1718; [L69] int __return_1846; [L70] int __return_1964; [L71] int __return_2082; [L72] int __return_2816; [L73] int __return_2785; [L74] int __return_2726; [L75] int __return_2692; [L76] int __return_2315; [L77] int __return_2587; [L78] int __return_2553; [L79] int __return_2473; [L80] int __return_2205; [L83] int main__c1; [L84] int main__i2; [L85] main__c1 = 0 [L86] ep12 = __VERIFIER_nondet_bool() [L87] ep13 = __VERIFIER_nondet_bool() [L88] ep21 = __VERIFIER_nondet_bool() [L89] ep23 = __VERIFIER_nondet_bool() [L90] ep31 = __VERIFIER_nondet_bool() [L91] ep32 = __VERIFIER_nondet_bool() [L92] id1 = __VERIFIER_nondet_char() [L93] r1 = __VERIFIER_nondet_uchar() [L94] st1 = __VERIFIER_nondet_char() [L95] nl1 = __VERIFIER_nondet_char() [L96] m1 = __VERIFIER_nondet_char() [L97] max1 = __VERIFIER_nondet_char() [L98] mode1 = __VERIFIER_nondet_bool() [L99] id2 = __VERIFIER_nondet_char() [L100] r2 = __VERIFIER_nondet_uchar() [L101] st2 = __VERIFIER_nondet_char() [L102] nl2 = __VERIFIER_nondet_char() [L103] m2 = __VERIFIER_nondet_char() [L104] max2 = __VERIFIER_nondet_char() [L105] mode2 = __VERIFIER_nondet_bool() [L106] id3 = __VERIFIER_nondet_char() [L107] r3 = __VERIFIER_nondet_uchar() [L108] st3 = __VERIFIER_nondet_char() [L109] nl3 = __VERIFIER_nondet_char() [L110] m3 = __VERIFIER_nondet_char() [L111] max3 = __VERIFIER_nondet_char() [L112] mode3 = __VERIFIER_nondet_bool() [L114] _Bool init__r121; [L115] _Bool init__r131; [L116] _Bool init__r211; [L117] _Bool init__r231; [L118] _Bool init__r311; [L119] _Bool init__r321; [L120] _Bool init__r122; [L121] int init__tmp; [L122] _Bool init__r132; [L123] int init__tmp___0; [L124] _Bool init__r212; [L125] int init__tmp___1; [L126] _Bool init__r232; [L127] int init__tmp___2; [L128] _Bool init__r312; [L129] int init__tmp___3; [L130] _Bool init__r322; [L131] int init__tmp___4; [L132] int init__tmp___5; [L133] init__r121 = ep12 [L134] init__r131 = ep13 [L135] init__r211 = ep21 [L136] init__r231 = ep23 [L137] init__r311 = ep31 [L138] init__r321 = ep32 [L139] COND FALSE !(!(init__r121 == 0)) [L2956] COND FALSE !(!(init__r131 == 0)) [L2972] init__tmp = 0 [L143] init__r122 = (_Bool)init__tmp [L144] COND FALSE !(!(init__r131 == 0)) [L2933] COND FALSE !(!(init__r121 == 0)) [L2949] init__tmp___0 = 0 [L148] init__r132 = (_Bool)init__tmp___0 [L149] COND FALSE !(!(init__r211 == 0)) [L2910] COND FALSE !(!(init__r231 == 0)) [L2926] init__tmp___1 = 0 [L153] init__r212 = (_Bool)init__tmp___1 [L154] COND FALSE !(!(init__r231 == 0)) [L2887] COND FALSE !(!(init__r211 == 0)) [L2903] init__tmp___2 = 0 [L158] init__r232 = (_Bool)init__tmp___2 [L159] COND FALSE !(!(init__r311 == 0)) [L2864] COND FALSE !(!(init__r321 == 0)) [L2880] init__tmp___3 = 0 [L163] init__r312 = (_Bool)init__tmp___3 [L164] COND FALSE !(!(init__r321 == 0)) [L2841] COND FALSE !(!(init__r311 == 0)) [L2857] init__tmp___4 = 0 [L168] init__r322 = (_Bool)init__tmp___4 [L169] COND TRUE ((int)id1) != ((int)id2) [L171] COND TRUE ((int)id1) != ((int)id3) [L173] COND TRUE ((int)id2) != ((int)id3) [L175] COND TRUE ((int)id1) >= 0 [L177] COND TRUE ((int)id2) >= 0 [L179] COND TRUE ((int)id3) >= 0 [L181] COND TRUE ((int)r1) == 0 [L183] COND TRUE ((int)r2) == 0 [L185] COND TRUE ((int)r3) == 0 [L187] COND TRUE ((int)max1) == ((int)id1) [L189] COND TRUE ((int)max2) == ((int)id2) [L191] COND TRUE ((int)max3) == ((int)id3) [L193] COND TRUE ((int)st1) == 0 [L195] COND TRUE ((int)st2) == 0 [L197] COND TRUE ((int)st3) == 0 [L199] COND TRUE ((int)nl1) == 0 [L201] COND TRUE ((int)nl2) == 0 [L203] COND TRUE ((int)nl3) == 0 [L205] COND TRUE ((int)mode1) == 0 [L207] COND TRUE ((int)mode2) == 0 [L209] COND TRUE ((int)mode3) == 0 [L211] init__tmp___5 = 1 [L212] __return_1718 = init__tmp___5 [L213] main__i2 = __return_1718 [L214] COND TRUE main__i2 != 0 [L216] p12_old = nomsg [L217] p12_new = nomsg [L218] p13_old = nomsg [L219] p13_new = nomsg [L220] p21_old = nomsg [L221] p21_new = nomsg [L222] p23_old = nomsg [L223] p23_new = nomsg [L224] p31_old = nomsg [L225] p31_new = nomsg [L226] p32_old = nomsg [L227] p32_new = nomsg [L228] main__i2 = 0 [L230] COND FALSE !(!(mode1 == 0)) [L236] COND TRUE ((int)r1) < 2 [L238] COND FALSE !(!(ep12 == 0)) [L249] COND FALSE !(!(ep13 == 0)) [L260] mode1 = 1 [L262] COND FALSE !(!(mode2 == 0)) [L268] COND TRUE ((int)r2) < 2 [L270] COND FALSE !(!(ep21 == 0)) [L281] COND FALSE !(!(ep23 == 0)) [L292] mode2 = 1 [L294] COND FALSE !(!(mode3 == 0)) [L300] COND TRUE ((int)r3) < 2 [L302] COND FALSE !(!(ep31 == 0)) [L313] COND FALSE !(!(ep32 == 0)) [L324] mode3 = 1 [L325] p12_old = p12_new [L326] p12_new = nomsg [L327] p13_old = p13_new [L328] p13_new = nomsg [L329] p21_old = p21_new [L330] p21_new = nomsg [L331] p23_old = p23_new [L332] p23_new = nomsg [L333] p31_old = p31_new [L334] p31_new = nomsg [L335] p32_old = p32_new [L336] p32_new = nomsg [L338] int check__tmp; [L339] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 [L341] COND TRUE (((int)st1) + ((int)nl1)) <= 1 [L343] COND TRUE (((int)st2) + ((int)nl2)) <= 1 [L345] COND TRUE (((int)st3) + ((int)nl3)) <= 1 [L347] COND FALSE !(((int)r1) >= 2) [L353] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 [L355] COND TRUE ((int)r1) < 2 [L357] COND FALSE !(((int)r1) >= 2) [L363] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 [L365] COND TRUE ((int)r1) < 2 [L367] check__tmp = 1 [L368] __return_1846 = check__tmp [L369] main__c1 = __return_1846 [L371] _Bool __tmp_1; [L372] __tmp_1 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_1 [L375] COND FALSE !(assert__arg == 0) [L382] COND TRUE !(mode1 == 0) [L384] COND FALSE !(r1 == 255) [L390] r1 = r1 + 1 [L391] COND FALSE !(!(ep21 == 0)) [L399] COND FALSE !(!(ep31 == 0)) [L407] COND FALSE !(((int)r1) == 2) [L413] mode1 = 0 [L415] COND TRUE !(mode2 == 0) [L417] COND FALSE !(r2 == 255) [L423] r2 = r2 + 1 [L424] COND FALSE !(!(ep12 == 0)) [L432] COND FALSE !(!(ep32 == 0)) [L440] COND FALSE !(((int)r2) == 2) [L446] mode2 = 0 [L448] COND TRUE !(mode3 == 0) [L450] COND FALSE !(r3 == 255) [L456] r3 = r3 + 1 [L457] COND FALSE !(!(ep13 == 0)) [L465] COND FALSE !(!(ep23 == 0)) [L473] COND FALSE !(((int)r3) == 2) [L479] mode3 = 0 [L480] p12_old = p12_new [L481] p12_new = nomsg [L482] p13_old = p13_new [L483] p13_new = nomsg [L484] p21_old = p21_new [L485] p21_new = nomsg [L486] p23_old = p23_new [L487] p23_new = nomsg [L488] p31_old = p31_new [L489] p31_new = nomsg [L490] p32_old = p32_new [L491] p32_new = nomsg [L493] int check__tmp; [L494] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 [L496] COND TRUE (((int)st1) + ((int)nl1)) <= 1 [L498] COND TRUE (((int)st2) + ((int)nl2)) <= 1 [L500] COND TRUE (((int)st3) + ((int)nl3)) <= 1 [L502] COND FALSE !(((int)r1) >= 2) [L508] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 [L510] COND TRUE ((int)r1) < 2 [L512] COND FALSE !(((int)r1) >= 2) [L518] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 [L520] COND TRUE ((int)r1) < 2 [L522] check__tmp = 1 [L523] __return_1964 = check__tmp [L524] main__c1 = __return_1964 [L526] _Bool __tmp_2; [L527] __tmp_2 = main__c1 [L528] _Bool assert__arg; [L529] assert__arg = __tmp_2 [L530] COND FALSE !(assert__arg == 0) [L537] COND FALSE !(!(mode1 == 0)) [L543] COND TRUE ((int)r1) < 2 [L545] COND FALSE !(!(ep12 == 0)) [L556] COND FALSE !(!(ep13 == 0)) [L567] mode1 = 1 [L569] COND FALSE !(!(mode2 == 0)) [L575] COND TRUE ((int)r2) < 2 [L577] COND FALSE !(!(ep21 == 0)) [L588] COND FALSE !(!(ep23 == 0)) [L599] mode2 = 1 [L601] COND FALSE !(!(mode3 == 0)) [L607] COND TRUE ((int)r3) < 2 [L609] COND FALSE !(!(ep31 == 0)) [L620] COND FALSE !(!(ep32 == 0)) [L631] mode3 = 1 [L632] p12_old = p12_new [L633] p12_new = nomsg [L634] p13_old = p13_new [L635] p13_new = nomsg [L636] p21_old = p21_new [L637] p21_new = nomsg [L638] p23_old = p23_new [L639] p23_new = nomsg [L640] p31_old = p31_new [L641] p31_new = nomsg [L642] p32_old = p32_new [L643] p32_new = nomsg [L645] int check__tmp; [L646] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 [L648] COND TRUE (((int)st1) + ((int)nl1)) <= 1 [L650] COND TRUE (((int)st2) + ((int)nl2)) <= 1 [L652] COND TRUE (((int)st3) + ((int)nl3)) <= 1 [L654] COND FALSE !(((int)r1) >= 2) [L660] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 [L662] COND TRUE ((int)r1) < 2 [L664] COND FALSE !(((int)r1) >= 2) [L670] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 [L672] COND TRUE ((int)r1) < 2 [L674] check__tmp = 1 [L675] __return_2082 = check__tmp [L676] main__c1 = __return_2082 [L678] _Bool __tmp_3; [L679] __tmp_3 = main__c1 [L680] _Bool assert__arg; [L681] assert__arg = __tmp_3 [L682] COND FALSE !(assert__arg == 0) [L689] COND TRUE !(mode1 == 0) [L691] COND FALSE !(r1 == 255) [L697] r1 = r1 + 1 [L698] COND FALSE !(!(ep21 == 0)) [L706] COND FALSE !(!(ep31 == 0)) [L714] COND TRUE ((int)r1) == 2 [L716] COND TRUE ((int)max1) == ((int)id1) [L718] st1 = 1 [L719] mode1 = 0 [L721] COND TRUE !(mode2 == 0) [L723] COND FALSE !(r2 == 255) [L729] r2 = r2 + 1 [L730] COND FALSE !(!(ep12 == 0)) [L738] COND FALSE !(!(ep32 == 0)) [L746] COND TRUE ((int)r2) == 2 [L748] COND TRUE ((int)max2) == ((int)id2) [L750] st2 = 1 [L751] mode2 = 0 [L753] COND TRUE !(mode3 == 0) [L755] COND FALSE !(r3 == 255) [L761] r3 = r3 + 1 [L762] COND FALSE !(!(ep13 == 0)) [L770] COND FALSE !(!(ep23 == 0)) [L778] COND TRUE ((int)r3) == 2 [L780] COND TRUE ((int)max3) == ((int)id3) [L782] st3 = 1 [L783] mode3 = 0 [L784] p12_old = p12_new [L785] p12_new = nomsg [L786] p13_old = p13_new [L787] p13_new = nomsg [L788] p21_old = p21_new [L789] p21_new = nomsg [L790] p23_old = p23_new [L791] p23_new = nomsg [L792] p31_old = p31_new [L793] p31_new = nomsg [L794] p32_old = p32_new [L795] p32_new = nomsg [L797] int check__tmp; [L798] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L804] check__tmp = 0 [L805] __return_2816 = check__tmp [L806] main__c1 = __return_2816 [L808] _Bool __tmp_4; [L809] __tmp_4 = main__c1 [L810] _Bool assert__arg; [L811] assert__arg = __tmp_4 [L812] COND TRUE assert__arg == 0 [L814] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 391 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 40.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 31.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8969 SDtfs, 8666 SDslu, 5494 SDs, 0 SdLazy, 9500 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10682occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 10677 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1703 NumberOfCodeBlocks, 1703 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1547 ConstructedInterpolants, 0 QuantifiedInterpolants, 792329 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...