/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:32:15,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:32:15,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:32:15,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:32:15,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:32:15,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:32:15,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:32:15,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:32:15,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:32:15,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:32:15,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:32:15,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:32:15,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:32:15,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:32:15,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:32:15,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:32:15,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:32:15,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:32:15,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:32:15,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:32:15,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:32:15,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:32:15,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:32:15,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:32:15,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:32:15,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:32:15,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:32:15,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:32:15,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:32:15,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:32:15,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:32:15,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:32:15,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:32:15,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:32:15,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:32:15,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:32:15,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:32:15,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:32:15,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:32:15,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:32:15,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:32:15,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 10:32:15,891 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:32:15,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:32:15,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:32:15,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:32:15,895 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:32:15,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:32:15,895 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:32:15,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:32:15,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:32:15,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:32:15,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:32:15,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:32:15,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:32:15,896 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:32:15,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:32:15,897 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:32:15,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:32:15,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:32:15,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:32:15,898 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:32:15,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:32:15,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:32:15,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:32:15,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:32:15,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:32:15,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:32:15,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:32:15,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:32:15,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:32:15,900 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-21 10:32:16,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:32:16,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:32:16,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:32:16,352 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:32:16,352 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:32:16,354 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2020-09-21 10:32:16,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/00a700486/d5bf24527c4b4e2584f89eabc6a7df4a/FLAGc97323862 [2020-09-21 10:32:17,057 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:32:17,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2020-09-21 10:32:17,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/00a700486/d5bf24527c4b4e2584f89eabc6a7df4a/FLAGc97323862 [2020-09-21 10:32:17,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/00a700486/d5bf24527c4b4e2584f89eabc6a7df4a [2020-09-21 10:32:17,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:32:17,404 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:32:17,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:32:17,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:32:17,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:32:17,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:32:17" (1/1) ... [2020-09-21 10:32:17,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee4d01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:17, skipping insertion in model container [2020-09-21 10:32:17,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:32:17" (1/1) ... [2020-09-21 10:32:17,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:32:17,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:32:18,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:32:18,065 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:32:18,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:32:18,261 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:32:18,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:18 WrapperNode [2020-09-21 10:32:18,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:32:18,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:32:18,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:32:18,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:32:18,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:18" (1/1) ... [2020-09-21 10:32:18,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:18" (1/1) ... [2020-09-21 10:32:18,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:18" (1/1) ... [2020-09-21 10:32:18,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:18" (1/1) ... [2020-09-21 10:32:18,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:18" (1/1) ... [2020-09-21 10:32:18,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:18" (1/1) ... [2020-09-21 10:32:18,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:18" (1/1) ... [2020-09-21 10:32:18,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:32:18,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:32:18,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:32:18,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:32:18,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:18" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:32:18,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:32:18,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:32:18,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-21 10:32:18,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:32:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:32:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-21 10:32:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-09-21 10:32:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2020-09-21 10:32:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-21 10:32:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-21 10:32:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure read [2020-09-21 10:32:18,471 INFO L130 BoogieDeclarations]: Found specification of procedure write [2020-09-21 10:32:18,471 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2020-09-21 10:32:18,471 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2020-09-21 10:32:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2020-09-21 10:32:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-09-21 10:32:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-09-21 10:32:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:32:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:32:18,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:32:19,740 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:32:19,741 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:32:19,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:32:19 BoogieIcfgContainer [2020-09-21 10:32:19,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:32:19,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:32:19,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:32:19,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:32:19,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:32:17" (1/3) ... [2020-09-21 10:32:19,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db2a6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:32:19, skipping insertion in model container [2020-09-21 10:32:19,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:32:18" (2/3) ... [2020-09-21 10:32:19,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db2a6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:32:19, skipping insertion in model container [2020-09-21 10:32:19,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:32:19" (3/3) ... [2020-09-21 10:32:19,757 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2020-09-21 10:32:19,768 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:32:19,778 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:32:19,800 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:32:19,832 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:32:19,832 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:32:19,833 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:32:19,833 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:32:19,833 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:32:19,833 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:32:19,833 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:32:19,833 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:32:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states. [2020-09-21 10:32:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-09-21 10:32:19,880 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:19,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:19,882 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:19,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:19,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1777408137, now seen corresponding path program 1 times [2020-09-21 10:32:19,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:19,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [679837302] [2020-09-21 10:32:19,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:20,941 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-09-21 10:32:20,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:21,007 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:21,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [679837302] [2020-09-21 10:32:21,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:21,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:32:21,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893996193] [2020-09-21 10:32:21,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:32:21,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:21,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:32:21,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:21,040 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 4 states. [2020-09-21 10:32:21,462 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2020-09-21 10:32:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:23,270 INFO L93 Difference]: Finished difference Result 649 states and 1122 transitions. [2020-09-21 10:32:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:23,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2020-09-21 10:32:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:23,296 INFO L225 Difference]: With dead ends: 649 [2020-09-21 10:32:23,297 INFO L226 Difference]: Without dead ends: 534 [2020-09-21 10:32:23,302 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:32:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-09-21 10:32:23,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 532. [2020-09-21 10:32:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2020-09-21 10:32:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 797 transitions. [2020-09-21 10:32:23,445 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 797 transitions. Word has length 151 [2020-09-21 10:32:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:23,446 INFO L479 AbstractCegarLoop]: Abstraction has 532 states and 797 transitions. [2020-09-21 10:32:23,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:32:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 797 transitions. [2020-09-21 10:32:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-09-21 10:32:23,451 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:23,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:23,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:32:23,452 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:23,453 INFO L82 PathProgramCache]: Analyzing trace with hash 623105739, now seen corresponding path program 1 times [2020-09-21 10:32:23,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:23,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207957864] [2020-09-21 10:32:23,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:24,000 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-09-21 10:32:24,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:24,062 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:24,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207957864] [2020-09-21 10:32:24,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:24,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:24,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656359943] [2020-09-21 10:32:24,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:24,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:24,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:24,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:24,067 INFO L87 Difference]: Start difference. First operand 532 states and 797 transitions. Second operand 5 states. [2020-09-21 10:32:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:26,714 INFO L93 Difference]: Finished difference Result 1543 states and 2308 transitions. [2020-09-21 10:32:26,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:26,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2020-09-21 10:32:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:26,723 INFO L225 Difference]: With dead ends: 1543 [2020-09-21 10:32:26,723 INFO L226 Difference]: Without dead ends: 1024 [2020-09-21 10:32:26,728 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:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2020-09-21 10:32:26,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1022. [2020-09-21 10:32:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2020-09-21 10:32:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1517 transitions. [2020-09-21 10:32:26,793 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1517 transitions. Word has length 151 [2020-09-21 10:32:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:26,794 INFO L479 AbstractCegarLoop]: Abstraction has 1022 states and 1517 transitions. [2020-09-21 10:32:26,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:32:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1517 transitions. [2020-09-21 10:32:26,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-09-21 10:32:26,805 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:26,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:26,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:32:26,807 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:26,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:26,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1496630273, now seen corresponding path program 1 times [2020-09-21 10:32:26,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:26,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1689802401] [2020-09-21 10:32:26,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:27,224 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-09-21 10:32:27,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:27,300 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:27,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1689802401] [2020-09-21 10:32:27,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:27,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:32:27,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276155650] [2020-09-21 10:32:27,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:32:27,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:32:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:27,314 INFO L87 Difference]: Start difference. First operand 1022 states and 1517 transitions. Second operand 4 states. [2020-09-21 10:32:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:29,307 INFO L93 Difference]: Finished difference Result 3020 states and 4481 transitions. [2020-09-21 10:32:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:32:29,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2020-09-21 10:32:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:29,319 INFO L225 Difference]: With dead ends: 3020 [2020-09-21 10:32:29,319 INFO L226 Difference]: Without dead ends: 2030 [2020-09-21 10:32:29,323 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:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2020-09-21 10:32:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 1024. [2020-09-21 10:32:29,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2020-09-21 10:32:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1519 transitions. [2020-09-21 10:32:29,395 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1519 transitions. Word has length 152 [2020-09-21 10:32:29,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:29,395 INFO L479 AbstractCegarLoop]: Abstraction has 1024 states and 1519 transitions. [2020-09-21 10:32:29,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:32:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1519 transitions. [2020-09-21 10:32:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-21 10:32:29,399 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:29,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:29,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:32:29,399 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:29,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:29,400 INFO L82 PathProgramCache]: Analyzing trace with hash -263532694, now seen corresponding path program 1 times [2020-09-21 10:32:29,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:29,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1184780242] [2020-09-21 10:32:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:29,976 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-09-21 10:32:29,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:30,064 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:30,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1184780242] [2020-09-21 10:32:30,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:30,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:30,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237309469] [2020-09-21 10:32:30,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:30,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:30,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:30,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:30,068 INFO L87 Difference]: Start difference. First operand 1024 states and 1519 transitions. Second operand 5 states. [2020-09-21 10:32:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:32,885 INFO L93 Difference]: Finished difference Result 2950 states and 4361 transitions. [2020-09-21 10:32:32,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:32,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2020-09-21 10:32:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:32,899 INFO L225 Difference]: With dead ends: 2950 [2020-09-21 10:32:32,899 INFO L226 Difference]: Without dead ends: 1960 [2020-09-21 10:32:32,901 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:32,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2020-09-21 10:32:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1958. [2020-09-21 10:32:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1958 states. [2020-09-21 10:32:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2870 transitions. [2020-09-21 10:32:33,019 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2870 transitions. Word has length 153 [2020-09-21 10:32:33,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:33,020 INFO L479 AbstractCegarLoop]: Abstraction has 1958 states and 2870 transitions. [2020-09-21 10:32:33,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:32:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2870 transitions. [2020-09-21 10:32:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-09-21 10:32:33,027 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:33,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:33,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:32:33,029 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:33,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:33,030 INFO L82 PathProgramCache]: Analyzing trace with hash -919312578, now seen corresponding path program 1 times [2020-09-21 10:32:33,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:33,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1859626775] [2020-09-21 10:32:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:33,454 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-09-21 10:32:33,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:33,521 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:33,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1859626775] [2020-09-21 10:32:33,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:33,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:32:33,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123060552] [2020-09-21 10:32:33,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:32:33,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:33,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:32:33,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:33,525 INFO L87 Difference]: Start difference. First operand 1958 states and 2870 transitions. Second operand 4 states. [2020-09-21 10:32:36,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:36,297 INFO L93 Difference]: Finished difference Result 5790 states and 8482 transitions. [2020-09-21 10:32:36,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:32:36,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2020-09-21 10:32:36,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:36,315 INFO L225 Difference]: With dead ends: 5790 [2020-09-21 10:32:36,316 INFO L226 Difference]: Without dead ends: 3880 [2020-09-21 10:32:36,320 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:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3880 states. [2020-09-21 10:32:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3880 to 1962. [2020-09-21 10:32:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-09-21 10:32:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2874 transitions. [2020-09-21 10:32:36,451 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2874 transitions. Word has length 154 [2020-09-21 10:32:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:36,453 INFO L479 AbstractCegarLoop]: Abstraction has 1962 states and 2874 transitions. [2020-09-21 10:32:36,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:32:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2874 transitions. [2020-09-21 10:32:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-09-21 10:32:36,459 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:36,459 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:36,460 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:32:36,460 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:36,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:36,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1585428376, now seen corresponding path program 1 times [2020-09-21 10:32:36,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:36,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [748835090] [2020-09-21 10:32:36,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:36,922 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-09-21 10:32:36,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:36,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [748835090] [2020-09-21 10:32:36,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:36,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:32:36,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555310374] [2020-09-21 10:32:36,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:32:36,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:36,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:32:36,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:36,975 INFO L87 Difference]: Start difference. First operand 1962 states and 2874 transitions. Second operand 4 states. [2020-09-21 10:32:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:39,654 INFO L93 Difference]: Finished difference Result 5414 states and 7950 transitions. [2020-09-21 10:32:39,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:32:39,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2020-09-21 10:32:39,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:39,672 INFO L225 Difference]: With dead ends: 5414 [2020-09-21 10:32:39,673 INFO L226 Difference]: Without dead ends: 3768 [2020-09-21 10:32:39,676 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2020-09-21 10:32:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3766. [2020-09-21 10:32:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3766 states. [2020-09-21 10:32:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 5456 transitions. [2020-09-21 10:32:39,850 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 5456 transitions. Word has length 155 [2020-09-21 10:32:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:39,850 INFO L479 AbstractCegarLoop]: Abstraction has 3766 states and 5456 transitions. [2020-09-21 10:32:39,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:32:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 5456 transitions. [2020-09-21 10:32:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-09-21 10:32:39,857 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:39,857 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:39,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:32:39,858 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:39,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:39,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1351457563, now seen corresponding path program 1 times [2020-09-21 10:32:39,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:39,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [187722492] [2020-09-21 10:32:39,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:40,293 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-09-21 10:32:40,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:40,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [187722492] [2020-09-21 10:32:40,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:40,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:40,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595151026] [2020-09-21 10:32:40,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:40,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:40,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:40,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:40,368 INFO L87 Difference]: Start difference. First operand 3766 states and 5456 transitions. Second operand 5 states. [2020-09-21 10:32:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:42,360 INFO L93 Difference]: Finished difference Result 7914 states and 11362 transitions. [2020-09-21 10:32:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:42,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2020-09-21 10:32:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:42,378 INFO L225 Difference]: With dead ends: 7914 [2020-09-21 10:32:42,378 INFO L226 Difference]: Without dead ends: 4004 [2020-09-21 10:32:42,386 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:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4004 states. [2020-09-21 10:32:42,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4004 to 4002. [2020-09-21 10:32:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4002 states. [2020-09-21 10:32:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4002 states to 4002 states and 5698 transitions. [2020-09-21 10:32:42,588 INFO L78 Accepts]: Start accepts. Automaton has 4002 states and 5698 transitions. Word has length 155 [2020-09-21 10:32:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:42,589 INFO L479 AbstractCegarLoop]: Abstraction has 4002 states and 5698 transitions. [2020-09-21 10:32:42,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:32:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4002 states and 5698 transitions. [2020-09-21 10:32:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-09-21 10:32:42,598 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:42,599 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:42,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:32:42,599 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:42,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:42,599 INFO L82 PathProgramCache]: Analyzing trace with hash 557114249, now seen corresponding path program 1 times [2020-09-21 10:32:42,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:42,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [128206358] [2020-09-21 10:32:42,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:43,075 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-09-21 10:32:43,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:43,129 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [128206358] [2020-09-21 10:32:43,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:43,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:43,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825317621] [2020-09-21 10:32:43,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:43,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:43,132 INFO L87 Difference]: Start difference. First operand 4002 states and 5698 transitions. Second operand 5 states. [2020-09-21 10:32:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:45,931 INFO L93 Difference]: Finished difference Result 5770 states and 8216 transitions. [2020-09-21 10:32:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:45,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2020-09-21 10:32:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:45,948 INFO L225 Difference]: With dead ends: 5770 [2020-09-21 10:32:45,948 INFO L226 Difference]: Without dead ends: 4004 [2020-09-21 10:32:45,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:32:45,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4004 states. [2020-09-21 10:32:46,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4004 to 3766. [2020-09-21 10:32:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3766 states. [2020-09-21 10:32:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 5400 transitions. [2020-09-21 10:32:46,120 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 5400 transitions. Word has length 155 [2020-09-21 10:32:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:46,120 INFO L479 AbstractCegarLoop]: Abstraction has 3766 states and 5400 transitions. [2020-09-21 10:32:46,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:32:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 5400 transitions. [2020-09-21 10:32:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-09-21 10:32:46,127 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:46,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:46,128 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:32:46,128 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:46,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1983484075, now seen corresponding path program 1 times [2020-09-21 10:32:46,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:46,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [137690873] [2020-09-21 10:32:46,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:46,441 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-09-21 10:32:46,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:32:46,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [137690873] [2020-09-21 10:32:46,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:46,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:32:46,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224893865] [2020-09-21 10:32:46,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:32:46,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:46,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:32:46,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:32:46,493 INFO L87 Difference]: Start difference. First operand 3766 states and 5400 transitions. Second operand 4 states. [2020-09-21 10:32:48,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:48,689 INFO L93 Difference]: Finished difference Result 9190 states and 13162 transitions. [2020-09-21 10:32:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:32:48,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2020-09-21 10:32:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:48,720 INFO L225 Difference]: With dead ends: 9190 [2020-09-21 10:32:48,721 INFO L226 Difference]: Without dead ends: 7424 [2020-09-21 10:32:48,726 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:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7424 states. [2020-09-21 10:32:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7424 to 3774. [2020-09-21 10:32:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3774 states. [2020-09-21 10:32:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 5408 transitions. [2020-09-21 10:32:48,916 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 5408 transitions. Word has length 156 [2020-09-21 10:32:48,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:48,917 INFO L479 AbstractCegarLoop]: Abstraction has 3774 states and 5408 transitions. [2020-09-21 10:32:48,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:32:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 5408 transitions. [2020-09-21 10:32:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-09-21 10:32:48,922 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:48,923 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:48,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:32:48,923 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:48,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:48,924 INFO L82 PathProgramCache]: Analyzing trace with hash -415240646, now seen corresponding path program 1 times [2020-09-21 10:32:48,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:48,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1484144196] [2020-09-21 10:32:48,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:49,323 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-09-21 10:32:49,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:32:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:32:49,376 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:49,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1484144196] [2020-09-21 10:32:49,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:32:49,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:32:49,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517046849] [2020-09-21 10:32:49,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:32:49,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:32:49,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:32:49,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:32:49,379 INFO L87 Difference]: Start difference. First operand 3774 states and 5408 transitions. Second operand 5 states. [2020-09-21 10:32:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:32:52,035 INFO L93 Difference]: Finished difference Result 10940 states and 15613 transitions. [2020-09-21 10:32:52,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:32:52,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2020-09-21 10:32:52,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:32:52,052 INFO L225 Difference]: With dead ends: 10940 [2020-09-21 10:32:52,053 INFO L226 Difference]: Without dead ends: 7213 [2020-09-21 10:32:52,061 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:32:52,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7213 states. [2020-09-21 10:32:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7213 to 7211. [2020-09-21 10:32:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7211 states. [2020-09-21 10:32:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7211 states to 7211 states and 10180 transitions. [2020-09-21 10:32:52,411 INFO L78 Accepts]: Start accepts. Automaton has 7211 states and 10180 transitions. Word has length 157 [2020-09-21 10:32:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:32:52,412 INFO L479 AbstractCegarLoop]: Abstraction has 7211 states and 10180 transitions. [2020-09-21 10:32:52,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:32:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 7211 states and 10180 transitions. [2020-09-21 10:32:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-09-21 10:32:52,421 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:32:52,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:32:52,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:32:52,421 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:32:52,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:32:52,422 INFO L82 PathProgramCache]: Analyzing trace with hash 725013288, now seen corresponding path program 1 times [2020-09-21 10:32:52,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:32:52,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1045349323] [2020-09-21 10:32:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:32:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:32:52,525 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:32:52,526 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:32:52,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:32:52,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:32:52 BoogieIcfgContainer [2020-09-21 10:32:52,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:32:52,590 INFO L168 Benchmark]: Toolchain (without parser) took 35188.98 ms. Allocated memory was 141.6 MB in the beginning and 738.7 MB in the end (delta: 597.2 MB). Free memory was 103.1 MB in the beginning and 514.7 MB in the end (delta: -411.6 MB). Peak memory consumption was 185.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:32:52,591 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 10:32:52,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 856.59 ms. Allocated memory was 141.6 MB in the beginning and 205.5 MB in the end (delta: 64.0 MB). Free memory was 102.5 MB in the beginning and 168.8 MB in the end (delta: -66.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:32:52,593 INFO L168 Benchmark]: Boogie Preprocessor took 96.57 ms. Allocated memory is still 205.5 MB. Free memory was 168.8 MB in the beginning and 164.8 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-09-21 10:32:52,593 INFO L168 Benchmark]: RCFGBuilder took 1388.99 ms. Allocated memory was 205.5 MB in the beginning and 235.4 MB in the end (delta: 29.9 MB). Free memory was 164.8 MB in the beginning and 139.0 MB in the end (delta: 25.8 MB). Peak memory consumption was 76.5 MB. Max. memory is 7.1 GB. [2020-09-21 10:32:52,594 INFO L168 Benchmark]: TraceAbstraction took 32839.23 ms. Allocated memory was 235.4 MB in the beginning and 738.7 MB in the end (delta: 503.3 MB). Free memory was 139.0 MB in the beginning and 514.7 MB in the end (delta: -375.7 MB). Peak memory consumption was 127.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:32:52,597 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.19 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 856.59 ms. Allocated memory was 141.6 MB in the beginning and 205.5 MB in the end (delta: 64.0 MB). Free memory was 102.5 MB in the beginning and 168.8 MB in the end (delta: -66.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.57 ms. Allocated memory is still 205.5 MB. Free memory was 168.8 MB in the beginning and 164.8 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1388.99 ms. Allocated memory was 205.5 MB in the beginning and 235.4 MB in the end (delta: 29.9 MB). Free memory was 164.8 MB in the beginning and 139.0 MB in the end (delta: 25.8 MB). Peak memory consumption was 76.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32839.23 ms. Allocated memory was 235.4 MB in the beginning and 738.7 MB in the end (delta: 503.3 MB). Free memory was 139.0 MB in the beginning and 514.7 MB in the end (delta: -375.7 MB). Peak memory consumption was 127.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 891]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L14] msg_t nomsg = (msg_t )-1; [L15] port_t p12 = 0; [L16] char p12_old = '\x0'; [L17] char p12_new = '\x0'; [L18] _Bool ep12 = 0; [L19] port_t p13 = 0; [L20] char p13_old = '\x0'; [L21] char p13_new = '\x0'; [L22] _Bool ep13 = 0; [L23] port_t p21 = 0; [L24] char p21_old = '\x0'; [L25] char p21_new = '\x0'; [L26] _Bool ep21 = 0; [L27] port_t p23 = 0; [L28] char p23_old = '\x0'; [L29] char p23_new = '\x0'; [L30] _Bool ep23 = 0; [L31] port_t p31 = 0; [L32] char p31_old = '\x0'; [L33] char p31_new = '\x0'; [L34] _Bool ep31 = 0; [L35] port_t p32 = 0; [L36] char p32_old = '\x0'; [L37] char p32_new = '\x0'; [L38] _Bool ep32 = 0; [L39] char id1 = '\x0'; [L40] char r1 = '\x0'; [L41] char st1 = '\x0'; [L42] char nl1 = '\x0'; [L43] char m1 = '\x0'; [L44] char max1 = '\x0'; [L45] _Bool mode1 = 0; [L46] _Bool newmax1 = 0; [L47] char id2 = '\x0'; [L48] char r2 = '\x0'; [L49] char st2 = '\x0'; [L50] char nl2 = '\x0'; [L51] char m2 = '\x0'; [L52] char max2 = '\x0'; [L53] _Bool mode2 = 0; [L54] _Bool newmax2 = 0; [L55] char id3 = '\x0'; [L56] char r3 = '\x0'; [L57] char st3 = '\x0'; [L58] char nl3 = '\x0'; [L59] char m3 = '\x0'; [L60] char max3 = '\x0'; [L61] _Bool mode3 = 0; [L62] _Bool newmax3 = 0; [L66] void (*nodes[3])() = { &node1, &node2, &node3 }; [L70] int __return_1863; [L71] int __return_2009; [L72] int __return_2142; [L73] int __return_2281; [L74] int __return_2419; [L75] int __tmp_2420_0; [L76] int __return_2543; [L77] int __return_2433; [L80] int main__c1; [L81] int main__i2; [L82] main__c1 = 0 [L83] ep12 = __VERIFIER_nondet_bool() [L84] ep13 = __VERIFIER_nondet_bool() [L85] ep21 = __VERIFIER_nondet_bool() [L86] ep23 = __VERIFIER_nondet_bool() [L87] ep31 = __VERIFIER_nondet_bool() [L88] ep32 = __VERIFIER_nondet_bool() [L89] id1 = __VERIFIER_nondet_char() [L90] r1 = __VERIFIER_nondet_char() [L91] st1 = __VERIFIER_nondet_char() [L92] nl1 = __VERIFIER_nondet_char() [L93] m1 = __VERIFIER_nondet_char() [L94] max1 = __VERIFIER_nondet_char() [L95] mode1 = __VERIFIER_nondet_bool() [L96] newmax1 = __VERIFIER_nondet_bool() [L97] id2 = __VERIFIER_nondet_char() [L98] r2 = __VERIFIER_nondet_char() [L99] st2 = __VERIFIER_nondet_char() [L100] nl2 = __VERIFIER_nondet_char() [L101] m2 = __VERIFIER_nondet_char() [L102] max2 = __VERIFIER_nondet_char() [L103] mode2 = __VERIFIER_nondet_bool() [L104] newmax2 = __VERIFIER_nondet_bool() [L105] id3 = __VERIFIER_nondet_char() [L106] r3 = __VERIFIER_nondet_char() [L107] st3 = __VERIFIER_nondet_char() [L108] nl3 = __VERIFIER_nondet_char() [L109] m3 = __VERIFIER_nondet_char() [L110] max3 = __VERIFIER_nondet_char() [L111] mode3 = __VERIFIER_nondet_bool() [L112] newmax3 = __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)) [L2433] COND FALSE !(!(init__r131 == 0)) [L2449] init__tmp = 0 [L143] init__r122 = (_Bool)init__tmp [L144] COND FALSE !(!(init__r131 == 0)) [L2410] COND FALSE !(!(init__r121 == 0)) [L2426] init__tmp___0 = 0 [L148] init__r132 = (_Bool)init__tmp___0 [L149] COND FALSE !(!(init__r211 == 0)) [L2387] COND FALSE !(!(init__r231 == 0)) [L2403] init__tmp___1 = 0 [L153] init__r212 = (_Bool)init__tmp___1 [L154] COND FALSE !(!(init__r231 == 0)) [L2364] COND FALSE !(!(init__r211 == 0)) [L2380] init__tmp___2 = 0 [L158] init__r232 = (_Bool)init__tmp___2 [L159] COND FALSE !(!(init__r311 == 0)) [L2341] COND FALSE !(!(init__r321 == 0)) [L2357] init__tmp___3 = 0 [L163] init__r312 = (_Bool)init__tmp___3 [L164] COND FALSE !(!(init__r321 == 0)) [L2318] COND FALSE !(!(init__r311 == 0)) [L2334] 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] COND TRUE !(newmax1 == 0) [L213] COND TRUE !(newmax2 == 0) [L215] COND TRUE !(newmax3 == 0) [L217] init__tmp___5 = 1 [L218] __return_1863 = init__tmp___5 [L219] main__i2 = __return_1863 [L220] COND TRUE main__i2 != 0 [L222] p12_old = nomsg [L223] p12_new = nomsg [L224] p13_old = nomsg [L225] p13_new = nomsg [L226] p21_old = nomsg [L227] p21_new = nomsg [L228] p23_old = nomsg [L229] p23_new = nomsg [L230] p31_old = nomsg [L231] p31_new = nomsg [L232] p32_old = nomsg [L233] p32_new = nomsg [L234] main__i2 = 0 [L235] COND TRUE main__i2 < 6 [L238] _Bool node1__newmax; [L239] node1__newmax = 0 [L240] COND FALSE !(!(mode1 == 0)) [L246] COND TRUE ((int)r1) < 2 [L248] COND FALSE !(!(ep12 == 0)) [L261] COND FALSE !(!(ep13 == 0)) [L274] mode1 = 1 [L276] _Bool node2__newmax; [L277] node2__newmax = 0 [L278] COND FALSE !(!(mode2 == 0)) [L284] COND TRUE ((int)r2) < 2 [L286] COND FALSE !(!(ep21 == 0)) [L299] COND FALSE !(!(ep23 == 0)) [L312] mode2 = 1 [L314] _Bool node3__newmax; [L315] node3__newmax = 0 [L316] COND FALSE !(!(mode3 == 0)) [L322] COND TRUE ((int)r3) < 2 [L324] COND FALSE !(!(ep31 == 0)) [L337] COND FALSE !(!(ep32 == 0)) [L350] mode3 = 1 [L351] p12_old = p12_new [L352] p12_new = nomsg [L353] p13_old = p13_new [L354] p13_new = nomsg [L355] p21_old = p21_new [L356] p21_new = nomsg [L357] p23_old = p23_new [L358] p23_new = nomsg [L359] p31_old = p31_new [L360] p31_new = nomsg [L361] p32_old = p32_new [L362] p32_new = nomsg [L364] int check__tmp; [L365] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 [L367] COND TRUE (((int)st1) + ((int)nl1)) <= 1 [L369] COND TRUE (((int)st2) + ((int)nl2)) <= 1 [L371] COND TRUE (((int)st3) + ((int)nl3)) <= 1 [L373] COND FALSE !(((int)r1) >= 2) [L379] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 [L381] COND TRUE ((int)r1) < 2 [L383] COND FALSE !(((int)r1) >= 2) [L389] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 [L391] COND TRUE ((int)r1) < 2 [L393] check__tmp = 1 [L394] __return_2009 = check__tmp [L395] main__c1 = __return_2009 [L397] _Bool __tmp_1; [L398] __tmp_1 = main__c1 [L399] _Bool assert__arg; [L400] assert__arg = __tmp_1 [L401] COND FALSE !(assert__arg == 0) [L407] int main____CPAchecker_TMP_0 = main__i2; [L408] main__i2 = main__i2 + 1 [L409] COND TRUE main__i2 < 6 [L412] _Bool node1__newmax; [L413] node1__newmax = 0 [L414] COND TRUE !(mode1 == 0) [L416] r1 = (char)(((int)r1) + 1) [L417] COND FALSE !(!(ep21 == 0)) [L426] COND FALSE !(!(ep31 == 0)) [L435] newmax1 = node1__newmax [L436] COND FALSE !(((int)r1) == 2) [L442] mode1 = 0 [L444] _Bool node2__newmax; [L445] node2__newmax = 0 [L446] COND TRUE !(mode2 == 0) [L448] r2 = (char)(((int)r2) + 1) [L449] COND FALSE !(!(ep12 == 0)) [L458] COND FALSE !(!(ep32 == 0)) [L467] newmax2 = node2__newmax [L468] COND FALSE !(((int)r2) == 2) [L474] mode2 = 0 [L476] _Bool node3__newmax; [L477] node3__newmax = 0 [L478] COND TRUE !(mode3 == 0) [L480] r3 = (char)(((int)r3) + 1) [L481] COND FALSE !(!(ep13 == 0)) [L490] COND FALSE !(!(ep23 == 0)) [L499] newmax3 = node3__newmax [L500] COND FALSE !(((int)r3) == 2) [L506] mode3 = 0 [L507] p12_old = p12_new [L508] p12_new = nomsg [L509] p13_old = p13_new [L510] p13_new = nomsg [L511] p21_old = p21_new [L512] p21_new = nomsg [L513] p23_old = p23_new [L514] p23_new = nomsg [L515] p31_old = p31_new [L516] p31_new = nomsg [L517] p32_old = p32_new [L518] p32_new = nomsg [L520] int check__tmp; [L521] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 [L523] COND TRUE (((int)st1) + ((int)nl1)) <= 1 [L525] COND TRUE (((int)st2) + ((int)nl2)) <= 1 [L527] COND TRUE (((int)st3) + ((int)nl3)) <= 1 [L529] COND FALSE !(((int)r1) >= 2) [L535] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 [L537] COND TRUE ((int)r1) < 2 [L539] COND FALSE !(((int)r1) >= 2) [L545] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 [L547] COND TRUE ((int)r1) < 2 [L549] check__tmp = 1 [L550] __return_2142 = check__tmp [L551] main__c1 = __return_2142 [L553] _Bool __tmp_2; [L554] __tmp_2 = main__c1 [L555] _Bool assert__arg; [L556] assert__arg = __tmp_2 [L557] COND FALSE !(assert__arg == 0) [L563] int main____CPAchecker_TMP_0 = main__i2; [L564] main__i2 = main__i2 + 1 [L565] COND TRUE main__i2 < 6 [L568] _Bool node1__newmax; [L569] node1__newmax = 0 [L570] COND FALSE !(!(mode1 == 0)) [L576] COND TRUE ((int)r1) < 2 [L578] COND FALSE !(!(ep12 == 0)) [L591] COND FALSE !(!(ep13 == 0)) [L604] mode1 = 1 [L606] _Bool node2__newmax; [L607] node2__newmax = 0 [L608] COND FALSE !(!(mode2 == 0)) [L614] COND TRUE ((int)r2) < 2 [L616] COND FALSE !(!(ep21 == 0)) [L629] COND FALSE !(!(ep23 == 0)) [L642] mode2 = 1 [L644] _Bool node3__newmax; [L645] node3__newmax = 0 [L646] COND FALSE !(!(mode3 == 0)) [L652] COND TRUE ((int)r3) < 2 [L654] COND FALSE !(!(ep31 == 0)) [L667] COND FALSE !(!(ep32 == 0)) [L680] mode3 = 1 [L681] p12_old = p12_new [L682] p12_new = nomsg [L683] p13_old = p13_new [L684] p13_new = nomsg [L685] p21_old = p21_new [L686] p21_new = nomsg [L687] p23_old = p23_new [L688] p23_new = nomsg [L689] p31_old = p31_new [L690] p31_new = nomsg [L691] p32_old = p32_new [L692] p32_new = nomsg [L694] int check__tmp; [L695] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 [L697] COND TRUE (((int)st1) + ((int)nl1)) <= 1 [L699] COND TRUE (((int)st2) + ((int)nl2)) <= 1 [L701] COND TRUE (((int)st3) + ((int)nl3)) <= 1 [L703] COND FALSE !(((int)r1) >= 2) [L709] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 [L711] COND TRUE ((int)r1) < 2 [L713] COND FALSE !(((int)r1) >= 2) [L719] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 [L721] COND TRUE ((int)r1) < 2 [L723] check__tmp = 1 [L724] __return_2281 = check__tmp [L725] main__c1 = __return_2281 [L727] _Bool __tmp_3; [L728] __tmp_3 = main__c1 [L729] _Bool assert__arg; [L730] assert__arg = __tmp_3 [L731] COND FALSE !(assert__arg == 0) [L737] int main____CPAchecker_TMP_0 = main__i2; [L738] main__i2 = main__i2 + 1 [L739] COND TRUE main__i2 < 6 [L742] _Bool node1__newmax; [L743] node1__newmax = 0 [L744] COND TRUE !(mode1 == 0) [L746] r1 = (char)(((int)r1) + 1) [L747] COND FALSE !(!(ep21 == 0)) [L756] COND FALSE !(!(ep31 == 0)) [L765] newmax1 = node1__newmax [L766] COND TRUE ((int)r1) == 2 [L768] COND TRUE ((int)max1) == ((int)id1) [L770] st1 = 1 [L772] mode1 = 0 [L774] _Bool node2__newmax; [L775] node2__newmax = 0 [L776] COND TRUE !(mode2 == 0) [L778] r2 = (char)(((int)r2) + 1) [L779] COND FALSE !(!(ep12 == 0)) [L788] COND FALSE !(!(ep32 == 0)) [L797] newmax2 = node2__newmax [L798] COND TRUE ((int)r2) == 2 [L800] COND TRUE ((int)max2) == ((int)id2) [L802] st2 = 1 [L804] mode2 = 0 [L806] _Bool node3__newmax; [L807] node3__newmax = 0 [L808] COND TRUE !(mode3 == 0) [L810] r3 = (char)(((int)r3) + 1) [L811] COND FALSE !(!(ep13 == 0)) [L820] COND FALSE !(!(ep23 == 0)) [L829] newmax3 = node3__newmax [L830] COND TRUE ((int)r3) == 2 [L832] COND TRUE ((int)max3) == ((int)id3) [L834] st3 = 1 [L836] mode3 = 0 [L837] p12_old = p12_new [L838] p12_new = nomsg [L839] p13_old = p13_new [L840] p13_new = nomsg [L841] p21_old = p21_new [L842] p21_new = nomsg [L843] p23_old = p23_new [L844] p23_new = nomsg [L845] p31_old = p31_new [L846] p31_new = nomsg [L847] p32_old = p32_new [L848] p32_new = nomsg [L850] int check__tmp; [L851] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1533] check__tmp = 0 [L879] __return_2419 = check__tmp [L880] main__c1 = __return_2419 [L881] __tmp_2420_0 = main____CPAchecker_TMP_0 [L883] main____CPAchecker_TMP_0 = __tmp_2420_0 [L885] _Bool __tmp_4; [L886] __tmp_4 = main__c1 [L887] _Bool assert__arg; [L888] assert__arg = __tmp_4 [L889] COND TRUE assert__arg == 0 [L891] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 340 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 32.7s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7616 SDtfs, 7275 SDslu, 4541 SDs, 0 SdLazy, 8012 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7211occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 6824 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1696 NumberOfCodeBlocks, 1696 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1529 ConstructedInterpolants, 0 QuantifiedInterpolants, 819795 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...