/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/kundu1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 07:05:18,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 07:05:18,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 07:05:18,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 07:05:18,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 07:05:18,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 07:05:18,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 07:05:18,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 07:05:18,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 07:05:18,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 07:05:18,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 07:05:18,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 07:05:18,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 07:05:18,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 07:05:18,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 07:05:18,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 07:05:18,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 07:05:18,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 07:05:18,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 07:05:18,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 07:05:18,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 07:05:18,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 07:05:18,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 07:05:18,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 07:05:18,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 07:05:18,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 07:05:18,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 07:05:18,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 07:05:18,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 07:05:18,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 07:05:18,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 07:05:18,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 07:05:18,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 07:05:18,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 07:05:18,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 07:05:18,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 07:05:18,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 07:05:18,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 07:05:18,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 07:05:18,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 07:05:18,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 07:05:18,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 07:05:18,297 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 07:05:18,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 07:05:18,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 07:05:18,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 07:05:18,304 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 07:05:18,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 07:05:18,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 07:05:18,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 07:05:18,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 07:05:18,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 07:05:18,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 07:05:18,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 07:05:18,307 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 07:05:18,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 07:05:18,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 07:05:18,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 07:05:18,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 07:05:18,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 07:05:18,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 07:05:18,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 07:05:18,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 07:05:18,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 07:05:18,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 07:05:18,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 07:05:18,310 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 07:05:18,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 07:05:18,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 07:05:18,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 07:05:18,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 07:05:18,783 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 07:05:18,783 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 07:05:18,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2020-12-22 07:05:18,887 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec7c79efc/b7868c8bb9f34f7895d4a9ef27b330cf/FLAGf3a297e45 [2020-12-22 07:05:19,671 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 07:05:19,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2020-12-22 07:05:19,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec7c79efc/b7868c8bb9f34f7895d4a9ef27b330cf/FLAGf3a297e45 [2020-12-22 07:05:19,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec7c79efc/b7868c8bb9f34f7895d4a9ef27b330cf [2020-12-22 07:05:19,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 07:05:20,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 07:05:20,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 07:05:20,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 07:05:20,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 07:05:20,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:05:19" (1/1) ... [2020-12-22 07:05:20,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d64498a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:20, skipping insertion in model container [2020-12-22 07:05:20,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:05:19" (1/1) ... [2020-12-22 07:05:20,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 07:05:20,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 07:05:20,203 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c[331,344] [2020-12-22 07:05:20,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:05:20,310 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 07:05:20,326 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c[331,344] [2020-12-22 07:05:20,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:05:20,413 INFO L208 MainTranslator]: Completed translation [2020-12-22 07:05:20,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:20 WrapperNode [2020-12-22 07:05:20,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 07:05:20,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 07:05:20,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 07:05:20,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 07:05:20,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:20" (1/1) ... [2020-12-22 07:05:20,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:20" (1/1) ... [2020-12-22 07:05:20,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 07:05:20,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 07:05:20,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 07:05:20,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 07:05:20,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:20" (1/1) ... [2020-12-22 07:05:20,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:20" (1/1) ... [2020-12-22 07:05:20,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:20" (1/1) ... [2020-12-22 07:05:20,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:20" (1/1) ... [2020-12-22 07:05:20,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:20" (1/1) ... [2020-12-22 07:05:20,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:20" (1/1) ... [2020-12-22 07:05:20,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:20" (1/1) ... [2020-12-22 07:05:20,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 07:05:20,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 07:05:20,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 07:05:20,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 07:05:20,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 07:05:20,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 07:05:20,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 07:05:20,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 07:05:20,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 07:05:21,531 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 07:05:21,536 INFO L299 CfgBuilder]: Removed 72 assume(true) statements. [2020-12-22 07:05:21,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:05:21 BoogieIcfgContainer [2020-12-22 07:05:21,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 07:05:21,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 07:05:21,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 07:05:21,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 07:05:21,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 07:05:19" (1/3) ... [2020-12-22 07:05:21,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe9f3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:05:21, skipping insertion in model container [2020-12-22 07:05:21,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:20" (2/3) ... [2020-12-22 07:05:21,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe9f3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:05:21, skipping insertion in model container [2020-12-22 07:05:21,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:05:21" (3/3) ... [2020-12-22 07:05:21,559 INFO L111 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2020-12-22 07:05:21,566 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 07:05:21,572 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-12-22 07:05:21,595 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-12-22 07:05:21,642 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 07:05:21,642 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 07:05:21,642 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 07:05:21,642 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 07:05:21,642 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 07:05:21,644 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 07:05:21,645 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 07:05:21,645 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 07:05:21,672 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2020-12-22 07:05:21,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-22 07:05:21,682 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:21,682 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:21,683 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:21,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:21,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1913091172, now seen corresponding path program 1 times [2020-12-22 07:05:21,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:21,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333033137] [2020-12-22 07:05:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:21,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:21,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333033137] [2020-12-22 07:05:21,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:21,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:21,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483373180] [2020-12-22 07:05:21,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:21,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:21,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:21,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:21,996 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2020-12-22 07:05:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:22,054 INFO L93 Difference]: Finished difference Result 228 states and 346 transitions. [2020-12-22 07:05:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:22,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-12-22 07:05:22,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:22,069 INFO L225 Difference]: With dead ends: 228 [2020-12-22 07:05:22,069 INFO L226 Difference]: Without dead ends: 112 [2020-12-22 07:05:22,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:22,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-22 07:05:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-12-22 07:05:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-12-22 07:05:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2020-12-22 07:05:22,131 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 33 [2020-12-22 07:05:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:22,132 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2020-12-22 07:05:22,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2020-12-22 07:05:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-22 07:05:22,134 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:22,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:22,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 07:05:22,135 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:22,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash 526887778, now seen corresponding path program 1 times [2020-12-22 07:05:22,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:22,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984233057] [2020-12-22 07:05:22,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:22,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984233057] [2020-12-22 07:05:22,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:22,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:22,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912012455] [2020-12-22 07:05:22,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:22,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:22,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:22,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:22,217 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand 3 states. [2020-12-22 07:05:22,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:22,341 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2020-12-22 07:05:22,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:22,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-12-22 07:05:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:22,344 INFO L225 Difference]: With dead ends: 304 [2020-12-22 07:05:22,345 INFO L226 Difference]: Without dead ends: 199 [2020-12-22 07:05:22,346 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-12-22 07:05:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 189. [2020-12-22 07:05:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-12-22 07:05:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 273 transitions. [2020-12-22 07:05:22,377 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 273 transitions. Word has length 33 [2020-12-22 07:05:22,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:22,378 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 273 transitions. [2020-12-22 07:05:22,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 273 transitions. [2020-12-22 07:05:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-22 07:05:22,379 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:22,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:22,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 07:05:22,380 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:22,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:22,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1145629853, now seen corresponding path program 1 times [2020-12-22 07:05:22,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:22,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808983121] [2020-12-22 07:05:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:22,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808983121] [2020-12-22 07:05:22,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:22,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:05:22,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188652565] [2020-12-22 07:05:22,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:22,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:22,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:22,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:22,452 INFO L87 Difference]: Start difference. First operand 189 states and 273 transitions. Second operand 5 states. [2020-12-22 07:05:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:22,569 INFO L93 Difference]: Finished difference Result 591 states and 861 transitions. [2020-12-22 07:05:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:05:22,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-12-22 07:05:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:22,573 INFO L225 Difference]: With dead ends: 591 [2020-12-22 07:05:22,574 INFO L226 Difference]: Without dead ends: 413 [2020-12-22 07:05:22,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:05:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-12-22 07:05:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 195. [2020-12-22 07:05:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-12-22 07:05:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 276 transitions. [2020-12-22 07:05:22,617 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 276 transitions. Word has length 33 [2020-12-22 07:05:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:22,617 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 276 transitions. [2020-12-22 07:05:22,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 276 transitions. [2020-12-22 07:05:22,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-22 07:05:22,621 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:22,621 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:22,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 07:05:22,624 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:22,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1343899109, now seen corresponding path program 1 times [2020-12-22 07:05:22,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:22,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343419945] [2020-12-22 07:05:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:22,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343419945] [2020-12-22 07:05:22,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:22,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:22,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709974344] [2020-12-22 07:05:22,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:05:22,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:22,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:05:22,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:22,737 INFO L87 Difference]: Start difference. First operand 195 states and 276 transitions. Second operand 4 states. [2020-12-22 07:05:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:22,965 INFO L93 Difference]: Finished difference Result 621 states and 872 transitions. [2020-12-22 07:05:22,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:05:22,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-12-22 07:05:22,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:22,969 INFO L225 Difference]: With dead ends: 621 [2020-12-22 07:05:22,969 INFO L226 Difference]: Without dead ends: 439 [2020-12-22 07:05:22,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-12-22 07:05:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 333. [2020-12-22 07:05:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-12-22 07:05:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 464 transitions. [2020-12-22 07:05:23,028 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 464 transitions. Word has length 33 [2020-12-22 07:05:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:23,029 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 464 transitions. [2020-12-22 07:05:23,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:05:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 464 transitions. [2020-12-22 07:05:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-22 07:05:23,030 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:23,030 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] [2020-12-22 07:05:23,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 07:05:23,031 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:23,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:23,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1179728243, now seen corresponding path program 1 times [2020-12-22 07:05:23,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:23,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451167097] [2020-12-22 07:05:23,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:23,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451167097] [2020-12-22 07:05:23,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:23,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:05:23,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866939745] [2020-12-22 07:05:23,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:23,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:23,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:23,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:23,139 INFO L87 Difference]: Start difference. First operand 333 states and 464 transitions. Second operand 5 states. [2020-12-22 07:05:23,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:23,288 INFO L93 Difference]: Finished difference Result 1126 states and 1579 transitions. [2020-12-22 07:05:23,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:05:23,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-12-22 07:05:23,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:23,294 INFO L225 Difference]: With dead ends: 1126 [2020-12-22 07:05:23,295 INFO L226 Difference]: Without dead ends: 812 [2020-12-22 07:05:23,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:05:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-12-22 07:05:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 360. [2020-12-22 07:05:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-12-22 07:05:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 491 transitions. [2020-12-22 07:05:23,357 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 491 transitions. Word has length 34 [2020-12-22 07:05:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:23,358 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 491 transitions. [2020-12-22 07:05:23,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 491 transitions. [2020-12-22 07:05:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-22 07:05:23,366 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:23,367 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] [2020-12-22 07:05:23,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 07:05:23,367 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:23,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:23,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1526891151, now seen corresponding path program 1 times [2020-12-22 07:05:23,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:23,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021877172] [2020-12-22 07:05:23,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:23,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021877172] [2020-12-22 07:05:23,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:23,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:23,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259035878] [2020-12-22 07:05:23,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:05:23,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:23,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:05:23,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:23,479 INFO L87 Difference]: Start difference. First operand 360 states and 491 transitions. Second operand 4 states. [2020-12-22 07:05:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:23,696 INFO L93 Difference]: Finished difference Result 1662 states and 2286 transitions. [2020-12-22 07:05:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:05:23,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-12-22 07:05:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:23,705 INFO L225 Difference]: With dead ends: 1662 [2020-12-22 07:05:23,705 INFO L226 Difference]: Without dead ends: 1324 [2020-12-22 07:05:23,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:23,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2020-12-22 07:05:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 674. [2020-12-22 07:05:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-12-22 07:05:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 923 transitions. [2020-12-22 07:05:23,803 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 923 transitions. Word has length 34 [2020-12-22 07:05:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:23,804 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 923 transitions. [2020-12-22 07:05:23,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:05:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 923 transitions. [2020-12-22 07:05:23,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-22 07:05:23,805 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:23,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] [2020-12-22 07:05:23,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 07:05:23,806 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:23,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:23,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1026068075, now seen corresponding path program 1 times [2020-12-22 07:05:23,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:23,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379097684] [2020-12-22 07:05:23,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:23,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379097684] [2020-12-22 07:05:23,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:23,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:05:23,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867772427] [2020-12-22 07:05:23,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:23,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:23,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:23,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:23,897 INFO L87 Difference]: Start difference. First operand 674 states and 923 transitions. Second operand 5 states. [2020-12-22 07:05:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:24,062 INFO L93 Difference]: Finished difference Result 1497 states and 2054 transitions. [2020-12-22 07:05:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:05:24,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-12-22 07:05:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:24,069 INFO L225 Difference]: With dead ends: 1497 [2020-12-22 07:05:24,069 INFO L226 Difference]: Without dead ends: 845 [2020-12-22 07:05:24,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2020-12-22 07:05:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2020-12-22 07:05:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2020-12-22 07:05:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1144 transitions. [2020-12-22 07:05:24,164 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1144 transitions. Word has length 41 [2020-12-22 07:05:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:24,165 INFO L481 AbstractCegarLoop]: Abstraction has 837 states and 1144 transitions. [2020-12-22 07:05:24,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1144 transitions. [2020-12-22 07:05:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-22 07:05:24,167 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:24,168 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] [2020-12-22 07:05:24,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 07:05:24,168 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:24,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:24,169 INFO L82 PathProgramCache]: Analyzing trace with hash -305826283, now seen corresponding path program 1 times [2020-12-22 07:05:24,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:24,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371486502] [2020-12-22 07:05:24,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:24,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371486502] [2020-12-22 07:05:24,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:24,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 07:05:24,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191267696] [2020-12-22 07:05:24,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:05:24,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:24,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:05:24,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:05:24,300 INFO L87 Difference]: Start difference. First operand 837 states and 1144 transitions. Second operand 6 states. [2020-12-22 07:05:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:24,664 INFO L93 Difference]: Finished difference Result 3287 states and 4502 transitions. [2020-12-22 07:05:24,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 07:05:24,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-12-22 07:05:24,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:24,678 INFO L225 Difference]: With dead ends: 3287 [2020-12-22 07:05:24,679 INFO L226 Difference]: Without dead ends: 2472 [2020-12-22 07:05:24,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-22 07:05:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2020-12-22 07:05:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 1321. [2020-12-22 07:05:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2020-12-22 07:05:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1806 transitions. [2020-12-22 07:05:24,857 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1806 transitions. Word has length 44 [2020-12-22 07:05:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:24,858 INFO L481 AbstractCegarLoop]: Abstraction has 1321 states and 1806 transitions. [2020-12-22 07:05:24,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:05:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1806 transitions. [2020-12-22 07:05:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-22 07:05:24,859 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:24,859 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:24,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 07:05:24,859 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:24,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1702134670, now seen corresponding path program 1 times [2020-12-22 07:05:24,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:24,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163394439] [2020-12-22 07:05:24,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-22 07:05:24,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163394439] [2020-12-22 07:05:24,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:24,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:24,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222811876] [2020-12-22 07:05:24,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:24,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:24,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:24,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:24,895 INFO L87 Difference]: Start difference. First operand 1321 states and 1806 transitions. Second operand 3 states. [2020-12-22 07:05:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:25,171 INFO L93 Difference]: Finished difference Result 3798 states and 5147 transitions. [2020-12-22 07:05:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:25,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-22 07:05:25,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:25,185 INFO L225 Difference]: With dead ends: 3798 [2020-12-22 07:05:25,186 INFO L226 Difference]: Without dead ends: 2499 [2020-12-22 07:05:25,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2020-12-22 07:05:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2495. [2020-12-22 07:05:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2020-12-22 07:05:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3301 transitions. [2020-12-22 07:05:25,471 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3301 transitions. Word has length 46 [2020-12-22 07:05:25,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:25,472 INFO L481 AbstractCegarLoop]: Abstraction has 2495 states and 3301 transitions. [2020-12-22 07:05:25,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3301 transitions. [2020-12-22 07:05:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-22 07:05:25,473 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:25,473 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:25,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 07:05:25,474 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:25,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:25,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1664931104, now seen corresponding path program 1 times [2020-12-22 07:05:25,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:25,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457694276] [2020-12-22 07:05:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:25,541 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:25,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457694276] [2020-12-22 07:05:25,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:25,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:25,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896438767] [2020-12-22 07:05:25,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:05:25,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:25,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:05:25,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:25,544 INFO L87 Difference]: Start difference. First operand 2495 states and 3301 transitions. Second operand 4 states. [2020-12-22 07:05:26,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:26,313 INFO L93 Difference]: Finished difference Result 9142 states and 11944 transitions. [2020-12-22 07:05:26,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:05:26,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-12-22 07:05:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:26,346 INFO L225 Difference]: With dead ends: 9142 [2020-12-22 07:05:26,347 INFO L226 Difference]: Without dead ends: 6671 [2020-12-22 07:05:26,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2020-12-22 07:05:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 5850. [2020-12-22 07:05:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2020-12-22 07:05:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 7499 transitions. [2020-12-22 07:05:26,928 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 7499 transitions. Word has length 48 [2020-12-22 07:05:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:26,929 INFO L481 AbstractCegarLoop]: Abstraction has 5850 states and 7499 transitions. [2020-12-22 07:05:26,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:05:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 7499 transitions. [2020-12-22 07:05:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-22 07:05:26,930 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:26,931 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:26,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 07:05:26,931 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:26,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:26,932 INFO L82 PathProgramCache]: Analyzing trace with hash 403090641, now seen corresponding path program 1 times [2020-12-22 07:05:26,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:26,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117312778] [2020-12-22 07:05:26,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:26,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117312778] [2020-12-22 07:05:26,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:26,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:26,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546565146] [2020-12-22 07:05:26,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:26,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:26,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:26,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:26,971 INFO L87 Difference]: Start difference. First operand 5850 states and 7499 transitions. Second operand 3 states. [2020-12-22 07:05:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:27,555 INFO L93 Difference]: Finished difference Result 11044 states and 14195 transitions. [2020-12-22 07:05:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:27,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-12-22 07:05:27,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:27,584 INFO L225 Difference]: With dead ends: 11044 [2020-12-22 07:05:27,585 INFO L226 Difference]: Without dead ends: 5852 [2020-12-22 07:05:27,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:27,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5852 states. [2020-12-22 07:05:28,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5852 to 5850. [2020-12-22 07:05:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2020-12-22 07:05:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 7394 transitions. [2020-12-22 07:05:28,071 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 7394 transitions. Word has length 48 [2020-12-22 07:05:28,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:28,072 INFO L481 AbstractCegarLoop]: Abstraction has 5850 states and 7394 transitions. [2020-12-22 07:05:28,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 7394 transitions. [2020-12-22 07:05:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-22 07:05:28,073 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:28,074 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:28,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 07:05:28,074 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:28,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:28,075 INFO L82 PathProgramCache]: Analyzing trace with hash 57108908, now seen corresponding path program 1 times [2020-12-22 07:05:28,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:28,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882465064] [2020-12-22 07:05:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:28,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882465064] [2020-12-22 07:05:28,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:28,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:28,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050979886] [2020-12-22 07:05:28,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:05:28,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:28,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:05:28,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:28,114 INFO L87 Difference]: Start difference. First operand 5850 states and 7394 transitions. Second operand 4 states. [2020-12-22 07:05:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:28,625 INFO L93 Difference]: Finished difference Result 10947 states and 13872 transitions. [2020-12-22 07:05:28,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:05:28,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-22 07:05:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:28,674 INFO L225 Difference]: With dead ends: 10947 [2020-12-22 07:05:28,675 INFO L226 Difference]: Without dead ends: 5013 [2020-12-22 07:05:28,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5013 states. [2020-12-22 07:05:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5013 to 4814. [2020-12-22 07:05:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2020-12-22 07:05:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 5985 transitions. [2020-12-22 07:05:29,120 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 5985 transitions. Word has length 49 [2020-12-22 07:05:29,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:29,120 INFO L481 AbstractCegarLoop]: Abstraction has 4814 states and 5985 transitions. [2020-12-22 07:05:29,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:05:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 5985 transitions. [2020-12-22 07:05:29,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-22 07:05:29,124 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:29,125 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:05:29,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 07:05:29,125 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:29,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:29,126 INFO L82 PathProgramCache]: Analyzing trace with hash 652914839, now seen corresponding path program 1 times [2020-12-22 07:05:29,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:29,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259308626] [2020-12-22 07:05:29,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-22 07:05:29,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259308626] [2020-12-22 07:05:29,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:29,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:05:29,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371981655] [2020-12-22 07:05:29,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:29,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:29,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:29,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:29,193 INFO L87 Difference]: Start difference. First operand 4814 states and 5985 transitions. Second operand 5 states. [2020-12-22 07:05:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:29,645 INFO L93 Difference]: Finished difference Result 8526 states and 10629 transitions. [2020-12-22 07:05:29,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 07:05:29,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2020-12-22 07:05:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:29,655 INFO L225 Difference]: With dead ends: 8526 [2020-12-22 07:05:29,656 INFO L226 Difference]: Without dead ends: 3744 [2020-12-22 07:05:29,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 07:05:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2020-12-22 07:05:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3233. [2020-12-22 07:05:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3233 states. [2020-12-22 07:05:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4035 transitions. [2020-12-22 07:05:30,022 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4035 transitions. Word has length 83 [2020-12-22 07:05:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:30,025 INFO L481 AbstractCegarLoop]: Abstraction has 3233 states and 4035 transitions. [2020-12-22 07:05:30,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:30,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4035 transitions. [2020-12-22 07:05:30,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-22 07:05:30,036 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:30,037 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:05:30,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 07:05:30,037 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:30,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:30,038 INFO L82 PathProgramCache]: Analyzing trace with hash 994874622, now seen corresponding path program 1 times [2020-12-22 07:05:30,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:30,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709088089] [2020-12-22 07:05:30,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-22 07:05:30,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709088089] [2020-12-22 07:05:30,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:30,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:30,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928489992] [2020-12-22 07:05:30,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:30,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:30,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:30,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:30,080 INFO L87 Difference]: Start difference. First operand 3233 states and 4035 transitions. Second operand 3 states. [2020-12-22 07:05:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:30,374 INFO L93 Difference]: Finished difference Result 3481 states and 4330 transitions. [2020-12-22 07:05:30,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:30,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-22 07:05:30,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:30,381 INFO L225 Difference]: With dead ends: 3481 [2020-12-22 07:05:30,382 INFO L226 Difference]: Without dead ends: 3217 [2020-12-22 07:05:30,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:30,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2020-12-22 07:05:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 3217. [2020-12-22 07:05:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2020-12-22 07:05:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4018 transitions. [2020-12-22 07:05:30,656 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4018 transitions. Word has length 86 [2020-12-22 07:05:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:30,657 INFO L481 AbstractCegarLoop]: Abstraction has 3217 states and 4018 transitions. [2020-12-22 07:05:30,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4018 transitions. [2020-12-22 07:05:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-22 07:05:30,660 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:30,660 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:05:30,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 07:05:30,660 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:30,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:30,661 INFO L82 PathProgramCache]: Analyzing trace with hash -684103662, now seen corresponding path program 1 times [2020-12-22 07:05:30,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:30,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913809223] [2020-12-22 07:05:30,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:30,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913809223] [2020-12-22 07:05:30,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:30,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:30,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909059386] [2020-12-22 07:05:30,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:30,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:30,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:30,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:30,774 INFO L87 Difference]: Start difference. First operand 3217 states and 4018 transitions. Second operand 3 states. [2020-12-22 07:05:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:31,021 INFO L93 Difference]: Finished difference Result 3591 states and 4462 transitions. [2020-12-22 07:05:31,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:31,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-12-22 07:05:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:31,030 INFO L225 Difference]: With dead ends: 3591 [2020-12-22 07:05:31,030 INFO L226 Difference]: Without dead ends: 3202 [2020-12-22 07:05:31,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2020-12-22 07:05:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3195. [2020-12-22 07:05:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2020-12-22 07:05:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 3992 transitions. [2020-12-22 07:05:31,283 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 3992 transitions. Word has length 89 [2020-12-22 07:05:31,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:31,284 INFO L481 AbstractCegarLoop]: Abstraction has 3195 states and 3992 transitions. [2020-12-22 07:05:31,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 3992 transitions. [2020-12-22 07:05:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-22 07:05:31,287 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:31,287 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:05:31,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 07:05:31,288 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:31,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:31,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1261043826, now seen corresponding path program 1 times [2020-12-22 07:05:31,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:31,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859599659] [2020-12-22 07:05:31,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:31,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859599659] [2020-12-22 07:05:31,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:31,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:31,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573200334] [2020-12-22 07:05:31,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:31,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:31,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:31,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:31,373 INFO L87 Difference]: Start difference. First operand 3195 states and 3992 transitions. Second operand 5 states. [2020-12-22 07:05:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:31,720 INFO L93 Difference]: Finished difference Result 6859 states and 8520 transitions. [2020-12-22 07:05:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:05:31,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-12-22 07:05:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:31,734 INFO L225 Difference]: With dead ends: 6859 [2020-12-22 07:05:31,734 INFO L226 Difference]: Without dead ends: 3724 [2020-12-22 07:05:31,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:05:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2020-12-22 07:05:31,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3073. [2020-12-22 07:05:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2020-12-22 07:05:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3805 transitions. [2020-12-22 07:05:31,976 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3805 transitions. Word has length 95 [2020-12-22 07:05:31,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:31,976 INFO L481 AbstractCegarLoop]: Abstraction has 3073 states and 3805 transitions. [2020-12-22 07:05:31,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:31,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3805 transitions. [2020-12-22 07:05:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-22 07:05:31,979 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:31,979 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:05:31,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 07:05:31,979 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash -666432318, now seen corresponding path program 1 times [2020-12-22 07:05:31,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:31,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988915798] [2020-12-22 07:05:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-22 07:05:32,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988915798] [2020-12-22 07:05:32,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:32,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:32,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678476263] [2020-12-22 07:05:32,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:32,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:32,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:32,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:32,047 INFO L87 Difference]: Start difference. First operand 3073 states and 3805 transitions. Second operand 5 states. [2020-12-22 07:05:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:32,394 INFO L93 Difference]: Finished difference Result 5583 states and 6899 transitions. [2020-12-22 07:05:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:05:32,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-22 07:05:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:32,402 INFO L225 Difference]: With dead ends: 5583 [2020-12-22 07:05:32,402 INFO L226 Difference]: Without dead ends: 2208 [2020-12-22 07:05:32,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:05:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2020-12-22 07:05:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2050. [2020-12-22 07:05:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2020-12-22 07:05:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2515 transitions. [2020-12-22 07:05:32,618 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2515 transitions. Word has length 98 [2020-12-22 07:05:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:32,618 INFO L481 AbstractCegarLoop]: Abstraction has 2050 states and 2515 transitions. [2020-12-22 07:05:32,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2515 transitions. [2020-12-22 07:05:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-22 07:05:32,621 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:32,621 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:05:32,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 07:05:32,622 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:32,623 INFO L82 PathProgramCache]: Analyzing trace with hash -165994237, now seen corresponding path program 1 times [2020-12-22 07:05:32,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:32,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741481154] [2020-12-22 07:05:32,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:32,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741481154] [2020-12-22 07:05:32,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:32,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:32,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532729402] [2020-12-22 07:05:32,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:32,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:32,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:32,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:32,687 INFO L87 Difference]: Start difference. First operand 2050 states and 2515 transitions. Second operand 3 states. [2020-12-22 07:05:32,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:32,855 INFO L93 Difference]: Finished difference Result 3786 states and 4676 transitions. [2020-12-22 07:05:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:32,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-12-22 07:05:32,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:32,861 INFO L225 Difference]: With dead ends: 3786 [2020-12-22 07:05:32,861 INFO L226 Difference]: Without dead ends: 1796 [2020-12-22 07:05:32,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2020-12-22 07:05:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1793. [2020-12-22 07:05:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2020-12-22 07:05:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2167 transitions. [2020-12-22 07:05:33,022 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2167 transitions. Word has length 111 [2020-12-22 07:05:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:33,023 INFO L481 AbstractCegarLoop]: Abstraction has 1793 states and 2167 transitions. [2020-12-22 07:05:33,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2167 transitions. [2020-12-22 07:05:33,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-22 07:05:33,025 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:33,025 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:05:33,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 07:05:33,026 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:33,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:33,026 INFO L82 PathProgramCache]: Analyzing trace with hash -896834660, now seen corresponding path program 1 times [2020-12-22 07:05:33,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:33,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082536476] [2020-12-22 07:05:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:33,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082536476] [2020-12-22 07:05:33,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:33,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:33,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353857855] [2020-12-22 07:05:33,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:33,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:33,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:33,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:33,128 INFO L87 Difference]: Start difference. First operand 1793 states and 2167 transitions. Second operand 5 states. [2020-12-22 07:05:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:33,372 INFO L93 Difference]: Finished difference Result 3489 states and 4203 transitions. [2020-12-22 07:05:33,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:05:33,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2020-12-22 07:05:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:33,378 INFO L225 Difference]: With dead ends: 3489 [2020-12-22 07:05:33,378 INFO L226 Difference]: Without dead ends: 1757 [2020-12-22 07:05:33,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:05:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2020-12-22 07:05:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1618. [2020-12-22 07:05:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2020-12-22 07:05:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 1932 transitions. [2020-12-22 07:05:33,538 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 1932 transitions. Word has length 113 [2020-12-22 07:05:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:33,539 INFO L481 AbstractCegarLoop]: Abstraction has 1618 states and 1932 transitions. [2020-12-22 07:05:33,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1932 transitions. [2020-12-22 07:05:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-22 07:05:33,541 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:33,542 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:05:33,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 07:05:33,542 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:33,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:33,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1105184803, now seen corresponding path program 1 times [2020-12-22 07:05:33,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:33,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605863658] [2020-12-22 07:05:33,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:33,594 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:33,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605863658] [2020-12-22 07:05:33,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:33,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:33,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726147112] [2020-12-22 07:05:33,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:33,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:33,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:33,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:33,597 INFO L87 Difference]: Start difference. First operand 1618 states and 1932 transitions. Second operand 3 states. [2020-12-22 07:05:33,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:33,812 INFO L93 Difference]: Finished difference Result 3212 states and 3849 transitions. [2020-12-22 07:05:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:33,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-12-22 07:05:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:33,817 INFO L225 Difference]: With dead ends: 3212 [2020-12-22 07:05:33,817 INFO L226 Difference]: Without dead ends: 1655 [2020-12-22 07:05:33,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2020-12-22 07:05:34,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1646. [2020-12-22 07:05:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2020-12-22 07:05:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 1934 transitions. [2020-12-22 07:05:34,026 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 1934 transitions. Word has length 113 [2020-12-22 07:05:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:34,026 INFO L481 AbstractCegarLoop]: Abstraction has 1646 states and 1934 transitions. [2020-12-22 07:05:34,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 1934 transitions. [2020-12-22 07:05:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-22 07:05:34,030 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:34,030 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:05:34,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-22 07:05:34,030 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:34,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:34,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1508765653, now seen corresponding path program 1 times [2020-12-22 07:05:34,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:34,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66957710] [2020-12-22 07:05:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:34,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66957710] [2020-12-22 07:05:34,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:34,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:05:34,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759531965] [2020-12-22 07:05:34,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:34,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:34,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:34,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:34,100 INFO L87 Difference]: Start difference. First operand 1646 states and 1934 transitions. Second operand 5 states. [2020-12-22 07:05:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:34,320 INFO L93 Difference]: Finished difference Result 3439 states and 4013 transitions. [2020-12-22 07:05:34,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:05:34,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2020-12-22 07:05:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:34,325 INFO L225 Difference]: With dead ends: 3439 [2020-12-22 07:05:34,325 INFO L226 Difference]: Without dead ends: 1854 [2020-12-22 07:05:34,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:05:34,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2020-12-22 07:05:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1621. [2020-12-22 07:05:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1621 states. [2020-12-22 07:05:34,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1874 transitions. [2020-12-22 07:05:34,442 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1874 transitions. Word has length 114 [2020-12-22 07:05:34,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:34,442 INFO L481 AbstractCegarLoop]: Abstraction has 1621 states and 1874 transitions. [2020-12-22 07:05:34,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:34,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1874 transitions. [2020-12-22 07:05:34,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-22 07:05:34,445 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:34,445 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:05:34,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-22 07:05:34,445 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:34,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:34,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2018238743, now seen corresponding path program 1 times [2020-12-22 07:05:34,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:34,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996662719] [2020-12-22 07:05:34,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:34,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996662719] [2020-12-22 07:05:34,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:34,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:05:34,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124593496] [2020-12-22 07:05:34,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:34,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:34,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:34,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:34,507 INFO L87 Difference]: Start difference. First operand 1621 states and 1874 transitions. Second operand 5 states. [2020-12-22 07:05:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:34,867 INFO L93 Difference]: Finished difference Result 4536 states and 5247 transitions. [2020-12-22 07:05:34,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 07:05:34,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2020-12-22 07:05:34,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:34,875 INFO L225 Difference]: With dead ends: 4536 [2020-12-22 07:05:34,875 INFO L226 Difference]: Without dead ends: 2976 [2020-12-22 07:05:34,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-22 07:05:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-12-22 07:05:35,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1623. [2020-12-22 07:05:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2020-12-22 07:05:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 1872 transitions. [2020-12-22 07:05:35,032 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 1872 transitions. Word has length 114 [2020-12-22 07:05:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:35,032 INFO L481 AbstractCegarLoop]: Abstraction has 1623 states and 1872 transitions. [2020-12-22 07:05:35,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 1872 transitions. [2020-12-22 07:05:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-22 07:05:35,035 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:35,035 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:05:35,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-22 07:05:35,035 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:35,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:35,036 INFO L82 PathProgramCache]: Analyzing trace with hash -29964582, now seen corresponding path program 1 times [2020-12-22 07:05:35,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:35,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867922817] [2020-12-22 07:05:35,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:35,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867922817] [2020-12-22 07:05:35,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:35,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:35,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605625673] [2020-12-22 07:05:35,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:35,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:35,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:35,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:35,079 INFO L87 Difference]: Start difference. First operand 1623 states and 1872 transitions. Second operand 3 states. [2020-12-22 07:05:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:35,227 INFO L93 Difference]: Finished difference Result 2877 states and 3320 transitions. [2020-12-22 07:05:35,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:35,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-12-22 07:05:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:35,231 INFO L225 Difference]: With dead ends: 2877 [2020-12-22 07:05:35,231 INFO L226 Difference]: Without dead ends: 1315 [2020-12-22 07:05:35,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2020-12-22 07:05:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1207. [2020-12-22 07:05:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2020-12-22 07:05:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1370 transitions. [2020-12-22 07:05:35,347 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1370 transitions. Word has length 116 [2020-12-22 07:05:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:35,348 INFO L481 AbstractCegarLoop]: Abstraction has 1207 states and 1370 transitions. [2020-12-22 07:05:35,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1370 transitions. [2020-12-22 07:05:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-22 07:05:35,349 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:35,349 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:05:35,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-22 07:05:35,350 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:35,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1919382230, now seen corresponding path program 1 times [2020-12-22 07:05:35,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:35,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011470954] [2020-12-22 07:05:35,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-22 07:05:35,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011470954] [2020-12-22 07:05:35,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595129859] [2020-12-22 07:05:35,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:05:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:35,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-22 07:05:35,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:05:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-22 07:05:35,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:05:35,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-12-22 07:05:35,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581124219] [2020-12-22 07:05:35,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:35,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:35,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:35,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:35,808 INFO L87 Difference]: Start difference. First operand 1207 states and 1370 transitions. Second operand 5 states. [2020-12-22 07:05:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:36,217 INFO L93 Difference]: Finished difference Result 2872 states and 3266 transitions. [2020-12-22 07:05:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 07:05:36,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2020-12-22 07:05:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:36,223 INFO L225 Difference]: With dead ends: 2872 [2020-12-22 07:05:36,223 INFO L226 Difference]: Without dead ends: 2094 [2020-12-22 07:05:36,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:05:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2020-12-22 07:05:36,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1322. [2020-12-22 07:05:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2020-12-22 07:05:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1497 transitions. [2020-12-22 07:05:36,406 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1497 transitions. Word has length 118 [2020-12-22 07:05:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:36,406 INFO L481 AbstractCegarLoop]: Abstraction has 1322 states and 1497 transitions. [2020-12-22 07:05:36,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:36,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1497 transitions. [2020-12-22 07:05:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-22 07:05:36,409 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:36,409 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:36,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-12-22 07:05:36,623 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:36,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:36,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1404970223, now seen corresponding path program 1 times [2020-12-22 07:05:36,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:36,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510017666] [2020-12-22 07:05:36,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:05:36,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:05:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:05:36,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:05:36,751 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 07:05:36,751 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 07:05:36,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-22 07:05:36,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 07:05:36 BoogieIcfgContainer [2020-12-22 07:05:36,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 07:05:36,988 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 07:05:36,988 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 07:05:36,989 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 07:05:36,989 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:05:21" (3/4) ... [2020-12-22 07:05:36,991 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 07:05:37,156 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/kundu1.cil.c-witness.graphml [2020-12-22 07:05:37,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 07:05:37,158 INFO L168 Benchmark]: Toolchain (without parser) took 17156.72 ms. Allocated memory was 167.8 MB in the beginning and 1.0 GB in the end (delta: 845.2 MB). Free memory was 143.9 MB in the beginning and 806.9 MB in the end (delta: -662.9 MB). Peak memory consumption was 183.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:37,158 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 167.8 MB. Free memory is still 139.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 07:05:37,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.57 ms. Allocated memory is still 167.8 MB. Free memory was 143.6 MB in the beginning and 130.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:37,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.57 ms. Allocated memory is still 167.8 MB. Free memory was 130.4 MB in the beginning and 128.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:37,159 INFO L168 Benchmark]: Boogie Preprocessor took 40.28 ms. Allocated memory is still 167.8 MB. Free memory was 128.1 MB in the beginning and 126.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:37,160 INFO L168 Benchmark]: RCFGBuilder took 1030.38 ms. Allocated memory is still 167.8 MB. Free memory was 126.1 MB in the beginning and 123.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 11.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:37,160 INFO L168 Benchmark]: TraceAbstraction took 15443.43 ms. Allocated memory was 167.8 MB in the beginning and 1.0 GB in the end (delta: 845.2 MB). Free memory was 123.7 MB in the beginning and 835.2 MB in the end (delta: -711.5 MB). Peak memory consumption was 134.2 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:37,161 INFO L168 Benchmark]: Witness Printer took 167.49 ms. Allocated memory is still 1.0 GB. Free memory was 835.2 MB in the beginning and 806.9 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:37,163 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 167.8 MB. Free memory is still 139.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 412.57 ms. Allocated memory is still 167.8 MB. Free memory was 143.6 MB in the beginning and 130.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 54.57 ms. Allocated memory is still 167.8 MB. Free memory was 130.4 MB in the beginning and 128.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.28 ms. Allocated memory is still 167.8 MB. Free memory was 128.1 MB in the beginning and 126.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1030.38 ms. Allocated memory is still 167.8 MB. Free memory was 126.1 MB in the beginning and 123.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 11.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15443.43 ms. Allocated memory was 167.8 MB in the beginning and 1.0 GB in the end (delta: 845.2 MB). Free memory was 123.7 MB in the beginning and 835.2 MB in the end (delta: -711.5 MB). Peak memory consumption was 134.2 MB. Max. memory is 8.0 GB. * Witness Printer took 167.49 ms. Allocated memory is still 1.0 GB. Free memory was 835.2 MB in the beginning and 806.9 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int max_loop ; [L18] int num ; [L19] int i ; [L20] int e ; [L21] int timer ; [L22] char data_0 ; [L23] char data_1 ; [L66] int P_1_pc; [L67] int P_1_st ; [L68] int P_1_i ; [L69] int P_1_ev ; [L124] int C_1_pc ; [L125] int C_1_st ; [L126] int C_1_i ; [L127] int C_1_ev ; [L128] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, timer=0] [L492] int count ; [L493] int __retres2 ; [L497] num = 0 [L498] i = 0 [L499] max_loop = 2 [L501] timer = 0 [L502] P_1_pc = 0 [L503] C_1_pc = 0 [L505] count = 0 [L485] P_1_i = 1 [L486] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L423] int kernel_st ; [L424] int tmp ; [L425] int tmp___0 ; [L429] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L228] COND TRUE (int )P_1_i == 1 [L229] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L233] COND TRUE (int )C_1_i == 1 [L234] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L109] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L119] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L121] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L188] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L191] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L211] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L213] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L437] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L271] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L296] COND TRUE (int )C_1_st == 0 [L298] tmp___1 = __VERIFIER_nondet_int() [L300] COND TRUE \read(tmp___1) [L302] C_1_st = 1 [L130] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L133] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L148] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L150] COND TRUE num == 0 [L151] timer = 1 [L152] i += 1 [L153] C_1_pc = 1 [L154] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L74] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L51] COND TRUE i___0 == 0 [L52] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L89] num += 1 [L90] P_1_pc = 1 [L91] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L444] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L448] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L119] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L188] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L213] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L454] tmp = exists_runnable_thread() [L456] COND TRUE tmp == 0 [L458] kernel_st = 4 [L338] C_1_ev = 1 [L340] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND TRUE (int )P_1_ev == 1 [L111] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND TRUE \read(tmp) [L376] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L188] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L213] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L352] COND TRUE (int )P_1_ev == 1 [L353] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L357] COND TRUE (int )C_1_ev == 1 [L358] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L404] int tmp ; [L405] int __retres2 ; [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L409] tmp = exists_runnable_thread() [L411] COND TRUE \read(tmp) [L412] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L419] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L467] tmp___0 = stop_simulation() [L469] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L437] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L74] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L77] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L51] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L54] COND TRUE i___0 == 1 [L55] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L89] num += 1 [L90] P_1_pc = 1 [L91] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L444] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L448] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L119] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L188] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L213] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L454] tmp = exists_runnable_thread() [L456] COND TRUE tmp == 0 [L458] kernel_st = 4 [L338] C_1_ev = 1 [L340] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND TRUE (int )P_1_ev == 1 [L111] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND TRUE \read(tmp) [L376] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L188] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L213] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L352] COND TRUE (int )P_1_ev == 1 [L353] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L357] COND TRUE (int )C_1_ev == 1 [L358] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L404] int tmp ; [L405] int __retres2 ; [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L409] tmp = exists_runnable_thread() [L411] COND TRUE \read(tmp) [L412] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L419] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L467] tmp___0 = stop_simulation() [L469] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L437] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L74] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L77] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L51] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L54] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L11] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 117 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.1s, OverallIterations: 25, TraceHistogramMax: 6, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4726 SDtfs, 6233 SDslu, 6768 SDs, 0 SdLazy, 720 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5850occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 7565 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2034 NumberOfCodeBlocks, 2034 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1819 ConstructedInterpolants, 0 QuantifiedInterpolants, 406730 SizeOfPredicates, 3 NumberOfNonLiveVariables, 373 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 25 InterpolantComputations, 23 PerfectInterpolantSequences, 404/474 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...