/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:26:16,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:26:16,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:26:16,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:26:16,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:26:16,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:26:16,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:26:16,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:26:16,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:26:16,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:26:16,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:26:16,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:26:16,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:26:16,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:26:16,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:26:16,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:26:16,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:26:16,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:26:16,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:26:16,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:26:16,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:26:16,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:26:16,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:26:16,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:26:16,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:26:16,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:26:16,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:26:16,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:26:16,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:26:16,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:26:16,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:26:16,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:26:16,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:26:16,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:26:16,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:26:16,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:26:16,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:26:16,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:26:16,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:26:16,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:26:16,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:26:16,341 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:26:16,366 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:26:16,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:26:16,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:26:16,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:26:16,367 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:26:16,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:26:16,368 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:26:16,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:26:16,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:26:16,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:26:16,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:26:16,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:26:16,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:26:16,371 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:26:16,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:26:16,371 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:26:16,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:26:16,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:26:16,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:26:16,372 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:26:16,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:26:16,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:26:16,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:26:16,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:26:16,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:26:16,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:26:16,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:26:16,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:26:16,377 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:26:16,377 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:26:16,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:26:16,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:26:16,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:26:16,669 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:26:16,670 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:26:16,671 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2020-07-17 22:26:16,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/202cf069c/12f6ae5191c2463e926263adca28cbba/FLAG5b2835131 [2020-07-17 22:26:17,095 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:26:17,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2020-07-17 22:26:17,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/202cf069c/12f6ae5191c2463e926263adca28cbba/FLAG5b2835131 [2020-07-17 22:26:17,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/202cf069c/12f6ae5191c2463e926263adca28cbba [2020-07-17 22:26:17,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:26:17,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:26:17,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:17,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:26:17,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:26:17,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:17" (1/1) ... [2020-07-17 22:26:17,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534aa85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:17, skipping insertion in model container [2020-07-17 22:26:17,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:17" (1/1) ... [2020-07-17 22:26:17,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:26:17,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:26:17,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:17,699 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:26:17,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:17,738 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:26:17,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:17 WrapperNode [2020-07-17 22:26:17,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:17,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:26:17,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:26:17,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:26:17,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:17" (1/1) ... [2020-07-17 22:26:17,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:17" (1/1) ... [2020-07-17 22:26:17,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:17" (1/1) ... [2020-07-17 22:26:17,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:17" (1/1) ... [2020-07-17 22:26:17,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:17" (1/1) ... [2020-07-17 22:26:17,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:17" (1/1) ... [2020-07-17 22:26:17,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:17" (1/1) ... [2020-07-17 22:26:17,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:26:17,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:26:17,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:26:17,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:26:17,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:17" (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-07-17 22:26:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:26:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:26:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:26:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:26:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:26:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:26:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:26:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:26:18,413 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:26:18,414 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:26:18,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:18 BoogieIcfgContainer [2020-07-17 22:26:18,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:26:18,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:26:18,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:26:18,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:26:18,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:26:17" (1/3) ... [2020-07-17 22:26:18,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2969ce17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:18, skipping insertion in model container [2020-07-17 22:26:18,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:17" (2/3) ... [2020-07-17 22:26:18,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2969ce17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:18, skipping insertion in model container [2020-07-17 22:26:18,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:18" (3/3) ... [2020-07-17 22:26:18,427 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-07-17 22:26:18,438 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:26:18,446 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:26:18,461 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:26:18,485 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:26:18,485 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:26:18,485 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:26:18,485 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:26:18,486 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:26:18,486 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:26:18,486 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:26:18,486 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:26:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-17 22:26:18,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:26:18,513 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:18,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:18,514 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:18,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2020-07-17 22:26:18,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:18,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676320855] [2020-07-17 22:26:18,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:26:18,748 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {38#true} {38#true} #146#return; {38#true} is VALID [2020-07-17 22:26:18,750 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2020-07-17 22:26:18,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:26:18,751 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #146#return; {38#true} is VALID [2020-07-17 22:26:18,752 INFO L263 TraceCheckUtils]: 3: Hoare triple {38#true} call #t~ret8 := main(); {38#true} is VALID [2020-07-17 22:26:18,752 INFO L280 TraceCheckUtils]: 4: Hoare triple {38#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {38#true} is VALID [2020-07-17 22:26:18,753 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {38#true} is VALID [2020-07-17 22:26:18,754 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {38#true} is VALID [2020-07-17 22:26:18,755 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#true} assume 0 != ~p1~0;~lk1~0 := 1; {42#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:18,757 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {42#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:18,758 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {42#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:18,759 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {42#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:18,760 INFO L280 TraceCheckUtils]: 11: Hoare triple {42#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {42#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:18,761 INFO L280 TraceCheckUtils]: 12: Hoare triple {42#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {42#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:18,762 INFO L280 TraceCheckUtils]: 13: Hoare triple {42#(= 1 main_~lk1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {42#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:18,763 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {42#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:18,764 INFO L280 TraceCheckUtils]: 15: Hoare triple {42#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {39#false} is VALID [2020-07-17 22:26:18,765 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-17 22:26:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:18,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676320855] [2020-07-17 22:26:18,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:18,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:18,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766996014] [2020-07-17 22:26:18,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:18,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:18,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:18,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:18,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:18,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:18,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:18,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:18,833 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-17 22:26:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,021 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2020-07-17 22:26:19,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:19,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-17 22:26:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-17 22:26:19,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2020-07-17 22:26:19,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,219 INFO L225 Difference]: With dead ends: 69 [2020-07-17 22:26:19,219 INFO L226 Difference]: Without dead ends: 54 [2020-07-17 22:26:19,223 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-17 22:26:19,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2020-07-17 22:26:19,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:19,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 38 states. [2020-07-17 22:26:19,266 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 38 states. [2020-07-17 22:26:19,266 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 38 states. [2020-07-17 22:26:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,273 INFO L93 Difference]: Finished difference Result 54 states and 92 transitions. [2020-07-17 22:26:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 92 transitions. [2020-07-17 22:26:19,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,275 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 54 states. [2020-07-17 22:26:19,276 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 54 states. [2020-07-17 22:26:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,292 INFO L93 Difference]: Finished difference Result 54 states and 92 transitions. [2020-07-17 22:26:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 92 transitions. [2020-07-17 22:26:19,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:19,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-17 22:26:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2020-07-17 22:26:19,300 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2020-07-17 22:26:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:19,300 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2020-07-17 22:26:19,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2020-07-17 22:26:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:26:19,302 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:19,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:19,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:26:19,303 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:19,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:19,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2020-07-17 22:26:19,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:19,304 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464239265] [2020-07-17 22:26:19,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-17 22:26:19,364 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {278#true} {278#true} #146#return; {278#true} is VALID [2020-07-17 22:26:19,365 INFO L263 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2020-07-17 22:26:19,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-17 22:26:19,366 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} #146#return; {278#true} is VALID [2020-07-17 22:26:19,366 INFO L263 TraceCheckUtils]: 3: Hoare triple {278#true} call #t~ret8 := main(); {278#true} is VALID [2020-07-17 22:26:19,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {278#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {278#true} is VALID [2020-07-17 22:26:19,367 INFO L280 TraceCheckUtils]: 5: Hoare triple {278#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {278#true} is VALID [2020-07-17 22:26:19,367 INFO L280 TraceCheckUtils]: 6: Hoare triple {278#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {278#true} is VALID [2020-07-17 22:26:19,368 INFO L280 TraceCheckUtils]: 7: Hoare triple {278#true} assume !(0 != ~p1~0); {282#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:19,369 INFO L280 TraceCheckUtils]: 8: Hoare triple {282#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {282#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:19,370 INFO L280 TraceCheckUtils]: 9: Hoare triple {282#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {282#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:19,371 INFO L280 TraceCheckUtils]: 10: Hoare triple {282#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {282#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:19,372 INFO L280 TraceCheckUtils]: 11: Hoare triple {282#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {282#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:19,372 INFO L280 TraceCheckUtils]: 12: Hoare triple {282#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {282#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:19,373 INFO L280 TraceCheckUtils]: 13: Hoare triple {282#(= 0 main_~p1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {282#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:19,374 INFO L280 TraceCheckUtils]: 14: Hoare triple {282#(= 0 main_~p1~0)} assume 0 != ~p1~0; {279#false} is VALID [2020-07-17 22:26:19,375 INFO L280 TraceCheckUtils]: 15: Hoare triple {279#false} assume 1 != ~lk1~0; {279#false} is VALID [2020-07-17 22:26:19,375 INFO L280 TraceCheckUtils]: 16: Hoare triple {279#false} assume !false; {279#false} is VALID [2020-07-17 22:26:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:19,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464239265] [2020-07-17 22:26:19,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:19,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:19,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056790393] [2020-07-17 22:26:19,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:19,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:19,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:19,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:19,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:19,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:19,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,406 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2020-07-17 22:26:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,527 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2020-07-17 22:26:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:19,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-17 22:26:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-17 22:26:19,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2020-07-17 22:26:19,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,702 INFO L225 Difference]: With dead ends: 87 [2020-07-17 22:26:19,702 INFO L226 Difference]: Without dead ends: 54 [2020-07-17 22:26:19,703 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-17 22:26:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2020-07-17 22:26:19,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:19,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2020-07-17 22:26:19,716 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2020-07-17 22:26:19,717 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2020-07-17 22:26:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,720 INFO L93 Difference]: Finished difference Result 54 states and 90 transitions. [2020-07-17 22:26:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 90 transitions. [2020-07-17 22:26:19,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,722 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2020-07-17 22:26:19,722 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2020-07-17 22:26:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,726 INFO L93 Difference]: Finished difference Result 54 states and 90 transitions. [2020-07-17 22:26:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 90 transitions. [2020-07-17 22:26:19,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:19,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-17 22:26:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2020-07-17 22:26:19,731 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2020-07-17 22:26:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:19,731 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2020-07-17 22:26:19,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:19,732 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2020-07-17 22:26:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:26:19,733 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:19,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:19,733 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:26:19,733 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:19,734 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2020-07-17 22:26:19,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:19,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496641168] [2020-07-17 22:26:19,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,784 INFO L280 TraceCheckUtils]: 0: Hoare triple {549#true} assume true; {549#true} is VALID [2020-07-17 22:26:19,785 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {549#true} {549#true} #146#return; {549#true} is VALID [2020-07-17 22:26:19,785 INFO L263 TraceCheckUtils]: 0: Hoare triple {549#true} call ULTIMATE.init(); {549#true} is VALID [2020-07-17 22:26:19,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {549#true} assume true; {549#true} is VALID [2020-07-17 22:26:19,786 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {549#true} {549#true} #146#return; {549#true} is VALID [2020-07-17 22:26:19,786 INFO L263 TraceCheckUtils]: 3: Hoare triple {549#true} call #t~ret8 := main(); {549#true} is VALID [2020-07-17 22:26:19,786 INFO L280 TraceCheckUtils]: 4: Hoare triple {549#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {549#true} is VALID [2020-07-17 22:26:19,786 INFO L280 TraceCheckUtils]: 5: Hoare triple {549#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {549#true} is VALID [2020-07-17 22:26:19,787 INFO L280 TraceCheckUtils]: 6: Hoare triple {549#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {549#true} is VALID [2020-07-17 22:26:19,788 INFO L280 TraceCheckUtils]: 7: Hoare triple {549#true} assume 0 != ~p1~0;~lk1~0 := 1; {553#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:19,788 INFO L280 TraceCheckUtils]: 8: Hoare triple {553#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {553#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:19,789 INFO L280 TraceCheckUtils]: 9: Hoare triple {553#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {553#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:19,790 INFO L280 TraceCheckUtils]: 10: Hoare triple {553#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {553#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:19,791 INFO L280 TraceCheckUtils]: 11: Hoare triple {553#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {553#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:19,791 INFO L280 TraceCheckUtils]: 12: Hoare triple {553#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {553#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:19,792 INFO L280 TraceCheckUtils]: 13: Hoare triple {553#(not (= 0 main_~p1~0))} assume 0 != ~p7~0;~lk7~0 := 1; {553#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:19,793 INFO L280 TraceCheckUtils]: 14: Hoare triple {553#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {550#false} is VALID [2020-07-17 22:26:19,793 INFO L280 TraceCheckUtils]: 15: Hoare triple {550#false} assume 0 != ~p2~0; {550#false} is VALID [2020-07-17 22:26:19,793 INFO L280 TraceCheckUtils]: 16: Hoare triple {550#false} assume 1 != ~lk2~0; {550#false} is VALID [2020-07-17 22:26:19,794 INFO L280 TraceCheckUtils]: 17: Hoare triple {550#false} assume !false; {550#false} is VALID [2020-07-17 22:26:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:19,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496641168] [2020-07-17 22:26:19,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:19,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:19,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321971357] [2020-07-17 22:26:19,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:19,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:19,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:19,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:19,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:19,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:19,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,819 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2020-07-17 22:26:19,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,931 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2020-07-17 22:26:19,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:19,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2020-07-17 22:26:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2020-07-17 22:26:19,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2020-07-17 22:26:20,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:20,095 INFO L225 Difference]: With dead ends: 81 [2020-07-17 22:26:20,095 INFO L226 Difference]: Without dead ends: 57 [2020-07-17 22:26:20,096 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-17 22:26:20,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2020-07-17 22:26:20,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:20,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2020-07-17 22:26:20,172 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2020-07-17 22:26:20,172 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2020-07-17 22:26:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,179 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2020-07-17 22:26:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2020-07-17 22:26:20,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,181 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2020-07-17 22:26:20,182 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2020-07-17 22:26:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,192 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2020-07-17 22:26:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2020-07-17 22:26:20,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:20,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 22:26:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2020-07-17 22:26:20,201 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2020-07-17 22:26:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:20,203 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2020-07-17 22:26:20,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2020-07-17 22:26:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:26:20,205 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:20,205 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:20,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:26:20,205 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:20,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:20,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2020-07-17 22:26:20,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:20,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654961414] [2020-07-17 22:26:20,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:20,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {825#true} assume true; {825#true} is VALID [2020-07-17 22:26:20,270 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {825#true} {825#true} #146#return; {825#true} is VALID [2020-07-17 22:26:20,271 INFO L263 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2020-07-17 22:26:20,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {825#true} assume true; {825#true} is VALID [2020-07-17 22:26:20,272 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {825#true} {825#true} #146#return; {825#true} is VALID [2020-07-17 22:26:20,272 INFO L263 TraceCheckUtils]: 3: Hoare triple {825#true} call #t~ret8 := main(); {825#true} is VALID [2020-07-17 22:26:20,272 INFO L280 TraceCheckUtils]: 4: Hoare triple {825#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {825#true} is VALID [2020-07-17 22:26:20,273 INFO L280 TraceCheckUtils]: 5: Hoare triple {825#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {825#true} is VALID [2020-07-17 22:26:20,273 INFO L280 TraceCheckUtils]: 6: Hoare triple {825#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {825#true} is VALID [2020-07-17 22:26:20,273 INFO L280 TraceCheckUtils]: 7: Hoare triple {825#true} assume !(0 != ~p1~0); {825#true} is VALID [2020-07-17 22:26:20,274 INFO L280 TraceCheckUtils]: 8: Hoare triple {825#true} assume 0 != ~p2~0;~lk2~0 := 1; {829#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:20,276 INFO L280 TraceCheckUtils]: 9: Hoare triple {829#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {829#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:20,277 INFO L280 TraceCheckUtils]: 10: Hoare triple {829#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {829#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:20,278 INFO L280 TraceCheckUtils]: 11: Hoare triple {829#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {829#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:20,279 INFO L280 TraceCheckUtils]: 12: Hoare triple {829#(= 1 main_~lk2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {829#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:20,280 INFO L280 TraceCheckUtils]: 13: Hoare triple {829#(= 1 main_~lk2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {829#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:20,281 INFO L280 TraceCheckUtils]: 14: Hoare triple {829#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {829#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:20,290 INFO L280 TraceCheckUtils]: 15: Hoare triple {829#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {829#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:20,291 INFO L280 TraceCheckUtils]: 16: Hoare triple {829#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {826#false} is VALID [2020-07-17 22:26:20,292 INFO L280 TraceCheckUtils]: 17: Hoare triple {826#false} assume !false; {826#false} is VALID [2020-07-17 22:26:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:20,292 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654961414] [2020-07-17 22:26:20,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:20,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:20,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124051102] [2020-07-17 22:26:20,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:20,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:20,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:20,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:20,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:20,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:20,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:20,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:20,316 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2020-07-17 22:26:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,434 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2020-07-17 22:26:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:20,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-17 22:26:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-17 22:26:20,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2020-07-17 22:26:20,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:20,564 INFO L225 Difference]: With dead ends: 100 [2020-07-17 22:26:20,565 INFO L226 Difference]: Without dead ends: 98 [2020-07-17 22:26:20,565 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:20,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-17 22:26:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2020-07-17 22:26:20,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:20,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 72 states. [2020-07-17 22:26:20,579 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 72 states. [2020-07-17 22:26:20,579 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 72 states. [2020-07-17 22:26:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,584 INFO L93 Difference]: Finished difference Result 98 states and 165 transitions. [2020-07-17 22:26:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 165 transitions. [2020-07-17 22:26:20,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,585 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 98 states. [2020-07-17 22:26:20,586 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 98 states. [2020-07-17 22:26:20,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,591 INFO L93 Difference]: Finished difference Result 98 states and 165 transitions. [2020-07-17 22:26:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 165 transitions. [2020-07-17 22:26:20,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:20,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-17 22:26:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2020-07-17 22:26:20,596 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2020-07-17 22:26:20,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:20,596 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2020-07-17 22:26:20,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2020-07-17 22:26:20,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:26:20,597 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:20,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:20,598 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:26:20,598 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2020-07-17 22:26:20,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:20,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855495658] [2020-07-17 22:26:20,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:20,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:26:20,657 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1220#true} {1220#true} #146#return; {1220#true} is VALID [2020-07-17 22:26:20,658 INFO L263 TraceCheckUtils]: 0: Hoare triple {1220#true} call ULTIMATE.init(); {1220#true} is VALID [2020-07-17 22:26:20,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:26:20,658 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1220#true} {1220#true} #146#return; {1220#true} is VALID [2020-07-17 22:26:20,659 INFO L263 TraceCheckUtils]: 3: Hoare triple {1220#true} call #t~ret8 := main(); {1220#true} is VALID [2020-07-17 22:26:20,659 INFO L280 TraceCheckUtils]: 4: Hoare triple {1220#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {1220#true} is VALID [2020-07-17 22:26:20,659 INFO L280 TraceCheckUtils]: 5: Hoare triple {1220#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {1220#true} is VALID [2020-07-17 22:26:20,659 INFO L280 TraceCheckUtils]: 6: Hoare triple {1220#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {1220#true} is VALID [2020-07-17 22:26:20,660 INFO L280 TraceCheckUtils]: 7: Hoare triple {1220#true} assume !(0 != ~p1~0); {1220#true} is VALID [2020-07-17 22:26:20,666 INFO L280 TraceCheckUtils]: 8: Hoare triple {1220#true} assume !(0 != ~p2~0); {1224#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:20,666 INFO L280 TraceCheckUtils]: 9: Hoare triple {1224#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1224#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:20,668 INFO L280 TraceCheckUtils]: 10: Hoare triple {1224#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1224#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:20,668 INFO L280 TraceCheckUtils]: 11: Hoare triple {1224#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1224#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:20,669 INFO L280 TraceCheckUtils]: 12: Hoare triple {1224#(= 0 main_~p2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1224#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:20,670 INFO L280 TraceCheckUtils]: 13: Hoare triple {1224#(= 0 main_~p2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1224#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:20,673 INFO L280 TraceCheckUtils]: 14: Hoare triple {1224#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1224#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:20,674 INFO L280 TraceCheckUtils]: 15: Hoare triple {1224#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1221#false} is VALID [2020-07-17 22:26:20,674 INFO L280 TraceCheckUtils]: 16: Hoare triple {1221#false} assume 1 != ~lk2~0; {1221#false} is VALID [2020-07-17 22:26:20,674 INFO L280 TraceCheckUtils]: 17: Hoare triple {1221#false} assume !false; {1221#false} is VALID [2020-07-17 22:26:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:20,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855495658] [2020-07-17 22:26:20,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:20,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:20,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250278499] [2020-07-17 22:26:20,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:20,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:20,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:20,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:20,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:20,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:20,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:20,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:20,698 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2020-07-17 22:26:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,812 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2020-07-17 22:26:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:20,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-17 22:26:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-17 22:26:20,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2020-07-17 22:26:20,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:20,962 INFO L225 Difference]: With dead ends: 164 [2020-07-17 22:26:20,963 INFO L226 Difference]: Without dead ends: 100 [2020-07-17 22:26:20,964 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-17 22:26:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2020-07-17 22:26:20,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:20,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 98 states. [2020-07-17 22:26:20,988 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 98 states. [2020-07-17 22:26:20,988 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 98 states. [2020-07-17 22:26:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,994 INFO L93 Difference]: Finished difference Result 100 states and 163 transitions. [2020-07-17 22:26:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 163 transitions. [2020-07-17 22:26:20,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,996 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 100 states. [2020-07-17 22:26:20,997 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 100 states. [2020-07-17 22:26:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,004 INFO L93 Difference]: Finished difference Result 100 states and 163 transitions. [2020-07-17 22:26:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 163 transitions. [2020-07-17 22:26:21,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:21,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:21,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:21,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-17 22:26:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2020-07-17 22:26:21,011 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2020-07-17 22:26:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:21,011 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2020-07-17 22:26:21,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2020-07-17 22:26:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:21,012 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:21,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:21,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:26:21,013 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:21,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2020-07-17 22:26:21,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:21,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717364219] [2020-07-17 22:26:21,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:21,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {1713#true} assume true; {1713#true} is VALID [2020-07-17 22:26:21,094 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1713#true} {1713#true} #146#return; {1713#true} is VALID [2020-07-17 22:26:21,094 INFO L263 TraceCheckUtils]: 0: Hoare triple {1713#true} call ULTIMATE.init(); {1713#true} is VALID [2020-07-17 22:26:21,095 INFO L280 TraceCheckUtils]: 1: Hoare triple {1713#true} assume true; {1713#true} is VALID [2020-07-17 22:26:21,095 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1713#true} {1713#true} #146#return; {1713#true} is VALID [2020-07-17 22:26:21,095 INFO L263 TraceCheckUtils]: 3: Hoare triple {1713#true} call #t~ret8 := main(); {1713#true} is VALID [2020-07-17 22:26:21,095 INFO L280 TraceCheckUtils]: 4: Hoare triple {1713#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {1713#true} is VALID [2020-07-17 22:26:21,096 INFO L280 TraceCheckUtils]: 5: Hoare triple {1713#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {1713#true} is VALID [2020-07-17 22:26:21,096 INFO L280 TraceCheckUtils]: 6: Hoare triple {1713#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {1713#true} is VALID [2020-07-17 22:26:21,096 INFO L280 TraceCheckUtils]: 7: Hoare triple {1713#true} assume !(0 != ~p1~0); {1713#true} is VALID [2020-07-17 22:26:21,097 INFO L280 TraceCheckUtils]: 8: Hoare triple {1713#true} assume 0 != ~p2~0;~lk2~0 := 1; {1717#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:21,097 INFO L280 TraceCheckUtils]: 9: Hoare triple {1717#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {1717#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:21,098 INFO L280 TraceCheckUtils]: 10: Hoare triple {1717#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {1717#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:21,099 INFO L280 TraceCheckUtils]: 11: Hoare triple {1717#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {1717#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:21,099 INFO L280 TraceCheckUtils]: 12: Hoare triple {1717#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {1717#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:21,100 INFO L280 TraceCheckUtils]: 13: Hoare triple {1717#(not (= 0 main_~p2~0))} assume 0 != ~p7~0;~lk7~0 := 1; {1717#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:21,101 INFO L280 TraceCheckUtils]: 14: Hoare triple {1717#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {1717#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:21,101 INFO L280 TraceCheckUtils]: 15: Hoare triple {1717#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {1714#false} is VALID [2020-07-17 22:26:21,102 INFO L280 TraceCheckUtils]: 16: Hoare triple {1714#false} assume 0 != ~p3~0; {1714#false} is VALID [2020-07-17 22:26:21,102 INFO L280 TraceCheckUtils]: 17: Hoare triple {1714#false} assume 1 != ~lk3~0; {1714#false} is VALID [2020-07-17 22:26:21,102 INFO L280 TraceCheckUtils]: 18: Hoare triple {1714#false} assume !false; {1714#false} is VALID [2020-07-17 22:26:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:21,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717364219] [2020-07-17 22:26:21,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:21,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:21,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980643736] [2020-07-17 22:26:21,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:21,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:21,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:21,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:21,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:21,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:21,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:21,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:21,134 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2020-07-17 22:26:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,243 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2020-07-17 22:26:21,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:21,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:21,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2020-07-17 22:26:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2020-07-17 22:26:21,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2020-07-17 22:26:21,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:21,412 INFO L225 Difference]: With dead ends: 147 [2020-07-17 22:26:21,413 INFO L226 Difference]: Without dead ends: 102 [2020-07-17 22:26:21,413 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-17 22:26:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2020-07-17 22:26:21,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:21,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 100 states. [2020-07-17 22:26:21,430 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 100 states. [2020-07-17 22:26:21,430 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 100 states. [2020-07-17 22:26:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,434 INFO L93 Difference]: Finished difference Result 102 states and 163 transitions. [2020-07-17 22:26:21,434 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 163 transitions. [2020-07-17 22:26:21,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:21,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:21,435 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 102 states. [2020-07-17 22:26:21,435 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 102 states. [2020-07-17 22:26:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,439 INFO L93 Difference]: Finished difference Result 102 states and 163 transitions. [2020-07-17 22:26:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 163 transitions. [2020-07-17 22:26:21,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:21,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:21,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:21,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-17 22:26:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2020-07-17 22:26:21,445 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2020-07-17 22:26:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:21,445 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2020-07-17 22:26:21,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:21,445 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2020-07-17 22:26:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:21,446 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:21,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:21,446 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:26:21,446 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2020-07-17 22:26:21,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:21,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40701072] [2020-07-17 22:26:21,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:21,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {2195#true} assume true; {2195#true} is VALID [2020-07-17 22:26:21,478 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2195#true} {2195#true} #146#return; {2195#true} is VALID [2020-07-17 22:26:21,479 INFO L263 TraceCheckUtils]: 0: Hoare triple {2195#true} call ULTIMATE.init(); {2195#true} is VALID [2020-07-17 22:26:21,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {2195#true} assume true; {2195#true} is VALID [2020-07-17 22:26:21,479 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2195#true} {2195#true} #146#return; {2195#true} is VALID [2020-07-17 22:26:21,479 INFO L263 TraceCheckUtils]: 3: Hoare triple {2195#true} call #t~ret8 := main(); {2195#true} is VALID [2020-07-17 22:26:21,480 INFO L280 TraceCheckUtils]: 4: Hoare triple {2195#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {2195#true} is VALID [2020-07-17 22:26:21,480 INFO L280 TraceCheckUtils]: 5: Hoare triple {2195#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {2195#true} is VALID [2020-07-17 22:26:21,480 INFO L280 TraceCheckUtils]: 6: Hoare triple {2195#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {2195#true} is VALID [2020-07-17 22:26:21,480 INFO L280 TraceCheckUtils]: 7: Hoare triple {2195#true} assume !(0 != ~p1~0); {2195#true} is VALID [2020-07-17 22:26:21,481 INFO L280 TraceCheckUtils]: 8: Hoare triple {2195#true} assume !(0 != ~p2~0); {2195#true} is VALID [2020-07-17 22:26:21,482 INFO L280 TraceCheckUtils]: 9: Hoare triple {2195#true} assume 0 != ~p3~0;~lk3~0 := 1; {2199#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:21,482 INFO L280 TraceCheckUtils]: 10: Hoare triple {2199#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {2199#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:21,483 INFO L280 TraceCheckUtils]: 11: Hoare triple {2199#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {2199#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:21,483 INFO L280 TraceCheckUtils]: 12: Hoare triple {2199#(= 1 main_~lk3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {2199#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:21,484 INFO L280 TraceCheckUtils]: 13: Hoare triple {2199#(= 1 main_~lk3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {2199#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:21,485 INFO L280 TraceCheckUtils]: 14: Hoare triple {2199#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {2199#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:21,485 INFO L280 TraceCheckUtils]: 15: Hoare triple {2199#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {2199#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:21,486 INFO L280 TraceCheckUtils]: 16: Hoare triple {2199#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {2199#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:21,486 INFO L280 TraceCheckUtils]: 17: Hoare triple {2199#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {2196#false} is VALID [2020-07-17 22:26:21,487 INFO L280 TraceCheckUtils]: 18: Hoare triple {2196#false} assume !false; {2196#false} is VALID [2020-07-17 22:26:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:21,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40701072] [2020-07-17 22:26:21,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:21,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:21,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817812289] [2020-07-17 22:26:21,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:21,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:21,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:21,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:21,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:21,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:21,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:21,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:21,511 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2020-07-17 22:26:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,638 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2020-07-17 22:26:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:21,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2020-07-17 22:26:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2020-07-17 22:26:21,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2020-07-17 22:26:21,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:21,732 INFO L225 Difference]: With dead ends: 180 [2020-07-17 22:26:21,732 INFO L226 Difference]: Without dead ends: 178 [2020-07-17 22:26:21,732 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-07-17 22:26:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2020-07-17 22:26:21,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:21,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 136 states. [2020-07-17 22:26:21,756 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 136 states. [2020-07-17 22:26:21,756 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 136 states. [2020-07-17 22:26:21,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,763 INFO L93 Difference]: Finished difference Result 178 states and 291 transitions. [2020-07-17 22:26:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 291 transitions. [2020-07-17 22:26:21,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:21,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:21,764 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 178 states. [2020-07-17 22:26:21,764 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 178 states. [2020-07-17 22:26:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,771 INFO L93 Difference]: Finished difference Result 178 states and 291 transitions. [2020-07-17 22:26:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 291 transitions. [2020-07-17 22:26:21,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:21,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:21,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:21,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-17 22:26:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2020-07-17 22:26:21,777 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2020-07-17 22:26:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:21,778 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2020-07-17 22:26:21,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2020-07-17 22:26:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:21,778 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:21,779 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:21,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:26:21,779 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:21,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:21,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2020-07-17 22:26:21,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:21,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790498644] [2020-07-17 22:26:21,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:21,813 INFO L280 TraceCheckUtils]: 0: Hoare triple {2900#true} assume true; {2900#true} is VALID [2020-07-17 22:26:21,814 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2900#true} {2900#true} #146#return; {2900#true} is VALID [2020-07-17 22:26:21,814 INFO L263 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2900#true} is VALID [2020-07-17 22:26:21,814 INFO L280 TraceCheckUtils]: 1: Hoare triple {2900#true} assume true; {2900#true} is VALID [2020-07-17 22:26:21,814 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2900#true} {2900#true} #146#return; {2900#true} is VALID [2020-07-17 22:26:21,815 INFO L263 TraceCheckUtils]: 3: Hoare triple {2900#true} call #t~ret8 := main(); {2900#true} is VALID [2020-07-17 22:26:21,815 INFO L280 TraceCheckUtils]: 4: Hoare triple {2900#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {2900#true} is VALID [2020-07-17 22:26:21,815 INFO L280 TraceCheckUtils]: 5: Hoare triple {2900#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {2900#true} is VALID [2020-07-17 22:26:21,815 INFO L280 TraceCheckUtils]: 6: Hoare triple {2900#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {2900#true} is VALID [2020-07-17 22:26:21,816 INFO L280 TraceCheckUtils]: 7: Hoare triple {2900#true} assume !(0 != ~p1~0); {2900#true} is VALID [2020-07-17 22:26:21,816 INFO L280 TraceCheckUtils]: 8: Hoare triple {2900#true} assume !(0 != ~p2~0); {2900#true} is VALID [2020-07-17 22:26:21,816 INFO L280 TraceCheckUtils]: 9: Hoare triple {2900#true} assume !(0 != ~p3~0); {2904#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:21,817 INFO L280 TraceCheckUtils]: 10: Hoare triple {2904#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {2904#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:21,817 INFO L280 TraceCheckUtils]: 11: Hoare triple {2904#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {2904#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:21,818 INFO L280 TraceCheckUtils]: 12: Hoare triple {2904#(= 0 main_~p3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {2904#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:21,818 INFO L280 TraceCheckUtils]: 13: Hoare triple {2904#(= 0 main_~p3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {2904#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:21,819 INFO L280 TraceCheckUtils]: 14: Hoare triple {2904#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {2904#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:21,820 INFO L280 TraceCheckUtils]: 15: Hoare triple {2904#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {2904#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:21,820 INFO L280 TraceCheckUtils]: 16: Hoare triple {2904#(= 0 main_~p3~0)} assume 0 != ~p3~0; {2901#false} is VALID [2020-07-17 22:26:21,820 INFO L280 TraceCheckUtils]: 17: Hoare triple {2901#false} assume 1 != ~lk3~0; {2901#false} is VALID [2020-07-17 22:26:21,821 INFO L280 TraceCheckUtils]: 18: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2020-07-17 22:26:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:21,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790498644] [2020-07-17 22:26:21,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:21,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:21,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264884899] [2020-07-17 22:26:21,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:21,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:21,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:21,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:21,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:21,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:21,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:21,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:21,849 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2020-07-17 22:26:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,969 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2020-07-17 22:26:21,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:21,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2020-07-17 22:26:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2020-07-17 22:26:21,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 131 transitions. [2020-07-17 22:26:22,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:22,132 INFO L225 Difference]: With dead ends: 312 [2020-07-17 22:26:22,132 INFO L226 Difference]: Without dead ends: 186 [2020-07-17 22:26:22,133 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:22,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-07-17 22:26:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2020-07-17 22:26:22,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:22,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 184 states. [2020-07-17 22:26:22,172 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 184 states. [2020-07-17 22:26:22,173 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 184 states. [2020-07-17 22:26:22,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,179 INFO L93 Difference]: Finished difference Result 186 states and 291 transitions. [2020-07-17 22:26:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2020-07-17 22:26:22,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:22,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:22,180 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 186 states. [2020-07-17 22:26:22,181 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 186 states. [2020-07-17 22:26:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,187 INFO L93 Difference]: Finished difference Result 186 states and 291 transitions. [2020-07-17 22:26:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2020-07-17 22:26:22,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:22,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:22,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:22,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-07-17 22:26:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2020-07-17 22:26:22,194 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2020-07-17 22:26:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:22,194 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2020-07-17 22:26:22,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2020-07-17 22:26:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:22,195 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:22,196 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] [2020-07-17 22:26:22,196 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:26:22,196 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:22,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:22,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2020-07-17 22:26:22,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:22,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953242425] [2020-07-17 22:26:22,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {3809#true} assume true; {3809#true} is VALID [2020-07-17 22:26:22,227 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3809#true} {3809#true} #146#return; {3809#true} is VALID [2020-07-17 22:26:22,228 INFO L263 TraceCheckUtils]: 0: Hoare triple {3809#true} call ULTIMATE.init(); {3809#true} is VALID [2020-07-17 22:26:22,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {3809#true} assume true; {3809#true} is VALID [2020-07-17 22:26:22,228 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3809#true} {3809#true} #146#return; {3809#true} is VALID [2020-07-17 22:26:22,228 INFO L263 TraceCheckUtils]: 3: Hoare triple {3809#true} call #t~ret8 := main(); {3809#true} is VALID [2020-07-17 22:26:22,228 INFO L280 TraceCheckUtils]: 4: Hoare triple {3809#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {3809#true} is VALID [2020-07-17 22:26:22,229 INFO L280 TraceCheckUtils]: 5: Hoare triple {3809#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {3809#true} is VALID [2020-07-17 22:26:22,229 INFO L280 TraceCheckUtils]: 6: Hoare triple {3809#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {3809#true} is VALID [2020-07-17 22:26:22,229 INFO L280 TraceCheckUtils]: 7: Hoare triple {3809#true} assume !(0 != ~p1~0); {3809#true} is VALID [2020-07-17 22:26:22,229 INFO L280 TraceCheckUtils]: 8: Hoare triple {3809#true} assume !(0 != ~p2~0); {3809#true} is VALID [2020-07-17 22:26:22,230 INFO L280 TraceCheckUtils]: 9: Hoare triple {3809#true} assume 0 != ~p3~0;~lk3~0 := 1; {3813#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:22,231 INFO L280 TraceCheckUtils]: 10: Hoare triple {3813#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {3813#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:22,231 INFO L280 TraceCheckUtils]: 11: Hoare triple {3813#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {3813#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:22,232 INFO L280 TraceCheckUtils]: 12: Hoare triple {3813#(not (= 0 main_~p3~0))} assume 0 != ~p6~0;~lk6~0 := 1; {3813#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:22,232 INFO L280 TraceCheckUtils]: 13: Hoare triple {3813#(not (= 0 main_~p3~0))} assume 0 != ~p7~0;~lk7~0 := 1; {3813#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:22,233 INFO L280 TraceCheckUtils]: 14: Hoare triple {3813#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {3813#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:22,234 INFO L280 TraceCheckUtils]: 15: Hoare triple {3813#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {3813#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:22,234 INFO L280 TraceCheckUtils]: 16: Hoare triple {3813#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {3810#false} is VALID [2020-07-17 22:26:22,234 INFO L280 TraceCheckUtils]: 17: Hoare triple {3810#false} assume 0 != ~p4~0; {3810#false} is VALID [2020-07-17 22:26:22,235 INFO L280 TraceCheckUtils]: 18: Hoare triple {3810#false} assume 1 != ~lk4~0; {3810#false} is VALID [2020-07-17 22:26:22,235 INFO L280 TraceCheckUtils]: 19: Hoare triple {3810#false} assume !false; {3810#false} is VALID [2020-07-17 22:26:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:22,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953242425] [2020-07-17 22:26:22,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:22,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:22,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390728689] [2020-07-17 22:26:22,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:22,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:22,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:22,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:22,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:22,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:22,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:22,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:22,258 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2020-07-17 22:26:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,407 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2020-07-17 22:26:22,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:22,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-17 22:26:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-17 22:26:22,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-17 22:26:22,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:22,546 INFO L225 Difference]: With dead ends: 276 [2020-07-17 22:26:22,546 INFO L226 Difference]: Without dead ends: 190 [2020-07-17 22:26:22,547 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-07-17 22:26:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2020-07-17 22:26:22,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:22,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 188 states. [2020-07-17 22:26:22,580 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 188 states. [2020-07-17 22:26:22,580 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 188 states. [2020-07-17 22:26:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,586 INFO L93 Difference]: Finished difference Result 190 states and 291 transitions. [2020-07-17 22:26:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 291 transitions. [2020-07-17 22:26:22,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:22,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:22,587 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 190 states. [2020-07-17 22:26:22,587 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 190 states. [2020-07-17 22:26:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,595 INFO L93 Difference]: Finished difference Result 190 states and 291 transitions. [2020-07-17 22:26:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 291 transitions. [2020-07-17 22:26:22,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:22,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:22,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:22,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-07-17 22:26:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2020-07-17 22:26:22,601 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2020-07-17 22:26:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:22,601 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2020-07-17 22:26:22,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2020-07-17 22:26:22,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:22,602 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:22,603 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] [2020-07-17 22:26:22,603 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 22:26:22,603 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:22,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2020-07-17 22:26:22,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:22,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328760198] [2020-07-17 22:26:22,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,631 INFO L280 TraceCheckUtils]: 0: Hoare triple {4694#true} assume true; {4694#true} is VALID [2020-07-17 22:26:22,631 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4694#true} {4694#true} #146#return; {4694#true} is VALID [2020-07-17 22:26:22,631 INFO L263 TraceCheckUtils]: 0: Hoare triple {4694#true} call ULTIMATE.init(); {4694#true} is VALID [2020-07-17 22:26:22,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {4694#true} assume true; {4694#true} is VALID [2020-07-17 22:26:22,632 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4694#true} {4694#true} #146#return; {4694#true} is VALID [2020-07-17 22:26:22,632 INFO L263 TraceCheckUtils]: 3: Hoare triple {4694#true} call #t~ret8 := main(); {4694#true} is VALID [2020-07-17 22:26:22,632 INFO L280 TraceCheckUtils]: 4: Hoare triple {4694#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {4694#true} is VALID [2020-07-17 22:26:22,633 INFO L280 TraceCheckUtils]: 5: Hoare triple {4694#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {4694#true} is VALID [2020-07-17 22:26:22,633 INFO L280 TraceCheckUtils]: 6: Hoare triple {4694#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {4694#true} is VALID [2020-07-17 22:26:22,633 INFO L280 TraceCheckUtils]: 7: Hoare triple {4694#true} assume !(0 != ~p1~0); {4694#true} is VALID [2020-07-17 22:26:22,633 INFO L280 TraceCheckUtils]: 8: Hoare triple {4694#true} assume !(0 != ~p2~0); {4694#true} is VALID [2020-07-17 22:26:22,633 INFO L280 TraceCheckUtils]: 9: Hoare triple {4694#true} assume !(0 != ~p3~0); {4694#true} is VALID [2020-07-17 22:26:22,634 INFO L280 TraceCheckUtils]: 10: Hoare triple {4694#true} assume 0 != ~p4~0;~lk4~0 := 1; {4698#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:22,635 INFO L280 TraceCheckUtils]: 11: Hoare triple {4698#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {4698#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:22,635 INFO L280 TraceCheckUtils]: 12: Hoare triple {4698#(= 1 main_~lk4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {4698#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:22,636 INFO L280 TraceCheckUtils]: 13: Hoare triple {4698#(= 1 main_~lk4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {4698#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:22,637 INFO L280 TraceCheckUtils]: 14: Hoare triple {4698#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {4698#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:22,638 INFO L280 TraceCheckUtils]: 15: Hoare triple {4698#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {4698#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:22,639 INFO L280 TraceCheckUtils]: 16: Hoare triple {4698#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {4698#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:22,639 INFO L280 TraceCheckUtils]: 17: Hoare triple {4698#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {4698#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:22,640 INFO L280 TraceCheckUtils]: 18: Hoare triple {4698#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {4695#false} is VALID [2020-07-17 22:26:22,640 INFO L280 TraceCheckUtils]: 19: Hoare triple {4695#false} assume !false; {4695#false} is VALID [2020-07-17 22:26:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:22,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328760198] [2020-07-17 22:26:22,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:22,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:22,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362641745] [2020-07-17 22:26:22,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:22,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:22,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:22,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:22,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:22,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:22,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:22,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:22,664 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2020-07-17 22:26:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,794 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2020-07-17 22:26:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:22,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-17 22:26:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-17 22:26:22,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2020-07-17 22:26:22,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:22,887 INFO L225 Difference]: With dead ends: 332 [2020-07-17 22:26:22,888 INFO L226 Difference]: Without dead ends: 330 [2020-07-17 22:26:22,888 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-07-17 22:26:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2020-07-17 22:26:22,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:22,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand 264 states. [2020-07-17 22:26:22,931 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand 264 states. [2020-07-17 22:26:22,931 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 264 states. [2020-07-17 22:26:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,942 INFO L93 Difference]: Finished difference Result 330 states and 511 transitions. [2020-07-17 22:26:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 511 transitions. [2020-07-17 22:26:22,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:22,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:22,943 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand 330 states. [2020-07-17 22:26:22,943 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 330 states. [2020-07-17 22:26:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,954 INFO L93 Difference]: Finished difference Result 330 states and 511 transitions. [2020-07-17 22:26:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 511 transitions. [2020-07-17 22:26:22,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:22,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:22,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:22,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2020-07-17 22:26:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2020-07-17 22:26:22,963 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2020-07-17 22:26:22,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:22,964 INFO L479 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2020-07-17 22:26:22,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2020-07-17 22:26:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:22,965 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:22,965 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] [2020-07-17 22:26:22,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 22:26:22,966 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:22,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:22,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2020-07-17 22:26:22,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:22,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94261880] [2020-07-17 22:26:22,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,996 INFO L280 TraceCheckUtils]: 0: Hoare triple {5995#true} assume true; {5995#true} is VALID [2020-07-17 22:26:22,996 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5995#true} {5995#true} #146#return; {5995#true} is VALID [2020-07-17 22:26:22,996 INFO L263 TraceCheckUtils]: 0: Hoare triple {5995#true} call ULTIMATE.init(); {5995#true} is VALID [2020-07-17 22:26:22,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {5995#true} assume true; {5995#true} is VALID [2020-07-17 22:26:22,997 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5995#true} {5995#true} #146#return; {5995#true} is VALID [2020-07-17 22:26:22,998 INFO L263 TraceCheckUtils]: 3: Hoare triple {5995#true} call #t~ret8 := main(); {5995#true} is VALID [2020-07-17 22:26:22,998 INFO L280 TraceCheckUtils]: 4: Hoare triple {5995#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {5995#true} is VALID [2020-07-17 22:26:22,998 INFO L280 TraceCheckUtils]: 5: Hoare triple {5995#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {5995#true} is VALID [2020-07-17 22:26:22,999 INFO L280 TraceCheckUtils]: 6: Hoare triple {5995#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {5995#true} is VALID [2020-07-17 22:26:22,999 INFO L280 TraceCheckUtils]: 7: Hoare triple {5995#true} assume !(0 != ~p1~0); {5995#true} is VALID [2020-07-17 22:26:23,000 INFO L280 TraceCheckUtils]: 8: Hoare triple {5995#true} assume !(0 != ~p2~0); {5995#true} is VALID [2020-07-17 22:26:23,000 INFO L280 TraceCheckUtils]: 9: Hoare triple {5995#true} assume !(0 != ~p3~0); {5995#true} is VALID [2020-07-17 22:26:23,002 INFO L280 TraceCheckUtils]: 10: Hoare triple {5995#true} assume !(0 != ~p4~0); {5999#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:23,003 INFO L280 TraceCheckUtils]: 11: Hoare triple {5999#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {5999#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:23,004 INFO L280 TraceCheckUtils]: 12: Hoare triple {5999#(= 0 main_~p4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {5999#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:23,004 INFO L280 TraceCheckUtils]: 13: Hoare triple {5999#(= 0 main_~p4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {5999#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:23,005 INFO L280 TraceCheckUtils]: 14: Hoare triple {5999#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {5999#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:23,006 INFO L280 TraceCheckUtils]: 15: Hoare triple {5999#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {5999#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:23,006 INFO L280 TraceCheckUtils]: 16: Hoare triple {5999#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {5999#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:23,008 INFO L280 TraceCheckUtils]: 17: Hoare triple {5999#(= 0 main_~p4~0)} assume 0 != ~p4~0; {5996#false} is VALID [2020-07-17 22:26:23,008 INFO L280 TraceCheckUtils]: 18: Hoare triple {5996#false} assume 1 != ~lk4~0; {5996#false} is VALID [2020-07-17 22:26:23,008 INFO L280 TraceCheckUtils]: 19: Hoare triple {5996#false} assume !false; {5996#false} is VALID [2020-07-17 22:26:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:23,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94261880] [2020-07-17 22:26:23,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:23,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:23,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789446874] [2020-07-17 22:26:23,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:23,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:23,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:23,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:23,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:23,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:23,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:23,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:23,047 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2020-07-17 22:26:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:23,247 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2020-07-17 22:26:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:23,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2020-07-17 22:26:23,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2020-07-17 22:26:23,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2020-07-17 22:26:23,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:23,389 INFO L225 Difference]: With dead ends: 604 [2020-07-17 22:26:23,389 INFO L226 Difference]: Without dead ends: 354 [2020-07-17 22:26:23,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:23,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-07-17 22:26:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2020-07-17 22:26:23,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:23,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 354 states. Second operand 352 states. [2020-07-17 22:26:23,453 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand 352 states. [2020-07-17 22:26:23,453 INFO L87 Difference]: Start difference. First operand 354 states. Second operand 352 states. [2020-07-17 22:26:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:23,467 INFO L93 Difference]: Finished difference Result 354 states and 519 transitions. [2020-07-17 22:26:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 519 transitions. [2020-07-17 22:26:23,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:23,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:23,468 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand 354 states. [2020-07-17 22:26:23,468 INFO L87 Difference]: Start difference. First operand 352 states. Second operand 354 states. [2020-07-17 22:26:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:23,479 INFO L93 Difference]: Finished difference Result 354 states and 519 transitions. [2020-07-17 22:26:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 519 transitions. [2020-07-17 22:26:23,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:23,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:23,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:23,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-07-17 22:26:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2020-07-17 22:26:23,490 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2020-07-17 22:26:23,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:23,490 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2020-07-17 22:26:23,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2020-07-17 22:26:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:23,493 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:23,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:23,493 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 22:26:23,493 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:23,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:23,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2020-07-17 22:26:23,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:23,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273344067] [2020-07-17 22:26:23,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:23,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {7720#true} assume true; {7720#true} is VALID [2020-07-17 22:26:23,548 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7720#true} {7720#true} #146#return; {7720#true} is VALID [2020-07-17 22:26:23,548 INFO L263 TraceCheckUtils]: 0: Hoare triple {7720#true} call ULTIMATE.init(); {7720#true} is VALID [2020-07-17 22:26:23,548 INFO L280 TraceCheckUtils]: 1: Hoare triple {7720#true} assume true; {7720#true} is VALID [2020-07-17 22:26:23,548 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7720#true} {7720#true} #146#return; {7720#true} is VALID [2020-07-17 22:26:23,549 INFO L263 TraceCheckUtils]: 3: Hoare triple {7720#true} call #t~ret8 := main(); {7720#true} is VALID [2020-07-17 22:26:23,549 INFO L280 TraceCheckUtils]: 4: Hoare triple {7720#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {7720#true} is VALID [2020-07-17 22:26:23,549 INFO L280 TraceCheckUtils]: 5: Hoare triple {7720#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {7720#true} is VALID [2020-07-17 22:26:23,549 INFO L280 TraceCheckUtils]: 6: Hoare triple {7720#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {7720#true} is VALID [2020-07-17 22:26:23,550 INFO L280 TraceCheckUtils]: 7: Hoare triple {7720#true} assume !(0 != ~p1~0); {7720#true} is VALID [2020-07-17 22:26:23,550 INFO L280 TraceCheckUtils]: 8: Hoare triple {7720#true} assume !(0 != ~p2~0); {7720#true} is VALID [2020-07-17 22:26:23,550 INFO L280 TraceCheckUtils]: 9: Hoare triple {7720#true} assume !(0 != ~p3~0); {7720#true} is VALID [2020-07-17 22:26:23,551 INFO L280 TraceCheckUtils]: 10: Hoare triple {7720#true} assume 0 != ~p4~0;~lk4~0 := 1; {7724#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:23,552 INFO L280 TraceCheckUtils]: 11: Hoare triple {7724#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {7724#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:23,552 INFO L280 TraceCheckUtils]: 12: Hoare triple {7724#(not (= 0 main_~p4~0))} assume 0 != ~p6~0;~lk6~0 := 1; {7724#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:23,553 INFO L280 TraceCheckUtils]: 13: Hoare triple {7724#(not (= 0 main_~p4~0))} assume 0 != ~p7~0;~lk7~0 := 1; {7724#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:23,553 INFO L280 TraceCheckUtils]: 14: Hoare triple {7724#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {7724#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:23,554 INFO L280 TraceCheckUtils]: 15: Hoare triple {7724#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {7724#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:23,555 INFO L280 TraceCheckUtils]: 16: Hoare triple {7724#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {7724#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:23,555 INFO L280 TraceCheckUtils]: 17: Hoare triple {7724#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {7721#false} is VALID [2020-07-17 22:26:23,556 INFO L280 TraceCheckUtils]: 18: Hoare triple {7721#false} assume 0 != ~p5~0; {7721#false} is VALID [2020-07-17 22:26:23,556 INFO L280 TraceCheckUtils]: 19: Hoare triple {7721#false} assume 1 != ~lk5~0; {7721#false} is VALID [2020-07-17 22:26:23,556 INFO L280 TraceCheckUtils]: 20: Hoare triple {7721#false} assume !false; {7721#false} is VALID [2020-07-17 22:26:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:23,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273344067] [2020-07-17 22:26:23,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:23,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:23,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232631936] [2020-07-17 22:26:23,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:23,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:23,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:23,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:23,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:23,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:23,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:23,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:23,584 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2020-07-17 22:26:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:23,741 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2020-07-17 22:26:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:23,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2020-07-17 22:26:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2020-07-17 22:26:23,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2020-07-17 22:26:23,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:23,880 INFO L225 Difference]: With dead ends: 528 [2020-07-17 22:26:23,880 INFO L226 Difference]: Without dead ends: 362 [2020-07-17 22:26:23,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-07-17 22:26:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2020-07-17 22:26:23,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:23,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand 360 states. [2020-07-17 22:26:23,952 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand 360 states. [2020-07-17 22:26:23,952 INFO L87 Difference]: Start difference. First operand 362 states. Second operand 360 states. [2020-07-17 22:26:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:23,963 INFO L93 Difference]: Finished difference Result 362 states and 519 transitions. [2020-07-17 22:26:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 519 transitions. [2020-07-17 22:26:23,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:23,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:23,965 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand 362 states. [2020-07-17 22:26:23,965 INFO L87 Difference]: Start difference. First operand 360 states. Second operand 362 states. [2020-07-17 22:26:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:23,976 INFO L93 Difference]: Finished difference Result 362 states and 519 transitions. [2020-07-17 22:26:23,976 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 519 transitions. [2020-07-17 22:26:23,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:23,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:23,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:23,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-07-17 22:26:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2020-07-17 22:26:23,990 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2020-07-17 22:26:23,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:23,990 INFO L479 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2020-07-17 22:26:23,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2020-07-17 22:26:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:23,993 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:23,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:23,994 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 22:26:23,994 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:23,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:23,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2020-07-17 22:26:23,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:23,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708828274] [2020-07-17 22:26:23,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:24,041 INFO L280 TraceCheckUtils]: 0: Hoare triple {9393#true} assume true; {9393#true} is VALID [2020-07-17 22:26:24,042 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9393#true} {9393#true} #146#return; {9393#true} is VALID [2020-07-17 22:26:24,042 INFO L263 TraceCheckUtils]: 0: Hoare triple {9393#true} call ULTIMATE.init(); {9393#true} is VALID [2020-07-17 22:26:24,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {9393#true} assume true; {9393#true} is VALID [2020-07-17 22:26:24,044 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9393#true} {9393#true} #146#return; {9393#true} is VALID [2020-07-17 22:26:24,044 INFO L263 TraceCheckUtils]: 3: Hoare triple {9393#true} call #t~ret8 := main(); {9393#true} is VALID [2020-07-17 22:26:24,044 INFO L280 TraceCheckUtils]: 4: Hoare triple {9393#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {9393#true} is VALID [2020-07-17 22:26:24,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {9393#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {9393#true} is VALID [2020-07-17 22:26:24,044 INFO L280 TraceCheckUtils]: 6: Hoare triple {9393#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {9393#true} is VALID [2020-07-17 22:26:24,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {9393#true} assume !(0 != ~p1~0); {9393#true} is VALID [2020-07-17 22:26:24,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {9393#true} assume !(0 != ~p2~0); {9393#true} is VALID [2020-07-17 22:26:24,045 INFO L280 TraceCheckUtils]: 9: Hoare triple {9393#true} assume !(0 != ~p3~0); {9393#true} is VALID [2020-07-17 22:26:24,050 INFO L280 TraceCheckUtils]: 10: Hoare triple {9393#true} assume !(0 != ~p4~0); {9393#true} is VALID [2020-07-17 22:26:24,053 INFO L280 TraceCheckUtils]: 11: Hoare triple {9393#true} assume 0 != ~p5~0;~lk5~0 := 1; {9397#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:24,054 INFO L280 TraceCheckUtils]: 12: Hoare triple {9397#(= 1 main_~lk5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {9397#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:24,055 INFO L280 TraceCheckUtils]: 13: Hoare triple {9397#(= 1 main_~lk5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {9397#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:24,056 INFO L280 TraceCheckUtils]: 14: Hoare triple {9397#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {9397#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:24,057 INFO L280 TraceCheckUtils]: 15: Hoare triple {9397#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {9397#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:24,057 INFO L280 TraceCheckUtils]: 16: Hoare triple {9397#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {9397#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:24,058 INFO L280 TraceCheckUtils]: 17: Hoare triple {9397#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {9397#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:24,058 INFO L280 TraceCheckUtils]: 18: Hoare triple {9397#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {9397#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:24,059 INFO L280 TraceCheckUtils]: 19: Hoare triple {9397#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {9394#false} is VALID [2020-07-17 22:26:24,059 INFO L280 TraceCheckUtils]: 20: Hoare triple {9394#false} assume !false; {9394#false} is VALID [2020-07-17 22:26:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:24,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708828274] [2020-07-17 22:26:24,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:24,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:24,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829668637] [2020-07-17 22:26:24,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:24,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:24,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:24,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:24,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:24,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:24,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:24,082 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2020-07-17 22:26:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:24,330 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2020-07-17 22:26:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:24,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:24,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2020-07-17 22:26:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2020-07-17 22:26:24,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2020-07-17 22:26:24,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:24,437 INFO L225 Difference]: With dead ends: 620 [2020-07-17 22:26:24,438 INFO L226 Difference]: Without dead ends: 618 [2020-07-17 22:26:24,438 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:24,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-07-17 22:26:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2020-07-17 22:26:24,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:24,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 618 states. Second operand 520 states. [2020-07-17 22:26:24,522 INFO L74 IsIncluded]: Start isIncluded. First operand 618 states. Second operand 520 states. [2020-07-17 22:26:24,522 INFO L87 Difference]: Start difference. First operand 618 states. Second operand 520 states. [2020-07-17 22:26:24,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:24,546 INFO L93 Difference]: Finished difference Result 618 states and 887 transitions. [2020-07-17 22:26:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 887 transitions. [2020-07-17 22:26:24,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:24,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:24,548 INFO L74 IsIncluded]: Start isIncluded. First operand 520 states. Second operand 618 states. [2020-07-17 22:26:24,548 INFO L87 Difference]: Start difference. First operand 520 states. Second operand 618 states. [2020-07-17 22:26:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:24,573 INFO L93 Difference]: Finished difference Result 618 states and 887 transitions. [2020-07-17 22:26:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 887 transitions. [2020-07-17 22:26:24,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:24,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:24,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:24,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2020-07-17 22:26:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2020-07-17 22:26:24,594 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2020-07-17 22:26:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:24,595 INFO L479 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2020-07-17 22:26:24,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2020-07-17 22:26:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:24,597 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:24,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:24,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 22:26:24,598 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:24,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2020-07-17 22:26:24,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:24,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410658193] [2020-07-17 22:26:24,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:24,640 INFO L280 TraceCheckUtils]: 0: Hoare triple {11838#true} assume true; {11838#true} is VALID [2020-07-17 22:26:24,640 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {11838#true} {11838#true} #146#return; {11838#true} is VALID [2020-07-17 22:26:24,640 INFO L263 TraceCheckUtils]: 0: Hoare triple {11838#true} call ULTIMATE.init(); {11838#true} is VALID [2020-07-17 22:26:24,641 INFO L280 TraceCheckUtils]: 1: Hoare triple {11838#true} assume true; {11838#true} is VALID [2020-07-17 22:26:24,641 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11838#true} {11838#true} #146#return; {11838#true} is VALID [2020-07-17 22:26:24,641 INFO L263 TraceCheckUtils]: 3: Hoare triple {11838#true} call #t~ret8 := main(); {11838#true} is VALID [2020-07-17 22:26:24,641 INFO L280 TraceCheckUtils]: 4: Hoare triple {11838#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {11838#true} is VALID [2020-07-17 22:26:24,641 INFO L280 TraceCheckUtils]: 5: Hoare triple {11838#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {11838#true} is VALID [2020-07-17 22:26:24,642 INFO L280 TraceCheckUtils]: 6: Hoare triple {11838#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {11838#true} is VALID [2020-07-17 22:26:24,642 INFO L280 TraceCheckUtils]: 7: Hoare triple {11838#true} assume !(0 != ~p1~0); {11838#true} is VALID [2020-07-17 22:26:24,642 INFO L280 TraceCheckUtils]: 8: Hoare triple {11838#true} assume !(0 != ~p2~0); {11838#true} is VALID [2020-07-17 22:26:24,642 INFO L280 TraceCheckUtils]: 9: Hoare triple {11838#true} assume !(0 != ~p3~0); {11838#true} is VALID [2020-07-17 22:26:24,642 INFO L280 TraceCheckUtils]: 10: Hoare triple {11838#true} assume !(0 != ~p4~0); {11838#true} is VALID [2020-07-17 22:26:24,643 INFO L280 TraceCheckUtils]: 11: Hoare triple {11838#true} assume !(0 != ~p5~0); {11842#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:24,644 INFO L280 TraceCheckUtils]: 12: Hoare triple {11842#(= 0 main_~p5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {11842#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:24,644 INFO L280 TraceCheckUtils]: 13: Hoare triple {11842#(= 0 main_~p5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {11842#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:24,645 INFO L280 TraceCheckUtils]: 14: Hoare triple {11842#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {11842#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:24,645 INFO L280 TraceCheckUtils]: 15: Hoare triple {11842#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {11842#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:24,646 INFO L280 TraceCheckUtils]: 16: Hoare triple {11842#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {11842#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:24,646 INFO L280 TraceCheckUtils]: 17: Hoare triple {11842#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {11842#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:24,647 INFO L280 TraceCheckUtils]: 18: Hoare triple {11842#(= 0 main_~p5~0)} assume 0 != ~p5~0; {11839#false} is VALID [2020-07-17 22:26:24,647 INFO L280 TraceCheckUtils]: 19: Hoare triple {11839#false} assume 1 != ~lk5~0; {11839#false} is VALID [2020-07-17 22:26:24,648 INFO L280 TraceCheckUtils]: 20: Hoare triple {11839#false} assume !false; {11839#false} is VALID [2020-07-17 22:26:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:24,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410658193] [2020-07-17 22:26:24,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:24,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:24,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699288578] [2020-07-17 22:26:24,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:24,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:24,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:24,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:24,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:24,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:24,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:24,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:24,675 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2020-07-17 22:26:24,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:24,991 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2020-07-17 22:26:24,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:24,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:24,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2020-07-17 22:26:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2020-07-17 22:26:24,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 125 transitions. [2020-07-17 22:26:25,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:25,152 INFO L225 Difference]: With dead ends: 1180 [2020-07-17 22:26:25,153 INFO L226 Difference]: Without dead ends: 682 [2020-07-17 22:26:25,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2020-07-17 22:26:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2020-07-17 22:26:25,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:25,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 682 states. Second operand 680 states. [2020-07-17 22:26:25,316 INFO L74 IsIncluded]: Start isIncluded. First operand 682 states. Second operand 680 states. [2020-07-17 22:26:25,316 INFO L87 Difference]: Start difference. First operand 682 states. Second operand 680 states. [2020-07-17 22:26:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:25,345 INFO L93 Difference]: Finished difference Result 682 states and 919 transitions. [2020-07-17 22:26:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 919 transitions. [2020-07-17 22:26:25,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:25,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:25,347 INFO L74 IsIncluded]: Start isIncluded. First operand 680 states. Second operand 682 states. [2020-07-17 22:26:25,348 INFO L87 Difference]: Start difference. First operand 680 states. Second operand 682 states. [2020-07-17 22:26:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:25,376 INFO L93 Difference]: Finished difference Result 682 states and 919 transitions. [2020-07-17 22:26:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 919 transitions. [2020-07-17 22:26:25,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:25,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:25,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:25,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2020-07-17 22:26:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2020-07-17 22:26:25,419 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2020-07-17 22:26:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:25,420 INFO L479 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2020-07-17 22:26:25,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2020-07-17 22:26:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:25,421 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:25,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:25,422 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 22:26:25,422 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:25,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:25,423 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2020-07-17 22:26:25,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:25,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474117710] [2020-07-17 22:26:25,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:25,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {15163#true} assume true; {15163#true} is VALID [2020-07-17 22:26:25,456 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {15163#true} {15163#true} #146#return; {15163#true} is VALID [2020-07-17 22:26:25,456 INFO L263 TraceCheckUtils]: 0: Hoare triple {15163#true} call ULTIMATE.init(); {15163#true} is VALID [2020-07-17 22:26:25,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {15163#true} assume true; {15163#true} is VALID [2020-07-17 22:26:25,457 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {15163#true} {15163#true} #146#return; {15163#true} is VALID [2020-07-17 22:26:25,457 INFO L263 TraceCheckUtils]: 3: Hoare triple {15163#true} call #t~ret8 := main(); {15163#true} is VALID [2020-07-17 22:26:25,457 INFO L280 TraceCheckUtils]: 4: Hoare triple {15163#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {15163#true} is VALID [2020-07-17 22:26:25,457 INFO L280 TraceCheckUtils]: 5: Hoare triple {15163#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {15163#true} is VALID [2020-07-17 22:26:25,457 INFO L280 TraceCheckUtils]: 6: Hoare triple {15163#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {15163#true} is VALID [2020-07-17 22:26:25,458 INFO L280 TraceCheckUtils]: 7: Hoare triple {15163#true} assume !(0 != ~p1~0); {15163#true} is VALID [2020-07-17 22:26:25,458 INFO L280 TraceCheckUtils]: 8: Hoare triple {15163#true} assume !(0 != ~p2~0); {15163#true} is VALID [2020-07-17 22:26:25,458 INFO L280 TraceCheckUtils]: 9: Hoare triple {15163#true} assume !(0 != ~p3~0); {15163#true} is VALID [2020-07-17 22:26:25,458 INFO L280 TraceCheckUtils]: 10: Hoare triple {15163#true} assume !(0 != ~p4~0); {15163#true} is VALID [2020-07-17 22:26:25,460 INFO L280 TraceCheckUtils]: 11: Hoare triple {15163#true} assume 0 != ~p5~0;~lk5~0 := 1; {15167#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:25,461 INFO L280 TraceCheckUtils]: 12: Hoare triple {15167#(not (= 0 main_~p5~0))} assume 0 != ~p6~0;~lk6~0 := 1; {15167#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:25,462 INFO L280 TraceCheckUtils]: 13: Hoare triple {15167#(not (= 0 main_~p5~0))} assume 0 != ~p7~0;~lk7~0 := 1; {15167#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:25,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {15167#(not (= 0 main_~p5~0))} assume !(0 != ~p1~0); {15167#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:25,463 INFO L280 TraceCheckUtils]: 15: Hoare triple {15167#(not (= 0 main_~p5~0))} assume !(0 != ~p2~0); {15167#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:25,464 INFO L280 TraceCheckUtils]: 16: Hoare triple {15167#(not (= 0 main_~p5~0))} assume !(0 != ~p3~0); {15167#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:25,464 INFO L280 TraceCheckUtils]: 17: Hoare triple {15167#(not (= 0 main_~p5~0))} assume !(0 != ~p4~0); {15167#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:25,467 INFO L280 TraceCheckUtils]: 18: Hoare triple {15167#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {15164#false} is VALID [2020-07-17 22:26:25,467 INFO L280 TraceCheckUtils]: 19: Hoare triple {15164#false} assume 0 != ~p6~0; {15164#false} is VALID [2020-07-17 22:26:25,467 INFO L280 TraceCheckUtils]: 20: Hoare triple {15164#false} assume 1 != ~lk6~0; {15164#false} is VALID [2020-07-17 22:26:25,467 INFO L280 TraceCheckUtils]: 21: Hoare triple {15164#false} assume !false; {15164#false} is VALID [2020-07-17 22:26:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:25,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474117710] [2020-07-17 22:26:25,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:25,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:25,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547410690] [2020-07-17 22:26:25,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:25,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:25,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:25,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:25,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:25,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:25,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:25,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:25,494 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2020-07-17 22:26:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:25,792 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2020-07-17 22:26:25,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:25,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2020-07-17 22:26:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2020-07-17 22:26:25,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 120 transitions. [2020-07-17 22:26:25,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:25,966 INFO L225 Difference]: With dead ends: 1020 [2020-07-17 22:26:25,966 INFO L226 Difference]: Without dead ends: 698 [2020-07-17 22:26:25,967 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:25,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2020-07-17 22:26:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2020-07-17 22:26:26,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:26,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 698 states. Second operand 696 states. [2020-07-17 22:26:26,130 INFO L74 IsIncluded]: Start isIncluded. First operand 698 states. Second operand 696 states. [2020-07-17 22:26:26,130 INFO L87 Difference]: Start difference. First operand 698 states. Second operand 696 states. [2020-07-17 22:26:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:26,157 INFO L93 Difference]: Finished difference Result 698 states and 919 transitions. [2020-07-17 22:26:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 919 transitions. [2020-07-17 22:26:26,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:26,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:26,159 INFO L74 IsIncluded]: Start isIncluded. First operand 696 states. Second operand 698 states. [2020-07-17 22:26:26,159 INFO L87 Difference]: Start difference. First operand 696 states. Second operand 698 states. [2020-07-17 22:26:26,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:26,189 INFO L93 Difference]: Finished difference Result 698 states and 919 transitions. [2020-07-17 22:26:26,189 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 919 transitions. [2020-07-17 22:26:26,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:26,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:26,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:26,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2020-07-17 22:26:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2020-07-17 22:26:26,221 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2020-07-17 22:26:26,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:26,221 INFO L479 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2020-07-17 22:26:26,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2020-07-17 22:26:26,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:26,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:26,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:26,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 22:26:26,223 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:26,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:26,224 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2020-07-17 22:26:26,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:26,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738640599] [2020-07-17 22:26:26,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:26,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {18376#true} assume true; {18376#true} is VALID [2020-07-17 22:26:26,272 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {18376#true} {18376#true} #146#return; {18376#true} is VALID [2020-07-17 22:26:26,272 INFO L263 TraceCheckUtils]: 0: Hoare triple {18376#true} call ULTIMATE.init(); {18376#true} is VALID [2020-07-17 22:26:26,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {18376#true} assume true; {18376#true} is VALID [2020-07-17 22:26:26,272 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {18376#true} {18376#true} #146#return; {18376#true} is VALID [2020-07-17 22:26:26,272 INFO L263 TraceCheckUtils]: 3: Hoare triple {18376#true} call #t~ret8 := main(); {18376#true} is VALID [2020-07-17 22:26:26,273 INFO L280 TraceCheckUtils]: 4: Hoare triple {18376#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {18376#true} is VALID [2020-07-17 22:26:26,273 INFO L280 TraceCheckUtils]: 5: Hoare triple {18376#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {18376#true} is VALID [2020-07-17 22:26:26,273 INFO L280 TraceCheckUtils]: 6: Hoare triple {18376#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {18376#true} is VALID [2020-07-17 22:26:26,273 INFO L280 TraceCheckUtils]: 7: Hoare triple {18376#true} assume !(0 != ~p1~0); {18376#true} is VALID [2020-07-17 22:26:26,274 INFO L280 TraceCheckUtils]: 8: Hoare triple {18376#true} assume !(0 != ~p2~0); {18376#true} is VALID [2020-07-17 22:26:26,274 INFO L280 TraceCheckUtils]: 9: Hoare triple {18376#true} assume !(0 != ~p3~0); {18376#true} is VALID [2020-07-17 22:26:26,274 INFO L280 TraceCheckUtils]: 10: Hoare triple {18376#true} assume !(0 != ~p4~0); {18376#true} is VALID [2020-07-17 22:26:26,274 INFO L280 TraceCheckUtils]: 11: Hoare triple {18376#true} assume !(0 != ~p5~0); {18376#true} is VALID [2020-07-17 22:26:26,276 INFO L280 TraceCheckUtils]: 12: Hoare triple {18376#true} assume 0 != ~p6~0;~lk6~0 := 1; {18380#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:26,277 INFO L280 TraceCheckUtils]: 13: Hoare triple {18380#(= 1 main_~lk6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {18380#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:26,277 INFO L280 TraceCheckUtils]: 14: Hoare triple {18380#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {18380#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:26,278 INFO L280 TraceCheckUtils]: 15: Hoare triple {18380#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {18380#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:26,278 INFO L280 TraceCheckUtils]: 16: Hoare triple {18380#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {18380#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:26,279 INFO L280 TraceCheckUtils]: 17: Hoare triple {18380#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {18380#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:26,280 INFO L280 TraceCheckUtils]: 18: Hoare triple {18380#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {18380#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:26,280 INFO L280 TraceCheckUtils]: 19: Hoare triple {18380#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {18380#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:26,281 INFO L280 TraceCheckUtils]: 20: Hoare triple {18380#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {18377#false} is VALID [2020-07-17 22:26:26,281 INFO L280 TraceCheckUtils]: 21: Hoare triple {18377#false} assume !false; {18377#false} is VALID [2020-07-17 22:26:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:26,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738640599] [2020-07-17 22:26:26,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:26,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:26,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674735145] [2020-07-17 22:26:26,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:26,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:26,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:26,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:26,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:26,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:26,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:26,307 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2020-07-17 22:26:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:26,764 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2020-07-17 22:26:26,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:26,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:26,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-17 22:26:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-17 22:26:26,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2020-07-17 22:26:26,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:26,919 INFO L225 Difference]: With dead ends: 1164 [2020-07-17 22:26:26,919 INFO L226 Difference]: Without dead ends: 1162 [2020-07-17 22:26:26,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:26,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-07-17 22:26:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2020-07-17 22:26:27,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:27,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1162 states. Second operand 1032 states. [2020-07-17 22:26:27,107 INFO L74 IsIncluded]: Start isIncluded. First operand 1162 states. Second operand 1032 states. [2020-07-17 22:26:27,107 INFO L87 Difference]: Start difference. First operand 1162 states. Second operand 1032 states. [2020-07-17 22:26:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:27,181 INFO L93 Difference]: Finished difference Result 1162 states and 1511 transitions. [2020-07-17 22:26:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1511 transitions. [2020-07-17 22:26:27,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:27,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:27,184 INFO L74 IsIncluded]: Start isIncluded. First operand 1032 states. Second operand 1162 states. [2020-07-17 22:26:27,185 INFO L87 Difference]: Start difference. First operand 1032 states. Second operand 1162 states. [2020-07-17 22:26:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:27,255 INFO L93 Difference]: Finished difference Result 1162 states and 1511 transitions. [2020-07-17 22:26:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1511 transitions. [2020-07-17 22:26:27,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:27,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:27,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:27,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2020-07-17 22:26:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2020-07-17 22:26:27,316 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2020-07-17 22:26:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:27,317 INFO L479 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2020-07-17 22:26:27,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2020-07-17 22:26:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:27,319 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:27,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:27,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 22:26:27,319 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:27,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:27,320 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2020-07-17 22:26:27,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:27,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462782503] [2020-07-17 22:26:27,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:27,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {23013#true} assume true; {23013#true} is VALID [2020-07-17 22:26:27,349 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23013#true} {23013#true} #146#return; {23013#true} is VALID [2020-07-17 22:26:27,350 INFO L263 TraceCheckUtils]: 0: Hoare triple {23013#true} call ULTIMATE.init(); {23013#true} is VALID [2020-07-17 22:26:27,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {23013#true} assume true; {23013#true} is VALID [2020-07-17 22:26:27,350 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23013#true} {23013#true} #146#return; {23013#true} is VALID [2020-07-17 22:26:27,350 INFO L263 TraceCheckUtils]: 3: Hoare triple {23013#true} call #t~ret8 := main(); {23013#true} is VALID [2020-07-17 22:26:27,350 INFO L280 TraceCheckUtils]: 4: Hoare triple {23013#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {23013#true} is VALID [2020-07-17 22:26:27,351 INFO L280 TraceCheckUtils]: 5: Hoare triple {23013#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {23013#true} is VALID [2020-07-17 22:26:27,351 INFO L280 TraceCheckUtils]: 6: Hoare triple {23013#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {23013#true} is VALID [2020-07-17 22:26:27,351 INFO L280 TraceCheckUtils]: 7: Hoare triple {23013#true} assume !(0 != ~p1~0); {23013#true} is VALID [2020-07-17 22:26:27,352 INFO L280 TraceCheckUtils]: 8: Hoare triple {23013#true} assume !(0 != ~p2~0); {23013#true} is VALID [2020-07-17 22:26:27,352 INFO L280 TraceCheckUtils]: 9: Hoare triple {23013#true} assume !(0 != ~p3~0); {23013#true} is VALID [2020-07-17 22:26:27,352 INFO L280 TraceCheckUtils]: 10: Hoare triple {23013#true} assume !(0 != ~p4~0); {23013#true} is VALID [2020-07-17 22:26:27,352 INFO L280 TraceCheckUtils]: 11: Hoare triple {23013#true} assume !(0 != ~p5~0); {23013#true} is VALID [2020-07-17 22:26:27,353 INFO L280 TraceCheckUtils]: 12: Hoare triple {23013#true} assume !(0 != ~p6~0); {23017#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:27,354 INFO L280 TraceCheckUtils]: 13: Hoare triple {23017#(= 0 main_~p6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {23017#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:27,354 INFO L280 TraceCheckUtils]: 14: Hoare triple {23017#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {23017#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:27,355 INFO L280 TraceCheckUtils]: 15: Hoare triple {23017#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {23017#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:27,355 INFO L280 TraceCheckUtils]: 16: Hoare triple {23017#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {23017#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:27,356 INFO L280 TraceCheckUtils]: 17: Hoare triple {23017#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {23017#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:27,357 INFO L280 TraceCheckUtils]: 18: Hoare triple {23017#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {23017#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:27,357 INFO L280 TraceCheckUtils]: 19: Hoare triple {23017#(= 0 main_~p6~0)} assume 0 != ~p6~0; {23014#false} is VALID [2020-07-17 22:26:27,357 INFO L280 TraceCheckUtils]: 20: Hoare triple {23014#false} assume 1 != ~lk6~0; {23014#false} is VALID [2020-07-17 22:26:27,358 INFO L280 TraceCheckUtils]: 21: Hoare triple {23014#false} assume !false; {23014#false} is VALID [2020-07-17 22:26:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:27,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462782503] [2020-07-17 22:26:27,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:27,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:27,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011215583] [2020-07-17 22:26:27,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:27,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:27,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:27,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:27,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:27,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:27,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:27,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:27,387 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2020-07-17 22:26:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:28,018 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2020-07-17 22:26:28,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:28,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-17 22:26:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-17 22:26:28,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2020-07-17 22:26:28,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:28,244 INFO L225 Difference]: With dead ends: 2316 [2020-07-17 22:26:28,244 INFO L226 Difference]: Without dead ends: 1322 [2020-07-17 22:26:28,246 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2020-07-17 22:26:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2020-07-17 22:26:28,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:28,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1322 states. Second operand 1320 states. [2020-07-17 22:26:28,616 INFO L74 IsIncluded]: Start isIncluded. First operand 1322 states. Second operand 1320 states. [2020-07-17 22:26:28,616 INFO L87 Difference]: Start difference. First operand 1322 states. Second operand 1320 states. [2020-07-17 22:26:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:28,695 INFO L93 Difference]: Finished difference Result 1322 states and 1607 transitions. [2020-07-17 22:26:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1607 transitions. [2020-07-17 22:26:28,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:28,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:28,699 INFO L74 IsIncluded]: Start isIncluded. First operand 1320 states. Second operand 1322 states. [2020-07-17 22:26:28,699 INFO L87 Difference]: Start difference. First operand 1320 states. Second operand 1322 states. [2020-07-17 22:26:28,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:28,783 INFO L93 Difference]: Finished difference Result 1322 states and 1607 transitions. [2020-07-17 22:26:28,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1607 transitions. [2020-07-17 22:26:28,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:28,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:28,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:28,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2020-07-17 22:26:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2020-07-17 22:26:28,852 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2020-07-17 22:26:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:28,853 INFO L479 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2020-07-17 22:26:28,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2020-07-17 22:26:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:28,855 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:28,855 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] [2020-07-17 22:26:28,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-17 22:26:28,855 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:28,856 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2020-07-17 22:26:28,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:28,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731972644] [2020-07-17 22:26:28,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:28,892 INFO L280 TraceCheckUtils]: 0: Hoare triple {29474#true} assume true; {29474#true} is VALID [2020-07-17 22:26:28,892 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29474#true} {29474#true} #146#return; {29474#true} is VALID [2020-07-17 22:26:28,893 INFO L263 TraceCheckUtils]: 0: Hoare triple {29474#true} call ULTIMATE.init(); {29474#true} is VALID [2020-07-17 22:26:28,893 INFO L280 TraceCheckUtils]: 1: Hoare triple {29474#true} assume true; {29474#true} is VALID [2020-07-17 22:26:28,893 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29474#true} {29474#true} #146#return; {29474#true} is VALID [2020-07-17 22:26:28,893 INFO L263 TraceCheckUtils]: 3: Hoare triple {29474#true} call #t~ret8 := main(); {29474#true} is VALID [2020-07-17 22:26:28,894 INFO L280 TraceCheckUtils]: 4: Hoare triple {29474#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {29474#true} is VALID [2020-07-17 22:26:28,894 INFO L280 TraceCheckUtils]: 5: Hoare triple {29474#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {29474#true} is VALID [2020-07-17 22:26:28,894 INFO L280 TraceCheckUtils]: 6: Hoare triple {29474#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {29474#true} is VALID [2020-07-17 22:26:28,894 INFO L280 TraceCheckUtils]: 7: Hoare triple {29474#true} assume !(0 != ~p1~0); {29474#true} is VALID [2020-07-17 22:26:28,894 INFO L280 TraceCheckUtils]: 8: Hoare triple {29474#true} assume !(0 != ~p2~0); {29474#true} is VALID [2020-07-17 22:26:28,895 INFO L280 TraceCheckUtils]: 9: Hoare triple {29474#true} assume !(0 != ~p3~0); {29474#true} is VALID [2020-07-17 22:26:28,895 INFO L280 TraceCheckUtils]: 10: Hoare triple {29474#true} assume !(0 != ~p4~0); {29474#true} is VALID [2020-07-17 22:26:28,895 INFO L280 TraceCheckUtils]: 11: Hoare triple {29474#true} assume !(0 != ~p5~0); {29474#true} is VALID [2020-07-17 22:26:28,896 INFO L280 TraceCheckUtils]: 12: Hoare triple {29474#true} assume 0 != ~p6~0;~lk6~0 := 1; {29478#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:28,899 INFO L280 TraceCheckUtils]: 13: Hoare triple {29478#(not (= 0 main_~p6~0))} assume 0 != ~p7~0;~lk7~0 := 1; {29478#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:28,899 INFO L280 TraceCheckUtils]: 14: Hoare triple {29478#(not (= 0 main_~p6~0))} assume !(0 != ~p1~0); {29478#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:28,900 INFO L280 TraceCheckUtils]: 15: Hoare triple {29478#(not (= 0 main_~p6~0))} assume !(0 != ~p2~0); {29478#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:28,900 INFO L280 TraceCheckUtils]: 16: Hoare triple {29478#(not (= 0 main_~p6~0))} assume !(0 != ~p3~0); {29478#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:28,901 INFO L280 TraceCheckUtils]: 17: Hoare triple {29478#(not (= 0 main_~p6~0))} assume !(0 != ~p4~0); {29478#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:28,902 INFO L280 TraceCheckUtils]: 18: Hoare triple {29478#(not (= 0 main_~p6~0))} assume !(0 != ~p5~0); {29478#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:28,902 INFO L280 TraceCheckUtils]: 19: Hoare triple {29478#(not (= 0 main_~p6~0))} assume !(0 != ~p6~0); {29475#false} is VALID [2020-07-17 22:26:28,902 INFO L280 TraceCheckUtils]: 20: Hoare triple {29475#false} assume 0 != ~p7~0; {29475#false} is VALID [2020-07-17 22:26:28,903 INFO L280 TraceCheckUtils]: 21: Hoare triple {29475#false} assume 1 != ~lk7~0; {29475#false} is VALID [2020-07-17 22:26:28,903 INFO L280 TraceCheckUtils]: 22: Hoare triple {29475#false} assume !false; {29475#false} is VALID [2020-07-17 22:26:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:28,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731972644] [2020-07-17 22:26:28,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:28,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:28,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281339055] [2020-07-17 22:26:28,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:28,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:28,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:28,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:28,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:28,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:28,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:28,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:28,934 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2020-07-17 22:26:29,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:29,515 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2020-07-17 22:26:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:29,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2020-07-17 22:26:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2020-07-17 22:26:29,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2020-07-17 22:26:29,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:29,720 INFO L225 Difference]: With dead ends: 1980 [2020-07-17 22:26:29,722 INFO L226 Difference]: Without dead ends: 1354 [2020-07-17 22:26:29,724 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-07-17 22:26:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2020-07-17 22:26:30,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:30,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1354 states. Second operand 1352 states. [2020-07-17 22:26:30,084 INFO L74 IsIncluded]: Start isIncluded. First operand 1354 states. Second operand 1352 states. [2020-07-17 22:26:30,084 INFO L87 Difference]: Start difference. First operand 1354 states. Second operand 1352 states. [2020-07-17 22:26:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:30,175 INFO L93 Difference]: Finished difference Result 1354 states and 1607 transitions. [2020-07-17 22:26:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1607 transitions. [2020-07-17 22:26:30,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:30,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:30,178 INFO L74 IsIncluded]: Start isIncluded. First operand 1352 states. Second operand 1354 states. [2020-07-17 22:26:30,178 INFO L87 Difference]: Start difference. First operand 1352 states. Second operand 1354 states. [2020-07-17 22:26:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:30,250 INFO L93 Difference]: Finished difference Result 1354 states and 1607 transitions. [2020-07-17 22:26:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1607 transitions. [2020-07-17 22:26:30,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:30,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:30,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:30,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2020-07-17 22:26:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2020-07-17 22:26:30,308 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2020-07-17 22:26:30,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:30,308 INFO L479 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2020-07-17 22:26:30,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2020-07-17 22:26:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:30,310 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:30,310 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] [2020-07-17 22:26:30,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-17 22:26:30,310 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:30,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:30,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2020-07-17 22:26:30,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:30,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733274934] [2020-07-17 22:26:30,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:30,338 INFO L280 TraceCheckUtils]: 0: Hoare triple {35695#true} assume true; {35695#true} is VALID [2020-07-17 22:26:30,339 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35695#true} {35695#true} #146#return; {35695#true} is VALID [2020-07-17 22:26:30,339 INFO L263 TraceCheckUtils]: 0: Hoare triple {35695#true} call ULTIMATE.init(); {35695#true} is VALID [2020-07-17 22:26:30,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {35695#true} assume true; {35695#true} is VALID [2020-07-17 22:26:30,339 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35695#true} {35695#true} #146#return; {35695#true} is VALID [2020-07-17 22:26:30,339 INFO L263 TraceCheckUtils]: 3: Hoare triple {35695#true} call #t~ret8 := main(); {35695#true} is VALID [2020-07-17 22:26:30,340 INFO L280 TraceCheckUtils]: 4: Hoare triple {35695#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {35695#true} is VALID [2020-07-17 22:26:30,340 INFO L280 TraceCheckUtils]: 5: Hoare triple {35695#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {35695#true} is VALID [2020-07-17 22:26:30,340 INFO L280 TraceCheckUtils]: 6: Hoare triple {35695#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {35695#true} is VALID [2020-07-17 22:26:30,340 INFO L280 TraceCheckUtils]: 7: Hoare triple {35695#true} assume !(0 != ~p1~0); {35695#true} is VALID [2020-07-17 22:26:30,340 INFO L280 TraceCheckUtils]: 8: Hoare triple {35695#true} assume !(0 != ~p2~0); {35695#true} is VALID [2020-07-17 22:26:30,341 INFO L280 TraceCheckUtils]: 9: Hoare triple {35695#true} assume !(0 != ~p3~0); {35695#true} is VALID [2020-07-17 22:26:30,341 INFO L280 TraceCheckUtils]: 10: Hoare triple {35695#true} assume !(0 != ~p4~0); {35695#true} is VALID [2020-07-17 22:26:30,341 INFO L280 TraceCheckUtils]: 11: Hoare triple {35695#true} assume !(0 != ~p5~0); {35695#true} is VALID [2020-07-17 22:26:30,341 INFO L280 TraceCheckUtils]: 12: Hoare triple {35695#true} assume !(0 != ~p6~0); {35695#true} is VALID [2020-07-17 22:26:30,342 INFO L280 TraceCheckUtils]: 13: Hoare triple {35695#true} assume 0 != ~p7~0;~lk7~0 := 1; {35699#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:30,342 INFO L280 TraceCheckUtils]: 14: Hoare triple {35699#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {35699#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:30,343 INFO L280 TraceCheckUtils]: 15: Hoare triple {35699#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {35699#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:30,343 INFO L280 TraceCheckUtils]: 16: Hoare triple {35699#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {35699#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:30,344 INFO L280 TraceCheckUtils]: 17: Hoare triple {35699#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {35699#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:30,344 INFO L280 TraceCheckUtils]: 18: Hoare triple {35699#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {35699#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:30,345 INFO L280 TraceCheckUtils]: 19: Hoare triple {35699#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {35699#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:30,345 INFO L280 TraceCheckUtils]: 20: Hoare triple {35699#(= main_~lk7~0 1)} assume 0 != ~p7~0; {35699#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:30,346 INFO L280 TraceCheckUtils]: 21: Hoare triple {35699#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {35696#false} is VALID [2020-07-17 22:26:30,346 INFO L280 TraceCheckUtils]: 22: Hoare triple {35696#false} assume !false; {35696#false} is VALID [2020-07-17 22:26:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:30,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733274934] [2020-07-17 22:26:30,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:30,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:30,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173527250] [2020-07-17 22:26:30,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:30,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:30,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:30,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:30,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:30,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:30,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:30,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:30,370 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2020-07-17 22:26:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:31,556 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2020-07-17 22:26:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:31,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2020-07-17 22:26:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2020-07-17 22:26:31,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2020-07-17 22:26:31,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:31,806 INFO L225 Difference]: With dead ends: 2186 [2020-07-17 22:26:31,806 INFO L226 Difference]: Without dead ends: 2184 [2020-07-17 22:26:31,807 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2020-07-17 22:26:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2020-07-17 22:26:32,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:32,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2184 states. Second operand 2056 states. [2020-07-17 22:26:32,222 INFO L74 IsIncluded]: Start isIncluded. First operand 2184 states. Second operand 2056 states. [2020-07-17 22:26:32,222 INFO L87 Difference]: Start difference. First operand 2184 states. Second operand 2056 states. [2020-07-17 22:26:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:32,355 INFO L93 Difference]: Finished difference Result 2184 states and 2502 transitions. [2020-07-17 22:26:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2502 transitions. [2020-07-17 22:26:32,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:32,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:32,358 INFO L74 IsIncluded]: Start isIncluded. First operand 2056 states. Second operand 2184 states. [2020-07-17 22:26:32,358 INFO L87 Difference]: Start difference. First operand 2056 states. Second operand 2184 states. [2020-07-17 22:26:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:32,502 INFO L93 Difference]: Finished difference Result 2184 states and 2502 transitions. [2020-07-17 22:26:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2502 transitions. [2020-07-17 22:26:32,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:32,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:32,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:32,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2020-07-17 22:26:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2020-07-17 22:26:32,628 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2020-07-17 22:26:32,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:32,628 INFO L479 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2020-07-17 22:26:32,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2020-07-17 22:26:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:32,630 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:32,630 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] [2020-07-17 22:26:32,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-17 22:26:32,631 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:32,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:32,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2020-07-17 22:26:32,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:32,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129941748] [2020-07-17 22:26:32,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:32,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {44517#true} assume true; {44517#true} is VALID [2020-07-17 22:26:32,657 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {44517#true} {44517#true} #146#return; {44517#true} is VALID [2020-07-17 22:26:32,657 INFO L263 TraceCheckUtils]: 0: Hoare triple {44517#true} call ULTIMATE.init(); {44517#true} is VALID [2020-07-17 22:26:32,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {44517#true} assume true; {44517#true} is VALID [2020-07-17 22:26:32,657 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {44517#true} {44517#true} #146#return; {44517#true} is VALID [2020-07-17 22:26:32,658 INFO L263 TraceCheckUtils]: 3: Hoare triple {44517#true} call #t~ret8 := main(); {44517#true} is VALID [2020-07-17 22:26:32,658 INFO L280 TraceCheckUtils]: 4: Hoare triple {44517#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;havoc ~cond~0; {44517#true} is VALID [2020-07-17 22:26:32,658 INFO L280 TraceCheckUtils]: 5: Hoare triple {44517#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {44517#true} is VALID [2020-07-17 22:26:32,658 INFO L280 TraceCheckUtils]: 6: Hoare triple {44517#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {44517#true} is VALID [2020-07-17 22:26:32,658 INFO L280 TraceCheckUtils]: 7: Hoare triple {44517#true} assume !(0 != ~p1~0); {44517#true} is VALID [2020-07-17 22:26:32,659 INFO L280 TraceCheckUtils]: 8: Hoare triple {44517#true} assume !(0 != ~p2~0); {44517#true} is VALID [2020-07-17 22:26:32,659 INFO L280 TraceCheckUtils]: 9: Hoare triple {44517#true} assume !(0 != ~p3~0); {44517#true} is VALID [2020-07-17 22:26:32,659 INFO L280 TraceCheckUtils]: 10: Hoare triple {44517#true} assume !(0 != ~p4~0); {44517#true} is VALID [2020-07-17 22:26:32,659 INFO L280 TraceCheckUtils]: 11: Hoare triple {44517#true} assume !(0 != ~p5~0); {44517#true} is VALID [2020-07-17 22:26:32,659 INFO L280 TraceCheckUtils]: 12: Hoare triple {44517#true} assume !(0 != ~p6~0); {44517#true} is VALID [2020-07-17 22:26:32,660 INFO L280 TraceCheckUtils]: 13: Hoare triple {44517#true} assume !(0 != ~p7~0); {44521#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:32,661 INFO L280 TraceCheckUtils]: 14: Hoare triple {44521#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {44521#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:32,661 INFO L280 TraceCheckUtils]: 15: Hoare triple {44521#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {44521#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:32,662 INFO L280 TraceCheckUtils]: 16: Hoare triple {44521#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {44521#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:32,662 INFO L280 TraceCheckUtils]: 17: Hoare triple {44521#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {44521#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:32,663 INFO L280 TraceCheckUtils]: 18: Hoare triple {44521#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {44521#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:32,664 INFO L280 TraceCheckUtils]: 19: Hoare triple {44521#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {44521#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:32,664 INFO L280 TraceCheckUtils]: 20: Hoare triple {44521#(= 0 main_~p7~0)} assume 0 != ~p7~0; {44518#false} is VALID [2020-07-17 22:26:32,664 INFO L280 TraceCheckUtils]: 21: Hoare triple {44518#false} assume 1 != ~lk7~0; {44518#false} is VALID [2020-07-17 22:26:32,664 INFO L280 TraceCheckUtils]: 22: Hoare triple {44518#false} assume !false; {44518#false} is VALID [2020-07-17 22:26:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:32,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129941748] [2020-07-17 22:26:32,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:32,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:32,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816703255] [2020-07-17 22:26:32,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:32,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:32,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:32,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:32,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:32,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:32,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:32,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:32,692 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2020-07-17 22:26:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:34,212 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2020-07-17 22:26:34,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:34,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2020-07-17 22:26:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2020-07-17 22:26:34,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2020-07-17 22:26:34,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:34,338 INFO L225 Difference]: With dead ends: 4552 [2020-07-17 22:26:34,338 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:26:34,345 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-17 22:26:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:26:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:26:34,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:34,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:34,346 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:34,347 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:34,347 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:26:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:26:34,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:34,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:34,348 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:34,348 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:34,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:34,348 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:26:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:26:34,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:34,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:34,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:34,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:26:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:26:34,349 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-07-17 22:26:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:34,350 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:26:34,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:26:34,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:34,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-17 22:26:34,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:26:34,393 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:26:34,393 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:26:34,394 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:26:34,394 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:26:34,394 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:26:34,394 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:26:34,394 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2020-07-17 22:26:34,394 INFO L268 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2020-07-17 22:26:34,394 INFO L268 CegarLoopResult]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2020-07-17 22:26:34,394 INFO L271 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2020-07-17 22:26:34,395 INFO L268 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2020-07-17 22:26:34,395 INFO L268 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2020-07-17 22:26:34,395 INFO L264 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2020-07-17 22:26:34,395 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2020-07-17 22:26:34,395 INFO L268 CegarLoopResult]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2020-07-17 22:26:34,395 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2020-07-17 22:26:34,395 INFO L268 CegarLoopResult]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2020-07-17 22:26:34,395 INFO L268 CegarLoopResult]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2020-07-17 22:26:34,396 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2020-07-17 22:26:34,396 INFO L268 CegarLoopResult]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2020-07-17 22:26:34,396 INFO L268 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2020-07-17 22:26:34,396 INFO L268 CegarLoopResult]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2020-07-17 22:26:34,396 INFO L268 CegarLoopResult]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2020-07-17 22:26:34,396 INFO L268 CegarLoopResult]: For program point L32(lines 32 34) no Hoare annotation was computed. [2020-07-17 22:26:34,396 INFO L268 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2020-07-17 22:26:34,397 INFO L268 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-07-17 22:26:34,398 INFO L268 CegarLoopResult]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2020-07-17 22:26:34,398 INFO L268 CegarLoopResult]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2020-07-17 22:26:34,398 INFO L268 CegarLoopResult]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2020-07-17 22:26:34,398 INFO L268 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-07-17 22:26:34,398 INFO L268 CegarLoopResult]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2020-07-17 22:26:34,398 INFO L271 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2020-07-17 22:26:34,398 INFO L268 CegarLoopResult]: For program point L51(lines 51 53) no Hoare annotation was computed. [2020-07-17 22:26:34,398 INFO L268 CegarLoopResult]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2020-07-17 22:26:34,398 INFO L268 CegarLoopResult]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2020-07-17 22:26:34,403 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:26:34,403 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:26:34,403 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:26:34,404 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:26:34,404 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:26:34,404 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:26:34,404 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:26:34,404 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:26:34,404 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:26:34,404 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-17 22:26:34,404 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-17 22:26:34,404 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:26:34,405 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-17 22:26:34,405 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-17 22:26:34,405 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2020-07-17 22:26:34,405 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2020-07-17 22:26:34,405 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-17 22:26:34,405 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-17 22:26:34,405 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-17 22:26:34,405 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-17 22:26:34,405 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2020-07-17 22:26:34,405 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2020-07-17 22:26:34,406 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2020-07-17 22:26:34,406 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2020-07-17 22:26:34,406 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2020-07-17 22:26:34,406 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2020-07-17 22:26:34,406 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2020-07-17 22:26:34,406 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2020-07-17 22:26:34,406 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2020-07-17 22:26:34,406 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2020-07-17 22:26:34,406 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-17 22:26:34,406 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:26:34,407 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2020-07-17 22:26:34,407 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2020-07-17 22:26:34,407 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-17 22:26:34,407 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-17 22:26:34,407 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2020-07-17 22:26:34,407 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2020-07-17 22:26:34,407 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2020-07-17 22:26:34,407 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2020-07-17 22:26:34,407 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-17 22:26:34,407 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-17 22:26:34,408 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2020-07-17 22:26:34,408 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2020-07-17 22:26:34,408 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-17 22:26:34,408 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-17 22:26:34,408 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2020-07-17 22:26:34,408 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2020-07-17 22:26:34,408 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2020-07-17 22:26:34,408 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2020-07-17 22:26:34,408 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2020-07-17 22:26:34,408 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2020-07-17 22:26:34,409 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2020-07-17 22:26:34,409 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2020-07-17 22:26:34,409 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:26:34,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:26:34 BoogieIcfgContainer [2020-07-17 22:26:34,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:26:34,421 INFO L168 Benchmark]: Toolchain (without parser) took 16933.34 ms. Allocated memory was 136.3 MB in the beginning and 402.1 MB in the end (delta: 265.8 MB). Free memory was 100.4 MB in the beginning and 215.0 MB in the end (delta: -114.6 MB). Peak memory consumption was 151.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:34,422 INFO L168 Benchmark]: CDTParser took 1.38 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:26:34,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.08 ms. Allocated memory is still 136.3 MB. Free memory was 100.0 MB in the beginning and 89.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:34,425 INFO L168 Benchmark]: Boogie Preprocessor took 114.05 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 89.4 MB in the beginning and 178.9 MB in the end (delta: -89.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:34,425 INFO L168 Benchmark]: RCFGBuilder took 563.43 ms. Allocated memory is still 200.3 MB. Free memory was 178.9 MB in the beginning and 154.5 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:34,426 INFO L168 Benchmark]: TraceAbstraction took 15998.36 ms. Allocated memory was 200.3 MB in the beginning and 402.1 MB in the end (delta: 201.9 MB). Free memory was 153.8 MB in the beginning and 215.0 MB in the end (delta: -61.2 MB). Peak memory consumption was 140.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:34,430 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 250.08 ms. Allocated memory is still 136.3 MB. Free memory was 100.0 MB in the beginning and 89.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.05 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 89.4 MB in the beginning and 178.9 MB in the end (delta: -89.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 563.43 ms. Allocated memory is still 200.3 MB. Free memory was 178.9 MB in the beginning and 154.5 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15998.36 ms. Allocated memory was 200.3 MB in the beginning and 402.1 MB in the end (delta: 201.9 MB). Free memory was 153.8 MB in the beginning and 215.0 MB in the end (delta: -61.2 MB). Peak memory consumption was 140.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.8s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...