/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_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:26:28,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:26:28,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:26:28,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:26:28,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:26:28,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:26:28,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:26:28,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:26:28,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:26:28,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:26:28,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:26:28,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:26:28,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:26:28,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:26:28,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:26:28,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:26:28,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:26:28,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:26:28,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:26:28,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:26:28,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:26:28,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:26:28,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:26:28,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:26:28,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:26:28,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:26:28,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:26:28,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:26:28,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:26:28,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:26:28,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:26:28,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:26:28,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:26:28,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:26:28,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:26:28,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:26:28,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:26:28,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:26:28,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:26:28,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:26:28,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:26:28,383 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:28,397 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:26:28,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:26:28,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:26:28,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:26:28,399 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:26:28,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:26:28,399 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:26:28,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:26:28,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:26:28,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:26:28,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:26:28,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:26:28,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:26:28,401 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:26:28,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:26:28,401 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:26:28,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:26:28,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:26:28,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:26:28,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:26:28,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:26:28,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:26:28,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:26:28,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:26:28,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:26:28,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:26:28,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:26:28,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:26:28,404 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:26:28,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:26:28,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:26:28,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:26:28,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:26:28,738 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:26:28,739 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:26:28,740 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2020-07-17 22:26:28,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7133f40/ecfe00da344041ab9ef2ffe243b4c5c1/FLAGdf46b7712 [2020-07-17 22:26:29,333 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:26:29,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2020-07-17 22:26:29,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7133f40/ecfe00da344041ab9ef2ffe243b4c5c1/FLAGdf46b7712 [2020-07-17 22:26:29,701 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7133f40/ecfe00da344041ab9ef2ffe243b4c5c1 [2020-07-17 22:26:29,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:26:29,712 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:26:29,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:29,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:26:29,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:26:29,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:29" (1/1) ... [2020-07-17 22:26:29,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5b344f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:29, skipping insertion in model container [2020-07-17 22:26:29,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:29" (1/1) ... [2020-07-17 22:26:29,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:26:29,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:26:29,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:29,945 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:26:29,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:29,989 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:26:29,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:29 WrapperNode [2020-07-17 22:26:29,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:29,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:26:29,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:26:29,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:26:30,000 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:29" (1/1) ... [2020-07-17 22:26:30,001 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:29" (1/1) ... [2020-07-17 22:26:30,007 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:29" (1/1) ... [2020-07-17 22:26:30,007 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:29" (1/1) ... [2020-07-17 22:26:30,103 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:29" (1/1) ... [2020-07-17 22:26:30,118 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:29" (1/1) ... [2020-07-17 22:26:30,122 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:29" (1/1) ... [2020-07-17 22:26:30,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:26:30,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:26:30,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:26:30,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:26:30,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:29" (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:30,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:26:30,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:26:30,203 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:26:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:26:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:26:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:26:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:26:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:26:30,669 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:26:30,669 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:26:30,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:30 BoogieIcfgContainer [2020-07-17 22:26:30,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:26:30,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:26:30,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:26:30,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:26:30,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:26:29" (1/3) ... [2020-07-17 22:26:30,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2de019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:30, skipping insertion in model container [2020-07-17 22:26:30,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:29" (2/3) ... [2020-07-17 22:26:30,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2de019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:30, skipping insertion in model container [2020-07-17 22:26:30,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:30" (3/3) ... [2020-07-17 22:26:30,684 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2020-07-17 22:26:30,695 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:26:30,708 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:26:30,724 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:26:30,750 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:26:30,750 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:26:30,751 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:26:30,751 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:26:30,751 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:26:30,751 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:26:30,751 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:26:30,752 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:26:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2020-07-17 22:26:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:30,778 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:30,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:30,779 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:30,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2020-07-17 22:26:30,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:30,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344620511] [2020-07-17 22:26:30,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:31,023 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:26:31,023 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {44#true} {44#true} #180#return; {44#true} is VALID [2020-07-17 22:26:31,026 INFO L263 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {44#true} is VALID [2020-07-17 22:26:31,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:26:31,031 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {44#true} {44#true} #180#return; {44#true} is VALID [2020-07-17 22:26:31,031 INFO L263 TraceCheckUtils]: 3: Hoare triple {44#true} call #t~ret10 := main(); {44#true} is VALID [2020-07-17 22:26:31,032 INFO L280 TraceCheckUtils]: 4: Hoare triple {44#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {44#true} is VALID [2020-07-17 22:26:31,033 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {44#true} is VALID [2020-07-17 22:26:31,033 INFO L280 TraceCheckUtils]: 6: Hoare triple {44#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;~lk8~0 := 0;~lk9~0 := 0; {44#true} is VALID [2020-07-17 22:26:31,037 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#true} assume 0 != ~p1~0;~lk1~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:31,039 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:31,040 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:31,041 INFO L280 TraceCheckUtils]: 10: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:31,041 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:31,042 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:31,043 INFO L280 TraceCheckUtils]: 13: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:31,045 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {48#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:31,047 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:31,048 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {48#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:31,049 INFO L280 TraceCheckUtils]: 17: Hoare triple {48#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {45#false} is VALID [2020-07-17 22:26:31,049 INFO L280 TraceCheckUtils]: 18: Hoare triple {45#false} assume !false; {45#false} is VALID [2020-07-17 22:26:31,053 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:31,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344620511] [2020-07-17 22:26:31,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:31,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:31,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359762149] [2020-07-17 22:26:31,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:31,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:31,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:31,118 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:31,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:31,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:31,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:31,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:31,132 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2020-07-17 22:26:31,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:31,348 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2020-07-17 22:26:31,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:31,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-17 22:26:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-17 22:26:31,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-17 22:26:31,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:31,606 INFO L225 Difference]: With dead ends: 81 [2020-07-17 22:26:31,606 INFO L226 Difference]: Without dead ends: 66 [2020-07-17 22:26:31,610 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,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-17 22:26:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2020-07-17 22:26:31,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:31,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 46 states. [2020-07-17 22:26:31,660 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 46 states. [2020-07-17 22:26:31,660 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 46 states. [2020-07-17 22:26:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:31,668 INFO L93 Difference]: Finished difference Result 66 states and 116 transitions. [2020-07-17 22:26:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 116 transitions. [2020-07-17 22:26:31,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:31,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:31,670 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 66 states. [2020-07-17 22:26:31,670 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 66 states. [2020-07-17 22:26:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:31,678 INFO L93 Difference]: Finished difference Result 66 states and 116 transitions. [2020-07-17 22:26:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 116 transitions. [2020-07-17 22:26:31,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:31,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:31,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:31,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-17 22:26:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2020-07-17 22:26:31,686 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2020-07-17 22:26:31,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:31,686 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2020-07-17 22:26:31,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2020-07-17 22:26:31,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:31,688 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:31,688 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:31,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:26:31,689 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:31,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:31,689 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2020-07-17 22:26:31,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:31,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423552205] [2020-07-17 22:26:31,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:31,750 INFO L280 TraceCheckUtils]: 0: Hoare triple {328#true} assume true; {328#true} is VALID [2020-07-17 22:26:31,750 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {328#true} {328#true} #180#return; {328#true} is VALID [2020-07-17 22:26:31,751 INFO L263 TraceCheckUtils]: 0: Hoare triple {328#true} call ULTIMATE.init(); {328#true} is VALID [2020-07-17 22:26:31,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {328#true} assume true; {328#true} is VALID [2020-07-17 22:26:31,751 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {328#true} {328#true} #180#return; {328#true} is VALID [2020-07-17 22:26:31,752 INFO L263 TraceCheckUtils]: 3: Hoare triple {328#true} call #t~ret10 := main(); {328#true} is VALID [2020-07-17 22:26:31,752 INFO L280 TraceCheckUtils]: 4: Hoare triple {328#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {328#true} is VALID [2020-07-17 22:26:31,752 INFO L280 TraceCheckUtils]: 5: Hoare triple {328#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {328#true} is VALID [2020-07-17 22:26:31,753 INFO L280 TraceCheckUtils]: 6: Hoare triple {328#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;~lk8~0 := 0;~lk9~0 := 0; {328#true} is VALID [2020-07-17 22:26:31,754 INFO L280 TraceCheckUtils]: 7: Hoare triple {328#true} assume !(0 != ~p1~0); {332#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:31,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:31,755 INFO L280 TraceCheckUtils]: 9: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:31,756 INFO L280 TraceCheckUtils]: 10: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:31,757 INFO L280 TraceCheckUtils]: 11: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:31,758 INFO L280 TraceCheckUtils]: 12: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:31,759 INFO L280 TraceCheckUtils]: 13: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:31,760 INFO L280 TraceCheckUtils]: 14: Hoare triple {332#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {332#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:31,761 INFO L280 TraceCheckUtils]: 15: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:31,762 INFO L280 TraceCheckUtils]: 16: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p1~0; {329#false} is VALID [2020-07-17 22:26:31,762 INFO L280 TraceCheckUtils]: 17: Hoare triple {329#false} assume 1 != ~lk1~0; {329#false} is VALID [2020-07-17 22:26:31,762 INFO L280 TraceCheckUtils]: 18: Hoare triple {329#false} assume !false; {329#false} is VALID [2020-07-17 22:26:31,764 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:31,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423552205] [2020-07-17 22:26:31,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:31,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:31,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237480424] [2020-07-17 22:26:31,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:31,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:31,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:31,794 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:31,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:31,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:31,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:31,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:31,795 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2020-07-17 22:26:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:31,934 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2020-07-17 22:26:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:31,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2020-07-17 22:26:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2020-07-17 22:26:31,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2020-07-17 22:26:32,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:32,164 INFO L225 Difference]: With dead ends: 107 [2020-07-17 22:26:32,165 INFO L226 Difference]: Without dead ends: 66 [2020-07-17 22:26:32,166 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:32,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-17 22:26:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-07-17 22:26:32,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:32,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2020-07-17 22:26:32,190 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2020-07-17 22:26:32,190 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2020-07-17 22:26:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:32,201 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2020-07-17 22:26:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 114 transitions. [2020-07-17 22:26:32,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:32,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:32,203 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2020-07-17 22:26:32,203 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2020-07-17 22:26:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:32,209 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2020-07-17 22:26:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 114 transitions. [2020-07-17 22:26:32,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:32,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:32,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:32,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-17 22:26:32,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2020-07-17 22:26:32,221 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2020-07-17 22:26:32,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:32,221 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2020-07-17 22:26:32,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2020-07-17 22:26:32,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:32,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:32,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] [2020-07-17 22:26:32,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:26:32,227 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:32,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:32,227 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2020-07-17 22:26:32,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:32,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527287604] [2020-07-17 22:26:32,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:32,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {655#true} assume true; {655#true} is VALID [2020-07-17 22:26:32,341 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {655#true} {655#true} #180#return; {655#true} is VALID [2020-07-17 22:26:32,341 INFO L263 TraceCheckUtils]: 0: Hoare triple {655#true} call ULTIMATE.init(); {655#true} is VALID [2020-07-17 22:26:32,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {655#true} assume true; {655#true} is VALID [2020-07-17 22:26:32,342 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {655#true} {655#true} #180#return; {655#true} is VALID [2020-07-17 22:26:32,342 INFO L263 TraceCheckUtils]: 3: Hoare triple {655#true} call #t~ret10 := main(); {655#true} is VALID [2020-07-17 22:26:32,342 INFO L280 TraceCheckUtils]: 4: Hoare triple {655#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {655#true} is VALID [2020-07-17 22:26:32,343 INFO L280 TraceCheckUtils]: 5: Hoare triple {655#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {655#true} is VALID [2020-07-17 22:26:32,343 INFO L280 TraceCheckUtils]: 6: Hoare triple {655#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;~lk8~0 := 0;~lk9~0 := 0; {655#true} is VALID [2020-07-17 22:26:32,348 INFO L280 TraceCheckUtils]: 7: Hoare triple {655#true} assume 0 != ~p1~0;~lk1~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:32,349 INFO L280 TraceCheckUtils]: 8: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:32,350 INFO L280 TraceCheckUtils]: 9: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:32,350 INFO L280 TraceCheckUtils]: 10: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:32,351 INFO L280 TraceCheckUtils]: 11: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:32,353 INFO L280 TraceCheckUtils]: 12: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:32,353 INFO L280 TraceCheckUtils]: 13: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p7~0;~lk7~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:32,354 INFO L280 TraceCheckUtils]: 14: Hoare triple {659#(not (= 0 main_~p1~0))} assume !(0 != ~p8~0); {659#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:32,355 INFO L280 TraceCheckUtils]: 15: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p9~0;~lk9~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:32,355 INFO L280 TraceCheckUtils]: 16: Hoare triple {659#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {656#false} is VALID [2020-07-17 22:26:32,356 INFO L280 TraceCheckUtils]: 17: Hoare triple {656#false} assume 0 != ~p2~0; {656#false} is VALID [2020-07-17 22:26:32,356 INFO L280 TraceCheckUtils]: 18: Hoare triple {656#false} assume 1 != ~lk2~0; {656#false} is VALID [2020-07-17 22:26:32,356 INFO L280 TraceCheckUtils]: 19: Hoare triple {656#false} assume !false; {656#false} is VALID [2020-07-17 22:26:32,357 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,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527287604] [2020-07-17 22:26:32,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:32,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:32,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576174858] [2020-07-17 22:26:32,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:32,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:32,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:32,386 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:32,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:32,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:32,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:32,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:32,387 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2020-07-17 22:26:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:32,527 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2020-07-17 22:26:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:32,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-17 22:26:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-17 22:26:32,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-17 22:26:32,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:32,733 INFO L225 Difference]: With dead ends: 99 [2020-07-17 22:26:32,733 INFO L226 Difference]: Without dead ends: 69 [2020-07-17 22:26:32,734 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:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-17 22:26:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2020-07-17 22:26:32,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:32,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2020-07-17 22:26:32,745 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2020-07-17 22:26:32,746 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2020-07-17 22:26:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:32,749 INFO L93 Difference]: Finished difference Result 69 states and 116 transitions. [2020-07-17 22:26:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 116 transitions. [2020-07-17 22:26:32,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:32,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:32,750 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2020-07-17 22:26:32,751 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2020-07-17 22:26:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:32,754 INFO L93 Difference]: Finished difference Result 69 states and 116 transitions. [2020-07-17 22:26:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 116 transitions. [2020-07-17 22:26:32,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:32,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:32,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:32,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-17 22:26:32,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2020-07-17 22:26:32,759 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2020-07-17 22:26:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:32,759 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2020-07-17 22:26:32,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:32,760 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2020-07-17 22:26:32,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:32,760 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:32,761 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:32,761 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:26:32,761 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:32,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2020-07-17 22:26:32,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:32,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920871491] [2020-07-17 22:26:32,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:32,814 INFO L280 TraceCheckUtils]: 0: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-17 22:26:32,815 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {985#true} {985#true} #180#return; {985#true} is VALID [2020-07-17 22:26:32,815 INFO L263 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2020-07-17 22:26:32,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-17 22:26:32,816 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {985#true} {985#true} #180#return; {985#true} is VALID [2020-07-17 22:26:32,816 INFO L263 TraceCheckUtils]: 3: Hoare triple {985#true} call #t~ret10 := main(); {985#true} is VALID [2020-07-17 22:26:32,816 INFO L280 TraceCheckUtils]: 4: Hoare triple {985#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {985#true} is VALID [2020-07-17 22:26:32,817 INFO L280 TraceCheckUtils]: 5: Hoare triple {985#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {985#true} is VALID [2020-07-17 22:26:32,817 INFO L280 TraceCheckUtils]: 6: Hoare triple {985#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;~lk8~0 := 0;~lk9~0 := 0; {985#true} is VALID [2020-07-17 22:26:32,817 INFO L280 TraceCheckUtils]: 7: Hoare triple {985#true} assume !(0 != ~p1~0); {985#true} is VALID [2020-07-17 22:26:32,819 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#true} assume 0 != ~p2~0;~lk2~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:32,819 INFO L280 TraceCheckUtils]: 9: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:32,820 INFO L280 TraceCheckUtils]: 10: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:32,821 INFO L280 TraceCheckUtils]: 11: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:32,821 INFO L280 TraceCheckUtils]: 12: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:32,822 INFO L280 TraceCheckUtils]: 13: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:32,823 INFO L280 TraceCheckUtils]: 14: Hoare triple {989#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {989#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:32,823 INFO L280 TraceCheckUtils]: 15: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:32,824 INFO L280 TraceCheckUtils]: 16: Hoare triple {989#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {989#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:32,825 INFO L280 TraceCheckUtils]: 17: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {989#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:32,826 INFO L280 TraceCheckUtils]: 18: Hoare triple {989#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {986#false} is VALID [2020-07-17 22:26:32,826 INFO L280 TraceCheckUtils]: 19: Hoare triple {986#false} assume !false; {986#false} is VALID [2020-07-17 22:26:32,827 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,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920871491] [2020-07-17 22:26:32,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:32,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:32,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271470953] [2020-07-17 22:26:32,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:32,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:32,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:32,852 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:32,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:32,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:32,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:32,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:32,853 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2020-07-17 22:26:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:32,972 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2020-07-17 22:26:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:32,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:32,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-17 22:26:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-17 22:26:32,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2020-07-17 22:26:33,117 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:33,124 INFO L225 Difference]: With dead ends: 124 [2020-07-17 22:26:33,127 INFO L226 Difference]: Without dead ends: 122 [2020-07-17 22:26:33,127 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:33,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-17 22:26:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2020-07-17 22:26:33,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:33,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 88 states. [2020-07-17 22:26:33,142 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 88 states. [2020-07-17 22:26:33,142 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 88 states. [2020-07-17 22:26:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:33,148 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2020-07-17 22:26:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 213 transitions. [2020-07-17 22:26:33,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:33,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:33,149 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 122 states. [2020-07-17 22:26:33,150 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 122 states. [2020-07-17 22:26:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:33,155 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2020-07-17 22:26:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 213 transitions. [2020-07-17 22:26:33,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:33,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:33,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:33,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-17 22:26:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2020-07-17 22:26:33,161 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2020-07-17 22:26:33,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:33,161 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2020-07-17 22:26:33,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2020-07-17 22:26:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:33,162 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:33,162 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:33,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:26:33,163 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:33,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:33,163 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2020-07-17 22:26:33,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:33,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994650192] [2020-07-17 22:26:33,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:33,201 INFO L280 TraceCheckUtils]: 0: Hoare triple {1468#true} assume true; {1468#true} is VALID [2020-07-17 22:26:33,201 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1468#true} {1468#true} #180#return; {1468#true} is VALID [2020-07-17 22:26:33,201 INFO L263 TraceCheckUtils]: 0: Hoare triple {1468#true} call ULTIMATE.init(); {1468#true} is VALID [2020-07-17 22:26:33,202 INFO L280 TraceCheckUtils]: 1: Hoare triple {1468#true} assume true; {1468#true} is VALID [2020-07-17 22:26:33,202 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1468#true} {1468#true} #180#return; {1468#true} is VALID [2020-07-17 22:26:33,202 INFO L263 TraceCheckUtils]: 3: Hoare triple {1468#true} call #t~ret10 := main(); {1468#true} is VALID [2020-07-17 22:26:33,203 INFO L280 TraceCheckUtils]: 4: Hoare triple {1468#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {1468#true} is VALID [2020-07-17 22:26:33,203 INFO L280 TraceCheckUtils]: 5: Hoare triple {1468#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {1468#true} is VALID [2020-07-17 22:26:33,203 INFO L280 TraceCheckUtils]: 6: Hoare triple {1468#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;~lk8~0 := 0;~lk9~0 := 0; {1468#true} is VALID [2020-07-17 22:26:33,203 INFO L280 TraceCheckUtils]: 7: Hoare triple {1468#true} assume !(0 != ~p1~0); {1468#true} is VALID [2020-07-17 22:26:33,204 INFO L280 TraceCheckUtils]: 8: Hoare triple {1468#true} assume !(0 != ~p2~0); {1472#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:33,205 INFO L280 TraceCheckUtils]: 9: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1472#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:33,206 INFO L280 TraceCheckUtils]: 10: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1472#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:33,206 INFO L280 TraceCheckUtils]: 11: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1472#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:33,207 INFO L280 TraceCheckUtils]: 12: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1472#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:33,208 INFO L280 TraceCheckUtils]: 13: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1472#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:33,208 INFO L280 TraceCheckUtils]: 14: Hoare triple {1472#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {1472#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:33,209 INFO L280 TraceCheckUtils]: 15: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1472#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:33,210 INFO L280 TraceCheckUtils]: 16: Hoare triple {1472#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1472#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:33,210 INFO L280 TraceCheckUtils]: 17: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1469#false} is VALID [2020-07-17 22:26:33,211 INFO L280 TraceCheckUtils]: 18: Hoare triple {1469#false} assume 1 != ~lk2~0; {1469#false} is VALID [2020-07-17 22:26:33,211 INFO L280 TraceCheckUtils]: 19: Hoare triple {1469#false} assume !false; {1469#false} is VALID [2020-07-17 22:26:33,212 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:33,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994650192] [2020-07-17 22:26:33,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:33,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:33,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569083593] [2020-07-17 22:26:33,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:33,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:33,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:33,233 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:33,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:33,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:33,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:33,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:33,234 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2020-07-17 22:26:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:33,360 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2020-07-17 22:26:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:33,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2020-07-17 22:26:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2020-07-17 22:26:33,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2020-07-17 22:26:33,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:33,563 INFO L225 Difference]: With dead ends: 204 [2020-07-17 22:26:33,563 INFO L226 Difference]: Without dead ends: 124 [2020-07-17 22:26:33,564 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:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-07-17 22:26:33,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2020-07-17 22:26:33,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:33,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 122 states. [2020-07-17 22:26:33,584 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 122 states. [2020-07-17 22:26:33,584 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 122 states. [2020-07-17 22:26:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:33,590 INFO L93 Difference]: Finished difference Result 124 states and 211 transitions. [2020-07-17 22:26:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 211 transitions. [2020-07-17 22:26:33,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:33,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:33,591 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 124 states. [2020-07-17 22:26:33,591 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 124 states. [2020-07-17 22:26:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:33,596 INFO L93 Difference]: Finished difference Result 124 states and 211 transitions. [2020-07-17 22:26:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 211 transitions. [2020-07-17 22:26:33,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:33,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:33,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:33,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-17 22:26:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2020-07-17 22:26:33,603 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2020-07-17 22:26:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:33,603 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2020-07-17 22:26:33,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2020-07-17 22:26:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:33,604 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:33,604 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:33,605 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:26:33,605 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:33,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:33,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2020-07-17 22:26:33,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:33,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661704774] [2020-07-17 22:26:33,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:33,643 INFO L280 TraceCheckUtils]: 0: Hoare triple {2073#true} assume true; {2073#true} is VALID [2020-07-17 22:26:33,644 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2073#true} {2073#true} #180#return; {2073#true} is VALID [2020-07-17 22:26:33,644 INFO L263 TraceCheckUtils]: 0: Hoare triple {2073#true} call ULTIMATE.init(); {2073#true} is VALID [2020-07-17 22:26:33,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {2073#true} assume true; {2073#true} is VALID [2020-07-17 22:26:33,645 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2073#true} {2073#true} #180#return; {2073#true} is VALID [2020-07-17 22:26:33,645 INFO L263 TraceCheckUtils]: 3: Hoare triple {2073#true} call #t~ret10 := main(); {2073#true} is VALID [2020-07-17 22:26:33,645 INFO L280 TraceCheckUtils]: 4: Hoare triple {2073#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {2073#true} is VALID [2020-07-17 22:26:33,646 INFO L280 TraceCheckUtils]: 5: Hoare triple {2073#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2073#true} is VALID [2020-07-17 22:26:33,646 INFO L280 TraceCheckUtils]: 6: Hoare triple {2073#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;~lk8~0 := 0;~lk9~0 := 0; {2073#true} is VALID [2020-07-17 22:26:33,646 INFO L280 TraceCheckUtils]: 7: Hoare triple {2073#true} assume !(0 != ~p1~0); {2073#true} is VALID [2020-07-17 22:26:33,647 INFO L280 TraceCheckUtils]: 8: Hoare triple {2073#true} assume 0 != ~p2~0;~lk2~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:33,648 INFO L280 TraceCheckUtils]: 9: Hoare triple {2077#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:33,648 INFO L280 TraceCheckUtils]: 10: Hoare triple {2077#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:33,649 INFO L280 TraceCheckUtils]: 11: Hoare triple {2077#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:33,649 INFO L280 TraceCheckUtils]: 12: Hoare triple {2077#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:33,650 INFO L280 TraceCheckUtils]: 13: Hoare triple {2077#(not (= 0 main_~p2~0))} assume 0 != ~p7~0;~lk7~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:33,651 INFO L280 TraceCheckUtils]: 14: Hoare triple {2077#(not (= 0 main_~p2~0))} assume !(0 != ~p8~0); {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:33,651 INFO L280 TraceCheckUtils]: 15: Hoare triple {2077#(not (= 0 main_~p2~0))} assume 0 != ~p9~0;~lk9~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:33,652 INFO L280 TraceCheckUtils]: 16: Hoare triple {2077#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:33,653 INFO L280 TraceCheckUtils]: 17: Hoare triple {2077#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {2074#false} is VALID [2020-07-17 22:26:33,653 INFO L280 TraceCheckUtils]: 18: Hoare triple {2074#false} assume 0 != ~p3~0; {2074#false} is VALID [2020-07-17 22:26:33,653 INFO L280 TraceCheckUtils]: 19: Hoare triple {2074#false} assume 1 != ~lk3~0; {2074#false} is VALID [2020-07-17 22:26:33,653 INFO L280 TraceCheckUtils]: 20: Hoare triple {2074#false} assume !false; {2074#false} is VALID [2020-07-17 22:26:33,654 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:33,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661704774] [2020-07-17 22:26:33,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:33,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:33,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673826032] [2020-07-17 22:26:33,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:33,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:33,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:33,677 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:33,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:33,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:33,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:33,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:33,678 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2020-07-17 22:26:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:33,816 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2020-07-17 22:26:33,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:33,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:33,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2020-07-17 22:26:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2020-07-17 22:26:33,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 165 transitions. [2020-07-17 22:26:33,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:33,986 INFO L225 Difference]: With dead ends: 183 [2020-07-17 22:26:33,986 INFO L226 Difference]: Without dead ends: 126 [2020-07-17 22:26:33,987 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:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-07-17 22:26:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2020-07-17 22:26:34,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:34,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 124 states. [2020-07-17 22:26:34,025 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 124 states. [2020-07-17 22:26:34,025 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 124 states. [2020-07-17 22:26:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:34,033 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2020-07-17 22:26:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 211 transitions. [2020-07-17 22:26:34,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:34,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:34,034 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 126 states. [2020-07-17 22:26:34,034 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 126 states. [2020-07-17 22:26:34,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:34,038 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2020-07-17 22:26:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 211 transitions. [2020-07-17 22:26:34,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:34,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:34,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:34,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-07-17 22:26:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2020-07-17 22:26:34,044 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2020-07-17 22:26:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:34,044 INFO L479 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2020-07-17 22:26:34,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2020-07-17 22:26:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:34,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:34,045 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:34,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:26:34,045 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:34,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:34,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2020-07-17 22:26:34,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:34,046 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313651131] [2020-07-17 22:26:34,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:34,078 INFO L280 TraceCheckUtils]: 0: Hoare triple {2663#true} assume true; {2663#true} is VALID [2020-07-17 22:26:34,079 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2663#true} {2663#true} #180#return; {2663#true} is VALID [2020-07-17 22:26:34,079 INFO L263 TraceCheckUtils]: 0: Hoare triple {2663#true} call ULTIMATE.init(); {2663#true} is VALID [2020-07-17 22:26:34,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {2663#true} assume true; {2663#true} is VALID [2020-07-17 22:26:34,080 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2663#true} {2663#true} #180#return; {2663#true} is VALID [2020-07-17 22:26:34,080 INFO L263 TraceCheckUtils]: 3: Hoare triple {2663#true} call #t~ret10 := main(); {2663#true} is VALID [2020-07-17 22:26:34,080 INFO L280 TraceCheckUtils]: 4: Hoare triple {2663#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {2663#true} is VALID [2020-07-17 22:26:34,080 INFO L280 TraceCheckUtils]: 5: Hoare triple {2663#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2663#true} is VALID [2020-07-17 22:26:34,081 INFO L280 TraceCheckUtils]: 6: Hoare triple {2663#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;~lk8~0 := 0;~lk9~0 := 0; {2663#true} is VALID [2020-07-17 22:26:34,081 INFO L280 TraceCheckUtils]: 7: Hoare triple {2663#true} assume !(0 != ~p1~0); {2663#true} is VALID [2020-07-17 22:26:34,081 INFO L280 TraceCheckUtils]: 8: Hoare triple {2663#true} assume !(0 != ~p2~0); {2663#true} is VALID [2020-07-17 22:26:34,082 INFO L280 TraceCheckUtils]: 9: Hoare triple {2663#true} assume 0 != ~p3~0;~lk3~0 := 1; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:34,082 INFO L280 TraceCheckUtils]: 10: Hoare triple {2667#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:34,083 INFO L280 TraceCheckUtils]: 11: Hoare triple {2667#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:34,083 INFO L280 TraceCheckUtils]: 12: Hoare triple {2667#(= 1 main_~lk3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:34,084 INFO L280 TraceCheckUtils]: 13: Hoare triple {2667#(= 1 main_~lk3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:34,085 INFO L280 TraceCheckUtils]: 14: Hoare triple {2667#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {2667#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:34,085 INFO L280 TraceCheckUtils]: 15: Hoare triple {2667#(= 1 main_~lk3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:34,086 INFO L280 TraceCheckUtils]: 16: Hoare triple {2667#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {2667#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:34,086 INFO L280 TraceCheckUtils]: 17: Hoare triple {2667#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {2667#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:34,087 INFO L280 TraceCheckUtils]: 18: Hoare triple {2667#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:34,087 INFO L280 TraceCheckUtils]: 19: Hoare triple {2667#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {2664#false} is VALID [2020-07-17 22:26:34,088 INFO L280 TraceCheckUtils]: 20: Hoare triple {2664#false} assume !false; {2664#false} is VALID [2020-07-17 22:26:34,088 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:34,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313651131] [2020-07-17 22:26:34,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:34,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:34,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910892468] [2020-07-17 22:26:34,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:34,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:34,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:34,109 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:34,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:34,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:34,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:34,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:34,110 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2020-07-17 22:26:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:34,240 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2020-07-17 22:26:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:34,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-17 22:26:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-17 22:26:34,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-17 22:26:34,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:34,366 INFO L225 Difference]: With dead ends: 228 [2020-07-17 22:26:34,367 INFO L226 Difference]: Without dead ends: 226 [2020-07-17 22:26:34,367 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,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-07-17 22:26:34,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2020-07-17 22:26:34,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:34,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand 168 states. [2020-07-17 22:26:34,387 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 168 states. [2020-07-17 22:26:34,387 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 168 states. [2020-07-17 22:26:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:34,397 INFO L93 Difference]: Finished difference Result 226 states and 387 transitions. [2020-07-17 22:26:34,397 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 387 transitions. [2020-07-17 22:26:34,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:34,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:34,398 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 226 states. [2020-07-17 22:26:34,398 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 226 states. [2020-07-17 22:26:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:34,408 INFO L93 Difference]: Finished difference Result 226 states and 387 transitions. [2020-07-17 22:26:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 387 transitions. [2020-07-17 22:26:34,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:34,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:34,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:34,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-07-17 22:26:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2020-07-17 22:26:34,416 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2020-07-17 22:26:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:34,416 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2020-07-17 22:26:34,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2020-07-17 22:26:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:34,417 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:34,418 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:34,418 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:26:34,418 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:34,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:34,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2020-07-17 22:26:34,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:34,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039308247] [2020-07-17 22:26:34,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:34,449 INFO L280 TraceCheckUtils]: 0: Hoare triple {3544#true} assume true; {3544#true} is VALID [2020-07-17 22:26:34,449 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3544#true} {3544#true} #180#return; {3544#true} is VALID [2020-07-17 22:26:34,450 INFO L263 TraceCheckUtils]: 0: Hoare triple {3544#true} call ULTIMATE.init(); {3544#true} is VALID [2020-07-17 22:26:34,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {3544#true} assume true; {3544#true} is VALID [2020-07-17 22:26:34,450 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3544#true} {3544#true} #180#return; {3544#true} is VALID [2020-07-17 22:26:34,450 INFO L263 TraceCheckUtils]: 3: Hoare triple {3544#true} call #t~ret10 := main(); {3544#true} is VALID [2020-07-17 22:26:34,451 INFO L280 TraceCheckUtils]: 4: Hoare triple {3544#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {3544#true} is VALID [2020-07-17 22:26:34,451 INFO L280 TraceCheckUtils]: 5: Hoare triple {3544#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {3544#true} is VALID [2020-07-17 22:26:34,451 INFO L280 TraceCheckUtils]: 6: Hoare triple {3544#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;~lk8~0 := 0;~lk9~0 := 0; {3544#true} is VALID [2020-07-17 22:26:34,451 INFO L280 TraceCheckUtils]: 7: Hoare triple {3544#true} assume !(0 != ~p1~0); {3544#true} is VALID [2020-07-17 22:26:34,452 INFO L280 TraceCheckUtils]: 8: Hoare triple {3544#true} assume !(0 != ~p2~0); {3544#true} is VALID [2020-07-17 22:26:34,452 INFO L280 TraceCheckUtils]: 9: Hoare triple {3544#true} assume !(0 != ~p3~0); {3548#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:34,453 INFO L280 TraceCheckUtils]: 10: Hoare triple {3548#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {3548#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:34,453 INFO L280 TraceCheckUtils]: 11: Hoare triple {3548#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {3548#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:34,454 INFO L280 TraceCheckUtils]: 12: Hoare triple {3548#(= 0 main_~p3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {3548#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:34,455 INFO L280 TraceCheckUtils]: 13: Hoare triple {3548#(= 0 main_~p3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {3548#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:34,455 INFO L280 TraceCheckUtils]: 14: Hoare triple {3548#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {3548#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:34,456 INFO L280 TraceCheckUtils]: 15: Hoare triple {3548#(= 0 main_~p3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {3548#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:34,457 INFO L280 TraceCheckUtils]: 16: Hoare triple {3548#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {3548#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:34,457 INFO L280 TraceCheckUtils]: 17: Hoare triple {3548#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {3548#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:34,458 INFO L280 TraceCheckUtils]: 18: Hoare triple {3548#(= 0 main_~p3~0)} assume 0 != ~p3~0; {3545#false} is VALID [2020-07-17 22:26:34,458 INFO L280 TraceCheckUtils]: 19: Hoare triple {3545#false} assume 1 != ~lk3~0; {3545#false} is VALID [2020-07-17 22:26:34,459 INFO L280 TraceCheckUtils]: 20: Hoare triple {3545#false} assume !false; {3545#false} is VALID [2020-07-17 22:26:34,459 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:34,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039308247] [2020-07-17 22:26:34,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:34,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:34,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074661871] [2020-07-17 22:26:34,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:34,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:34,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:34,482 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:34,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:34,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:34,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:34,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:34,484 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2020-07-17 22:26:34,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:34,628 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2020-07-17 22:26:34,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:34,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2020-07-17 22:26:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2020-07-17 22:26:34,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2020-07-17 22:26:34,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:34,817 INFO L225 Difference]: With dead ends: 392 [2020-07-17 22:26:34,817 INFO L226 Difference]: Without dead ends: 234 [2020-07-17 22:26:34,818 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,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-07-17 22:26:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2020-07-17 22:26:34,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:34,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 232 states. [2020-07-17 22:26:34,852 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 232 states. [2020-07-17 22:26:34,852 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 232 states. [2020-07-17 22:26:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:34,862 INFO L93 Difference]: Finished difference Result 234 states and 387 transitions. [2020-07-17 22:26:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 387 transitions. [2020-07-17 22:26:34,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:34,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:34,863 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 234 states. [2020-07-17 22:26:34,863 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 234 states. [2020-07-17 22:26:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:34,873 INFO L93 Difference]: Finished difference Result 234 states and 387 transitions. [2020-07-17 22:26:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 387 transitions. [2020-07-17 22:26:34,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:34,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:34,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:34,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-07-17 22:26:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2020-07-17 22:26:34,884 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2020-07-17 22:26:34,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:34,885 INFO L479 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2020-07-17 22:26:34,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:34,885 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2020-07-17 22:26:34,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:34,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:34,886 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:34,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:26:34,886 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:34,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:34,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2020-07-17 22:26:34,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:34,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946847345] [2020-07-17 22:26:34,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:34,917 INFO L280 TraceCheckUtils]: 0: Hoare triple {4677#true} assume true; {4677#true} is VALID [2020-07-17 22:26:34,917 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4677#true} {4677#true} #180#return; {4677#true} is VALID [2020-07-17 22:26:34,918 INFO L263 TraceCheckUtils]: 0: Hoare triple {4677#true} call ULTIMATE.init(); {4677#true} is VALID [2020-07-17 22:26:34,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {4677#true} assume true; {4677#true} is VALID [2020-07-17 22:26:34,918 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4677#true} {4677#true} #180#return; {4677#true} is VALID [2020-07-17 22:26:34,918 INFO L263 TraceCheckUtils]: 3: Hoare triple {4677#true} call #t~ret10 := main(); {4677#true} is VALID [2020-07-17 22:26:34,918 INFO L280 TraceCheckUtils]: 4: Hoare triple {4677#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {4677#true} is VALID [2020-07-17 22:26:34,919 INFO L280 TraceCheckUtils]: 5: Hoare triple {4677#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {4677#true} is VALID [2020-07-17 22:26:34,919 INFO L280 TraceCheckUtils]: 6: Hoare triple {4677#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;~lk8~0 := 0;~lk9~0 := 0; {4677#true} is VALID [2020-07-17 22:26:34,919 INFO L280 TraceCheckUtils]: 7: Hoare triple {4677#true} assume !(0 != ~p1~0); {4677#true} is VALID [2020-07-17 22:26:34,919 INFO L280 TraceCheckUtils]: 8: Hoare triple {4677#true} assume !(0 != ~p2~0); {4677#true} is VALID [2020-07-17 22:26:34,920 INFO L280 TraceCheckUtils]: 9: Hoare triple {4677#true} assume 0 != ~p3~0;~lk3~0 := 1; {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:34,921 INFO L280 TraceCheckUtils]: 10: Hoare triple {4681#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:34,921 INFO L280 TraceCheckUtils]: 11: Hoare triple {4681#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:34,922 INFO L280 TraceCheckUtils]: 12: Hoare triple {4681#(not (= 0 main_~p3~0))} assume 0 != ~p6~0;~lk6~0 := 1; {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:34,923 INFO L280 TraceCheckUtils]: 13: Hoare triple {4681#(not (= 0 main_~p3~0))} assume 0 != ~p7~0;~lk7~0 := 1; {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:34,923 INFO L280 TraceCheckUtils]: 14: Hoare triple {4681#(not (= 0 main_~p3~0))} assume !(0 != ~p8~0); {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:34,924 INFO L280 TraceCheckUtils]: 15: Hoare triple {4681#(not (= 0 main_~p3~0))} assume 0 != ~p9~0;~lk9~0 := 1; {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:34,924 INFO L280 TraceCheckUtils]: 16: Hoare triple {4681#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:34,925 INFO L280 TraceCheckUtils]: 17: Hoare triple {4681#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:34,926 INFO L280 TraceCheckUtils]: 18: Hoare triple {4681#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {4678#false} is VALID [2020-07-17 22:26:34,926 INFO L280 TraceCheckUtils]: 19: Hoare triple {4678#false} assume 0 != ~p4~0; {4678#false} is VALID [2020-07-17 22:26:34,926 INFO L280 TraceCheckUtils]: 20: Hoare triple {4678#false} assume 1 != ~lk4~0; {4678#false} is VALID [2020-07-17 22:26:34,926 INFO L280 TraceCheckUtils]: 21: Hoare triple {4678#false} assume !false; {4678#false} is VALID [2020-07-17 22:26:34,927 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:34,928 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946847345] [2020-07-17 22:26:34,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:34,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:34,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909721348] [2020-07-17 22:26:34,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:34,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:34,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:34,955 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:34,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:34,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:34,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:34,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:34,957 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2020-07-17 22:26:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:35,124 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2020-07-17 22:26:35,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:35,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:35,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-17 22:26:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-17 22:26:35,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2020-07-17 22:26:35,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:35,319 INFO L225 Difference]: With dead ends: 348 [2020-07-17 22:26:35,319 INFO L226 Difference]: Without dead ends: 238 [2020-07-17 22:26:35,320 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:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-17 22:26:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2020-07-17 22:26:35,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:35,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand 236 states. [2020-07-17 22:26:35,375 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 236 states. [2020-07-17 22:26:35,375 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 236 states. [2020-07-17 22:26:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:35,383 INFO L93 Difference]: Finished difference Result 238 states and 387 transitions. [2020-07-17 22:26:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 387 transitions. [2020-07-17 22:26:35,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:35,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:35,384 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 238 states. [2020-07-17 22:26:35,384 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 238 states. [2020-07-17 22:26:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:35,392 INFO L93 Difference]: Finished difference Result 238 states and 387 transitions. [2020-07-17 22:26:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 387 transitions. [2020-07-17 22:26:35,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:35,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:35,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:35,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:35,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-07-17 22:26:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2020-07-17 22:26:35,401 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2020-07-17 22:26:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:35,401 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2020-07-17 22:26:35,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2020-07-17 22:26:35,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:35,402 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:35,402 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:35,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 22:26:35,403 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:35,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:35,403 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2020-07-17 22:26:35,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:35,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076902839] [2020-07-17 22:26:35,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:35,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {5778#true} assume true; {5778#true} is VALID [2020-07-17 22:26:35,434 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5778#true} {5778#true} #180#return; {5778#true} is VALID [2020-07-17 22:26:35,434 INFO L263 TraceCheckUtils]: 0: Hoare triple {5778#true} call ULTIMATE.init(); {5778#true} is VALID [2020-07-17 22:26:35,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {5778#true} assume true; {5778#true} is VALID [2020-07-17 22:26:35,435 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5778#true} {5778#true} #180#return; {5778#true} is VALID [2020-07-17 22:26:35,435 INFO L263 TraceCheckUtils]: 3: Hoare triple {5778#true} call #t~ret10 := main(); {5778#true} is VALID [2020-07-17 22:26:35,435 INFO L280 TraceCheckUtils]: 4: Hoare triple {5778#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {5778#true} is VALID [2020-07-17 22:26:35,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {5778#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {5778#true} is VALID [2020-07-17 22:26:35,436 INFO L280 TraceCheckUtils]: 6: Hoare triple {5778#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;~lk8~0 := 0;~lk9~0 := 0; {5778#true} is VALID [2020-07-17 22:26:35,436 INFO L280 TraceCheckUtils]: 7: Hoare triple {5778#true} assume !(0 != ~p1~0); {5778#true} is VALID [2020-07-17 22:26:35,436 INFO L280 TraceCheckUtils]: 8: Hoare triple {5778#true} assume !(0 != ~p2~0); {5778#true} is VALID [2020-07-17 22:26:35,437 INFO L280 TraceCheckUtils]: 9: Hoare triple {5778#true} assume !(0 != ~p3~0); {5778#true} is VALID [2020-07-17 22:26:35,437 INFO L280 TraceCheckUtils]: 10: Hoare triple {5778#true} assume 0 != ~p4~0;~lk4~0 := 1; {5782#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:35,438 INFO L280 TraceCheckUtils]: 11: Hoare triple {5782#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {5782#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:35,439 INFO L280 TraceCheckUtils]: 12: Hoare triple {5782#(= 1 main_~lk4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {5782#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:35,439 INFO L280 TraceCheckUtils]: 13: Hoare triple {5782#(= 1 main_~lk4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {5782#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:35,440 INFO L280 TraceCheckUtils]: 14: Hoare triple {5782#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {5782#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:35,441 INFO L280 TraceCheckUtils]: 15: Hoare triple {5782#(= 1 main_~lk4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {5782#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:35,441 INFO L280 TraceCheckUtils]: 16: Hoare triple {5782#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {5782#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:35,442 INFO L280 TraceCheckUtils]: 17: Hoare triple {5782#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {5782#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:35,442 INFO L280 TraceCheckUtils]: 18: Hoare triple {5782#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {5782#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:35,443 INFO L280 TraceCheckUtils]: 19: Hoare triple {5782#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {5782#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:35,443 INFO L280 TraceCheckUtils]: 20: Hoare triple {5782#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {5779#false} is VALID [2020-07-17 22:26:35,444 INFO L280 TraceCheckUtils]: 21: Hoare triple {5779#false} assume !false; {5779#false} is VALID [2020-07-17 22:26:35,444 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:35,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076902839] [2020-07-17 22:26:35,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:35,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:35,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274759334] [2020-07-17 22:26:35,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:35,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:35,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:35,467 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:35,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:35,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:35,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:35,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:35,469 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2020-07-17 22:26:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:35,630 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2020-07-17 22:26:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:35,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-17 22:26:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-17 22:26:35,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2020-07-17 22:26:35,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:35,762 INFO L225 Difference]: With dead ends: 428 [2020-07-17 22:26:35,762 INFO L226 Difference]: Without dead ends: 426 [2020-07-17 22:26:35,763 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:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-07-17 22:26:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2020-07-17 22:26:35,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:35,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 426 states. Second operand 328 states. [2020-07-17 22:26:35,798 INFO L74 IsIncluded]: Start isIncluded. First operand 426 states. Second operand 328 states. [2020-07-17 22:26:35,798 INFO L87 Difference]: Start difference. First operand 426 states. Second operand 328 states. [2020-07-17 22:26:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:35,813 INFO L93 Difference]: Finished difference Result 426 states and 703 transitions. [2020-07-17 22:26:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 703 transitions. [2020-07-17 22:26:35,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:35,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:35,815 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand 426 states. [2020-07-17 22:26:35,815 INFO L87 Difference]: Start difference. First operand 328 states. Second operand 426 states. [2020-07-17 22:26:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:35,830 INFO L93 Difference]: Finished difference Result 426 states and 703 transitions. [2020-07-17 22:26:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 703 transitions. [2020-07-17 22:26:35,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:35,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:35,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:35,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-07-17 22:26:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2020-07-17 22:26:35,841 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2020-07-17 22:26:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:35,842 INFO L479 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2020-07-17 22:26:35,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2020-07-17 22:26:35,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:35,843 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:35,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:35,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 22:26:35,843 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:35,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:35,843 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2020-07-17 22:26:35,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:35,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933777998] [2020-07-17 22:26:35,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:35,869 INFO L280 TraceCheckUtils]: 0: Hoare triple {7431#true} assume true; {7431#true} is VALID [2020-07-17 22:26:35,869 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7431#true} {7431#true} #180#return; {7431#true} is VALID [2020-07-17 22:26:35,869 INFO L263 TraceCheckUtils]: 0: Hoare triple {7431#true} call ULTIMATE.init(); {7431#true} is VALID [2020-07-17 22:26:35,870 INFO L280 TraceCheckUtils]: 1: Hoare triple {7431#true} assume true; {7431#true} is VALID [2020-07-17 22:26:35,870 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7431#true} {7431#true} #180#return; {7431#true} is VALID [2020-07-17 22:26:35,870 INFO L263 TraceCheckUtils]: 3: Hoare triple {7431#true} call #t~ret10 := main(); {7431#true} is VALID [2020-07-17 22:26:35,870 INFO L280 TraceCheckUtils]: 4: Hoare triple {7431#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {7431#true} is VALID [2020-07-17 22:26:35,871 INFO L280 TraceCheckUtils]: 5: Hoare triple {7431#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {7431#true} is VALID [2020-07-17 22:26:35,871 INFO L280 TraceCheckUtils]: 6: Hoare triple {7431#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;~lk8~0 := 0;~lk9~0 := 0; {7431#true} is VALID [2020-07-17 22:26:35,871 INFO L280 TraceCheckUtils]: 7: Hoare triple {7431#true} assume !(0 != ~p1~0); {7431#true} is VALID [2020-07-17 22:26:35,871 INFO L280 TraceCheckUtils]: 8: Hoare triple {7431#true} assume !(0 != ~p2~0); {7431#true} is VALID [2020-07-17 22:26:35,871 INFO L280 TraceCheckUtils]: 9: Hoare triple {7431#true} assume !(0 != ~p3~0); {7431#true} is VALID [2020-07-17 22:26:35,872 INFO L280 TraceCheckUtils]: 10: Hoare triple {7431#true} assume !(0 != ~p4~0); {7435#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:35,873 INFO L280 TraceCheckUtils]: 11: Hoare triple {7435#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {7435#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:35,873 INFO L280 TraceCheckUtils]: 12: Hoare triple {7435#(= 0 main_~p4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {7435#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:35,874 INFO L280 TraceCheckUtils]: 13: Hoare triple {7435#(= 0 main_~p4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {7435#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:35,874 INFO L280 TraceCheckUtils]: 14: Hoare triple {7435#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {7435#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:35,875 INFO L280 TraceCheckUtils]: 15: Hoare triple {7435#(= 0 main_~p4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {7435#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:35,875 INFO L280 TraceCheckUtils]: 16: Hoare triple {7435#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {7435#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:35,876 INFO L280 TraceCheckUtils]: 17: Hoare triple {7435#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {7435#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:35,876 INFO L280 TraceCheckUtils]: 18: Hoare triple {7435#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {7435#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:35,877 INFO L280 TraceCheckUtils]: 19: Hoare triple {7435#(= 0 main_~p4~0)} assume 0 != ~p4~0; {7432#false} is VALID [2020-07-17 22:26:35,877 INFO L280 TraceCheckUtils]: 20: Hoare triple {7432#false} assume 1 != ~lk4~0; {7432#false} is VALID [2020-07-17 22:26:35,877 INFO L280 TraceCheckUtils]: 21: Hoare triple {7432#false} assume !false; {7432#false} is VALID [2020-07-17 22:26:35,878 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:35,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933777998] [2020-07-17 22:26:35,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:35,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:35,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313332470] [2020-07-17 22:26:35,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:35,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:35,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:35,900 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:35,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:35,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:35,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:35,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:35,902 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2020-07-17 22:26:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:36,092 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2020-07-17 22:26:36,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:36,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-17 22:26:36,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-17 22:26:36,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2020-07-17 22:26:36,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:36,246 INFO L225 Difference]: With dead ends: 764 [2020-07-17 22:26:36,246 INFO L226 Difference]: Without dead ends: 450 [2020-07-17 22:26:36,247 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:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-07-17 22:26:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2020-07-17 22:26:36,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:36,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 450 states. Second operand 448 states. [2020-07-17 22:26:36,323 INFO L74 IsIncluded]: Start isIncluded. First operand 450 states. Second operand 448 states. [2020-07-17 22:26:36,324 INFO L87 Difference]: Start difference. First operand 450 states. Second operand 448 states. [2020-07-17 22:26:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:36,357 INFO L93 Difference]: Finished difference Result 450 states and 711 transitions. [2020-07-17 22:26:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 711 transitions. [2020-07-17 22:26:36,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:36,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:36,359 INFO L74 IsIncluded]: Start isIncluded. First operand 448 states. Second operand 450 states. [2020-07-17 22:26:36,359 INFO L87 Difference]: Start difference. First operand 448 states. Second operand 450 states. [2020-07-17 22:26:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:36,379 INFO L93 Difference]: Finished difference Result 450 states and 711 transitions. [2020-07-17 22:26:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 711 transitions. [2020-07-17 22:26:36,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:36,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:36,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:36,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-07-17 22:26:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2020-07-17 22:26:36,401 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2020-07-17 22:26:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:36,401 INFO L479 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2020-07-17 22:26:36,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2020-07-17 22:26:36,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:36,403 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:36,403 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:36,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 22:26:36,404 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:36,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:36,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2020-07-17 22:26:36,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:36,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355386326] [2020-07-17 22:26:36,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:36,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {9604#true} assume true; {9604#true} is VALID [2020-07-17 22:26:36,435 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9604#true} {9604#true} #180#return; {9604#true} is VALID [2020-07-17 22:26:36,435 INFO L263 TraceCheckUtils]: 0: Hoare triple {9604#true} call ULTIMATE.init(); {9604#true} is VALID [2020-07-17 22:26:36,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {9604#true} assume true; {9604#true} is VALID [2020-07-17 22:26:36,436 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9604#true} {9604#true} #180#return; {9604#true} is VALID [2020-07-17 22:26:36,436 INFO L263 TraceCheckUtils]: 3: Hoare triple {9604#true} call #t~ret10 := main(); {9604#true} is VALID [2020-07-17 22:26:36,436 INFO L280 TraceCheckUtils]: 4: Hoare triple {9604#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {9604#true} is VALID [2020-07-17 22:26:36,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {9604#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {9604#true} is VALID [2020-07-17 22:26:36,436 INFO L280 TraceCheckUtils]: 6: Hoare triple {9604#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;~lk8~0 := 0;~lk9~0 := 0; {9604#true} is VALID [2020-07-17 22:26:36,437 INFO L280 TraceCheckUtils]: 7: Hoare triple {9604#true} assume !(0 != ~p1~0); {9604#true} is VALID [2020-07-17 22:26:36,437 INFO L280 TraceCheckUtils]: 8: Hoare triple {9604#true} assume !(0 != ~p2~0); {9604#true} is VALID [2020-07-17 22:26:36,437 INFO L280 TraceCheckUtils]: 9: Hoare triple {9604#true} assume !(0 != ~p3~0); {9604#true} is VALID [2020-07-17 22:26:36,438 INFO L280 TraceCheckUtils]: 10: Hoare triple {9604#true} assume 0 != ~p4~0;~lk4~0 := 1; {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:36,438 INFO L280 TraceCheckUtils]: 11: Hoare triple {9608#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:36,439 INFO L280 TraceCheckUtils]: 12: Hoare triple {9608#(not (= 0 main_~p4~0))} assume 0 != ~p6~0;~lk6~0 := 1; {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:36,440 INFO L280 TraceCheckUtils]: 13: Hoare triple {9608#(not (= 0 main_~p4~0))} assume 0 != ~p7~0;~lk7~0 := 1; {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:36,440 INFO L280 TraceCheckUtils]: 14: Hoare triple {9608#(not (= 0 main_~p4~0))} assume !(0 != ~p8~0); {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:36,441 INFO L280 TraceCheckUtils]: 15: Hoare triple {9608#(not (= 0 main_~p4~0))} assume 0 != ~p9~0;~lk9~0 := 1; {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:36,441 INFO L280 TraceCheckUtils]: 16: Hoare triple {9608#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:36,442 INFO L280 TraceCheckUtils]: 17: Hoare triple {9608#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:36,442 INFO L280 TraceCheckUtils]: 18: Hoare triple {9608#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:36,443 INFO L280 TraceCheckUtils]: 19: Hoare triple {9608#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {9605#false} is VALID [2020-07-17 22:26:36,443 INFO L280 TraceCheckUtils]: 20: Hoare triple {9605#false} assume 0 != ~p5~0; {9605#false} is VALID [2020-07-17 22:26:36,444 INFO L280 TraceCheckUtils]: 21: Hoare triple {9605#false} assume 1 != ~lk5~0; {9605#false} is VALID [2020-07-17 22:26:36,444 INFO L280 TraceCheckUtils]: 22: Hoare triple {9605#false} assume !false; {9605#false} is VALID [2020-07-17 22:26:36,445 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:36,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355386326] [2020-07-17 22:26:36,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:36,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:36,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630490175] [2020-07-17 22:26:36,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:36,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:36,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:36,470 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:36,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:36,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:36,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:36,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:36,471 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2020-07-17 22:26:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:36,653 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2020-07-17 22:26:36,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:36,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-07-17 22:26:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-07-17 22:26:36,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 159 transitions. [2020-07-17 22:26:36,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:36,815 INFO L225 Difference]: With dead ends: 672 [2020-07-17 22:26:36,816 INFO L226 Difference]: Without dead ends: 458 [2020-07-17 22:26:36,817 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:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-07-17 22:26:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2020-07-17 22:26:36,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:36,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 458 states. Second operand 456 states. [2020-07-17 22:26:36,877 INFO L74 IsIncluded]: Start isIncluded. First operand 458 states. Second operand 456 states. [2020-07-17 22:26:36,877 INFO L87 Difference]: Start difference. First operand 458 states. Second operand 456 states. [2020-07-17 22:26:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:36,894 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2020-07-17 22:26:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 711 transitions. [2020-07-17 22:26:36,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:36,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:36,896 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand 458 states. [2020-07-17 22:26:36,896 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 458 states. [2020-07-17 22:26:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:36,914 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2020-07-17 22:26:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 711 transitions. [2020-07-17 22:26:36,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:36,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:36,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:36,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-07-17 22:26:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2020-07-17 22:26:36,932 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2020-07-17 22:26:36,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:36,932 INFO L479 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2020-07-17 22:26:36,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2020-07-17 22:26:36,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:36,933 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:36,935 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:36,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 22:26:36,936 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:36,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:36,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2020-07-17 22:26:36,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:36,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735758433] [2020-07-17 22:26:36,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:36,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {11709#true} assume true; {11709#true} is VALID [2020-07-17 22:26:36,983 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {11709#true} {11709#true} #180#return; {11709#true} is VALID [2020-07-17 22:26:36,983 INFO L263 TraceCheckUtils]: 0: Hoare triple {11709#true} call ULTIMATE.init(); {11709#true} is VALID [2020-07-17 22:26:36,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {11709#true} assume true; {11709#true} is VALID [2020-07-17 22:26:36,983 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11709#true} {11709#true} #180#return; {11709#true} is VALID [2020-07-17 22:26:36,984 INFO L263 TraceCheckUtils]: 3: Hoare triple {11709#true} call #t~ret10 := main(); {11709#true} is VALID [2020-07-17 22:26:36,984 INFO L280 TraceCheckUtils]: 4: Hoare triple {11709#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {11709#true} is VALID [2020-07-17 22:26:36,984 INFO L280 TraceCheckUtils]: 5: Hoare triple {11709#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {11709#true} is VALID [2020-07-17 22:26:36,984 INFO L280 TraceCheckUtils]: 6: Hoare triple {11709#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;~lk8~0 := 0;~lk9~0 := 0; {11709#true} is VALID [2020-07-17 22:26:36,984 INFO L280 TraceCheckUtils]: 7: Hoare triple {11709#true} assume !(0 != ~p1~0); {11709#true} is VALID [2020-07-17 22:26:36,985 INFO L280 TraceCheckUtils]: 8: Hoare triple {11709#true} assume !(0 != ~p2~0); {11709#true} is VALID [2020-07-17 22:26:36,985 INFO L280 TraceCheckUtils]: 9: Hoare triple {11709#true} assume !(0 != ~p3~0); {11709#true} is VALID [2020-07-17 22:26:36,985 INFO L280 TraceCheckUtils]: 10: Hoare triple {11709#true} assume !(0 != ~p4~0); {11709#true} is VALID [2020-07-17 22:26:36,986 INFO L280 TraceCheckUtils]: 11: Hoare triple {11709#true} assume 0 != ~p5~0;~lk5~0 := 1; {11713#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:36,986 INFO L280 TraceCheckUtils]: 12: Hoare triple {11713#(= 1 main_~lk5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {11713#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:36,987 INFO L280 TraceCheckUtils]: 13: Hoare triple {11713#(= 1 main_~lk5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {11713#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:36,987 INFO L280 TraceCheckUtils]: 14: Hoare triple {11713#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {11713#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:36,988 INFO L280 TraceCheckUtils]: 15: Hoare triple {11713#(= 1 main_~lk5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {11713#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:36,988 INFO L280 TraceCheckUtils]: 16: Hoare triple {11713#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {11713#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:36,989 INFO L280 TraceCheckUtils]: 17: Hoare triple {11713#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {11713#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:36,989 INFO L280 TraceCheckUtils]: 18: Hoare triple {11713#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {11713#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:36,990 INFO L280 TraceCheckUtils]: 19: Hoare triple {11713#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {11713#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:36,991 INFO L280 TraceCheckUtils]: 20: Hoare triple {11713#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {11713#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:36,994 INFO L280 TraceCheckUtils]: 21: Hoare triple {11713#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {11710#false} is VALID [2020-07-17 22:26:36,995 INFO L280 TraceCheckUtils]: 22: Hoare triple {11710#false} assume !false; {11710#false} is VALID [2020-07-17 22:26:36,996 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:36,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735758433] [2020-07-17 22:26:36,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:36,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:36,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447698230] [2020-07-17 22:26:36,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:36,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:36,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:37,023 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:37,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:37,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:37,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:37,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:37,024 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2020-07-17 22:26:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:37,265 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2020-07-17 22:26:37,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:37,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:37,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-17 22:26:37,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-17 22:26:37,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2020-07-17 22:26:37,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:37,405 INFO L225 Difference]: With dead ends: 812 [2020-07-17 22:26:37,406 INFO L226 Difference]: Without dead ends: 810 [2020-07-17 22:26:37,407 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:37,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2020-07-17 22:26:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2020-07-17 22:26:37,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:37,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 810 states. Second operand 648 states. [2020-07-17 22:26:37,498 INFO L74 IsIncluded]: Start isIncluded. First operand 810 states. Second operand 648 states. [2020-07-17 22:26:37,498 INFO L87 Difference]: Start difference. First operand 810 states. Second operand 648 states. [2020-07-17 22:26:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:37,547 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2020-07-17 22:26:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1271 transitions. [2020-07-17 22:26:37,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:37,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:37,549 INFO L74 IsIncluded]: Start isIncluded. First operand 648 states. Second operand 810 states. [2020-07-17 22:26:37,550 INFO L87 Difference]: Start difference. First operand 648 states. Second operand 810 states. [2020-07-17 22:26:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:37,606 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2020-07-17 22:26:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1271 transitions. [2020-07-17 22:26:37,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:37,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:37,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:37,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2020-07-17 22:26:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2020-07-17 22:26:37,638 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2020-07-17 22:26:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:37,638 INFO L479 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2020-07-17 22:26:37,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2020-07-17 22:26:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:37,640 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:37,640 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:37,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 22:26:37,640 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:37,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:37,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2020-07-17 22:26:37,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:37,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255468516] [2020-07-17 22:26:37,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:37,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {14858#true} assume true; {14858#true} is VALID [2020-07-17 22:26:37,664 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14858#true} {14858#true} #180#return; {14858#true} is VALID [2020-07-17 22:26:37,664 INFO L263 TraceCheckUtils]: 0: Hoare triple {14858#true} call ULTIMATE.init(); {14858#true} is VALID [2020-07-17 22:26:37,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {14858#true} assume true; {14858#true} is VALID [2020-07-17 22:26:37,664 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14858#true} {14858#true} #180#return; {14858#true} is VALID [2020-07-17 22:26:37,665 INFO L263 TraceCheckUtils]: 3: Hoare triple {14858#true} call #t~ret10 := main(); {14858#true} is VALID [2020-07-17 22:26:37,665 INFO L280 TraceCheckUtils]: 4: Hoare triple {14858#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {14858#true} is VALID [2020-07-17 22:26:37,665 INFO L280 TraceCheckUtils]: 5: Hoare triple {14858#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {14858#true} is VALID [2020-07-17 22:26:37,665 INFO L280 TraceCheckUtils]: 6: Hoare triple {14858#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;~lk8~0 := 0;~lk9~0 := 0; {14858#true} is VALID [2020-07-17 22:26:37,666 INFO L280 TraceCheckUtils]: 7: Hoare triple {14858#true} assume !(0 != ~p1~0); {14858#true} is VALID [2020-07-17 22:26:37,666 INFO L280 TraceCheckUtils]: 8: Hoare triple {14858#true} assume !(0 != ~p2~0); {14858#true} is VALID [2020-07-17 22:26:37,666 INFO L280 TraceCheckUtils]: 9: Hoare triple {14858#true} assume !(0 != ~p3~0); {14858#true} is VALID [2020-07-17 22:26:37,666 INFO L280 TraceCheckUtils]: 10: Hoare triple {14858#true} assume !(0 != ~p4~0); {14858#true} is VALID [2020-07-17 22:26:37,667 INFO L280 TraceCheckUtils]: 11: Hoare triple {14858#true} assume !(0 != ~p5~0); {14862#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:37,667 INFO L280 TraceCheckUtils]: 12: Hoare triple {14862#(= 0 main_~p5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {14862#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:37,668 INFO L280 TraceCheckUtils]: 13: Hoare triple {14862#(= 0 main_~p5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {14862#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:37,669 INFO L280 TraceCheckUtils]: 14: Hoare triple {14862#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {14862#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:37,669 INFO L280 TraceCheckUtils]: 15: Hoare triple {14862#(= 0 main_~p5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {14862#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:37,670 INFO L280 TraceCheckUtils]: 16: Hoare triple {14862#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {14862#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:37,670 INFO L280 TraceCheckUtils]: 17: Hoare triple {14862#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {14862#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:37,671 INFO L280 TraceCheckUtils]: 18: Hoare triple {14862#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {14862#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:37,671 INFO L280 TraceCheckUtils]: 19: Hoare triple {14862#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {14862#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:37,672 INFO L280 TraceCheckUtils]: 20: Hoare triple {14862#(= 0 main_~p5~0)} assume 0 != ~p5~0; {14859#false} is VALID [2020-07-17 22:26:37,672 INFO L280 TraceCheckUtils]: 21: Hoare triple {14859#false} assume 1 != ~lk5~0; {14859#false} is VALID [2020-07-17 22:26:37,672 INFO L280 TraceCheckUtils]: 22: Hoare triple {14859#false} assume !false; {14859#false} is VALID [2020-07-17 22:26:37,673 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:37,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255468516] [2020-07-17 22:26:37,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:37,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:37,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365352355] [2020-07-17 22:26:37,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:37,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:37,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:37,696 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:37,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:37,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:37,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:37,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:37,697 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2020-07-17 22:26:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:38,051 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2020-07-17 22:26:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:38,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:38,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-17 22:26:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-17 22:26:38,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2020-07-17 22:26:38,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:38,257 INFO L225 Difference]: With dead ends: 1500 [2020-07-17 22:26:38,257 INFO L226 Difference]: Without dead ends: 874 [2020-07-17 22:26:38,259 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:38,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2020-07-17 22:26:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2020-07-17 22:26:38,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:38,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 874 states. Second operand 872 states. [2020-07-17 22:26:38,401 INFO L74 IsIncluded]: Start isIncluded. First operand 874 states. Second operand 872 states. [2020-07-17 22:26:38,401 INFO L87 Difference]: Start difference. First operand 874 states. Second operand 872 states. [2020-07-17 22:26:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:38,450 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2020-07-17 22:26:38,450 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1303 transitions. [2020-07-17 22:26:38,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:38,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:38,452 INFO L74 IsIncluded]: Start isIncluded. First operand 872 states. Second operand 874 states. [2020-07-17 22:26:38,452 INFO L87 Difference]: Start difference. First operand 872 states. Second operand 874 states. [2020-07-17 22:26:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:38,500 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2020-07-17 22:26:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1303 transitions. [2020-07-17 22:26:38,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:38,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:38,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:38,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2020-07-17 22:26:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2020-07-17 22:26:38,548 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2020-07-17 22:26:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:38,548 INFO L479 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2020-07-17 22:26:38,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2020-07-17 22:26:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:26:38,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:38,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:38,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 22:26:38,551 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:38,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:38,551 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2020-07-17 22:26:38,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:38,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883501138] [2020-07-17 22:26:38,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:38,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {19079#true} assume true; {19079#true} is VALID [2020-07-17 22:26:38,577 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19079#true} {19079#true} #180#return; {19079#true} is VALID [2020-07-17 22:26:38,577 INFO L263 TraceCheckUtils]: 0: Hoare triple {19079#true} call ULTIMATE.init(); {19079#true} is VALID [2020-07-17 22:26:38,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {19079#true} assume true; {19079#true} is VALID [2020-07-17 22:26:38,577 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19079#true} {19079#true} #180#return; {19079#true} is VALID [2020-07-17 22:26:38,578 INFO L263 TraceCheckUtils]: 3: Hoare triple {19079#true} call #t~ret10 := main(); {19079#true} is VALID [2020-07-17 22:26:38,578 INFO L280 TraceCheckUtils]: 4: Hoare triple {19079#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {19079#true} is VALID [2020-07-17 22:26:38,578 INFO L280 TraceCheckUtils]: 5: Hoare triple {19079#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {19079#true} is VALID [2020-07-17 22:26:38,578 INFO L280 TraceCheckUtils]: 6: Hoare triple {19079#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;~lk8~0 := 0;~lk9~0 := 0; {19079#true} is VALID [2020-07-17 22:26:38,579 INFO L280 TraceCheckUtils]: 7: Hoare triple {19079#true} assume !(0 != ~p1~0); {19079#true} is VALID [2020-07-17 22:26:38,579 INFO L280 TraceCheckUtils]: 8: Hoare triple {19079#true} assume !(0 != ~p2~0); {19079#true} is VALID [2020-07-17 22:26:38,579 INFO L280 TraceCheckUtils]: 9: Hoare triple {19079#true} assume !(0 != ~p3~0); {19079#true} is VALID [2020-07-17 22:26:38,579 INFO L280 TraceCheckUtils]: 10: Hoare triple {19079#true} assume !(0 != ~p4~0); {19079#true} is VALID [2020-07-17 22:26:38,580 INFO L280 TraceCheckUtils]: 11: Hoare triple {19079#true} assume 0 != ~p5~0;~lk5~0 := 1; {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:38,580 INFO L280 TraceCheckUtils]: 12: Hoare triple {19083#(not (= 0 main_~p5~0))} assume 0 != ~p6~0;~lk6~0 := 1; {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:38,581 INFO L280 TraceCheckUtils]: 13: Hoare triple {19083#(not (= 0 main_~p5~0))} assume 0 != ~p7~0;~lk7~0 := 1; {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:38,582 INFO L280 TraceCheckUtils]: 14: Hoare triple {19083#(not (= 0 main_~p5~0))} assume !(0 != ~p8~0); {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:38,582 INFO L280 TraceCheckUtils]: 15: Hoare triple {19083#(not (= 0 main_~p5~0))} assume 0 != ~p9~0;~lk9~0 := 1; {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:38,583 INFO L280 TraceCheckUtils]: 16: Hoare triple {19083#(not (= 0 main_~p5~0))} assume !(0 != ~p1~0); {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:38,583 INFO L280 TraceCheckUtils]: 17: Hoare triple {19083#(not (= 0 main_~p5~0))} assume !(0 != ~p2~0); {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:38,584 INFO L280 TraceCheckUtils]: 18: Hoare triple {19083#(not (= 0 main_~p5~0))} assume !(0 != ~p3~0); {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:38,584 INFO L280 TraceCheckUtils]: 19: Hoare triple {19083#(not (= 0 main_~p5~0))} assume !(0 != ~p4~0); {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:38,585 INFO L280 TraceCheckUtils]: 20: Hoare triple {19083#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {19080#false} is VALID [2020-07-17 22:26:38,585 INFO L280 TraceCheckUtils]: 21: Hoare triple {19080#false} assume 0 != ~p6~0; {19080#false} is VALID [2020-07-17 22:26:38,585 INFO L280 TraceCheckUtils]: 22: Hoare triple {19080#false} assume 1 != ~lk6~0; {19080#false} is VALID [2020-07-17 22:26:38,586 INFO L280 TraceCheckUtils]: 23: Hoare triple {19080#false} assume !false; {19080#false} is VALID [2020-07-17 22:26:38,586 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:38,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883501138] [2020-07-17 22:26:38,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:38,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:38,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57480215] [2020-07-17 22:26:38,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:38,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:38,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:38,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:38,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:38,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:38,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:38,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:38,613 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2020-07-17 22:26:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:38,944 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2020-07-17 22:26:38,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:38,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-17 22:26:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-17 22:26:38,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2020-07-17 22:26:39,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:39,147 INFO L225 Difference]: With dead ends: 1308 [2020-07-17 22:26:39,147 INFO L226 Difference]: Without dead ends: 890 [2020-07-17 22:26:39,148 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:39,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2020-07-17 22:26:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2020-07-17 22:26:39,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:39,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 890 states. Second operand 888 states. [2020-07-17 22:26:39,292 INFO L74 IsIncluded]: Start isIncluded. First operand 890 states. Second operand 888 states. [2020-07-17 22:26:39,293 INFO L87 Difference]: Start difference. First operand 890 states. Second operand 888 states. [2020-07-17 22:26:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:39,336 INFO L93 Difference]: Finished difference Result 890 states and 1303 transitions. [2020-07-17 22:26:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1303 transitions. [2020-07-17 22:26:39,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:39,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:39,338 INFO L74 IsIncluded]: Start isIncluded. First operand 888 states. Second operand 890 states. [2020-07-17 22:26:39,339 INFO L87 Difference]: Start difference. First operand 888 states. Second operand 890 states. [2020-07-17 22:26:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:39,381 INFO L93 Difference]: Finished difference Result 890 states and 1303 transitions. [2020-07-17 22:26:39,381 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1303 transitions. [2020-07-17 22:26:39,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:39,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:39,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:39,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2020-07-17 22:26:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2020-07-17 22:26:39,425 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2020-07-17 22:26:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:39,426 INFO L479 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2020-07-17 22:26:39,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2020-07-17 22:26:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:26:39,427 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:39,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:39,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 22:26:39,428 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:39,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:39,428 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2020-07-17 22:26:39,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:39,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817972648] [2020-07-17 22:26:39,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:39,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {23156#true} assume true; {23156#true} is VALID [2020-07-17 22:26:39,451 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23156#true} {23156#true} #180#return; {23156#true} is VALID [2020-07-17 22:26:39,452 INFO L263 TraceCheckUtils]: 0: Hoare triple {23156#true} call ULTIMATE.init(); {23156#true} is VALID [2020-07-17 22:26:39,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {23156#true} assume true; {23156#true} is VALID [2020-07-17 22:26:39,452 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23156#true} {23156#true} #180#return; {23156#true} is VALID [2020-07-17 22:26:39,452 INFO L263 TraceCheckUtils]: 3: Hoare triple {23156#true} call #t~ret10 := main(); {23156#true} is VALID [2020-07-17 22:26:39,452 INFO L280 TraceCheckUtils]: 4: Hoare triple {23156#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {23156#true} is VALID [2020-07-17 22:26:39,453 INFO L280 TraceCheckUtils]: 5: Hoare triple {23156#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {23156#true} is VALID [2020-07-17 22:26:39,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {23156#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;~lk8~0 := 0;~lk9~0 := 0; {23156#true} is VALID [2020-07-17 22:26:39,453 INFO L280 TraceCheckUtils]: 7: Hoare triple {23156#true} assume !(0 != ~p1~0); {23156#true} is VALID [2020-07-17 22:26:39,453 INFO L280 TraceCheckUtils]: 8: Hoare triple {23156#true} assume !(0 != ~p2~0); {23156#true} is VALID [2020-07-17 22:26:39,453 INFO L280 TraceCheckUtils]: 9: Hoare triple {23156#true} assume !(0 != ~p3~0); {23156#true} is VALID [2020-07-17 22:26:39,454 INFO L280 TraceCheckUtils]: 10: Hoare triple {23156#true} assume !(0 != ~p4~0); {23156#true} is VALID [2020-07-17 22:26:39,454 INFO L280 TraceCheckUtils]: 11: Hoare triple {23156#true} assume !(0 != ~p5~0); {23156#true} is VALID [2020-07-17 22:26:39,455 INFO L280 TraceCheckUtils]: 12: Hoare triple {23156#true} assume 0 != ~p6~0;~lk6~0 := 1; {23160#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:39,455 INFO L280 TraceCheckUtils]: 13: Hoare triple {23160#(= 1 main_~lk6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {23160#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:39,456 INFO L280 TraceCheckUtils]: 14: Hoare triple {23160#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {23160#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:39,456 INFO L280 TraceCheckUtils]: 15: Hoare triple {23160#(= 1 main_~lk6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {23160#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:39,457 INFO L280 TraceCheckUtils]: 16: Hoare triple {23160#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {23160#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:39,458 INFO L280 TraceCheckUtils]: 17: Hoare triple {23160#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {23160#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:39,459 INFO L280 TraceCheckUtils]: 18: Hoare triple {23160#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {23160#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:39,459 INFO L280 TraceCheckUtils]: 19: Hoare triple {23160#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {23160#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:39,460 INFO L280 TraceCheckUtils]: 20: Hoare triple {23160#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {23160#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:39,460 INFO L280 TraceCheckUtils]: 21: Hoare triple {23160#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {23160#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:39,461 INFO L280 TraceCheckUtils]: 22: Hoare triple {23160#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {23157#false} is VALID [2020-07-17 22:26:39,461 INFO L280 TraceCheckUtils]: 23: Hoare triple {23157#false} assume !false; {23157#false} is VALID [2020-07-17 22:26:39,462 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:39,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817972648] [2020-07-17 22:26:39,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:39,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:39,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708946477] [2020-07-17 22:26:39,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:39,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:39,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:39,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:39,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:39,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:39,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:39,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:39,491 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2020-07-17 22:26:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:40,024 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2020-07-17 22:26:40,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:40,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-17 22:26:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-17 22:26:40,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2020-07-17 22:26:40,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:40,272 INFO L225 Difference]: With dead ends: 1548 [2020-07-17 22:26:40,273 INFO L226 Difference]: Without dead ends: 1546 [2020-07-17 22:26:40,274 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:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2020-07-17 22:26:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2020-07-17 22:26:40,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:40,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1546 states. Second operand 1288 states. [2020-07-17 22:26:40,513 INFO L74 IsIncluded]: Start isIncluded. First operand 1546 states. Second operand 1288 states. [2020-07-17 22:26:40,513 INFO L87 Difference]: Start difference. First operand 1546 states. Second operand 1288 states. [2020-07-17 22:26:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:40,636 INFO L93 Difference]: Finished difference Result 1546 states and 2279 transitions. [2020-07-17 22:26:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2279 transitions. [2020-07-17 22:26:40,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:40,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:40,640 INFO L74 IsIncluded]: Start isIncluded. First operand 1288 states. Second operand 1546 states. [2020-07-17 22:26:40,640 INFO L87 Difference]: Start difference. First operand 1288 states. Second operand 1546 states. [2020-07-17 22:26:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:40,762 INFO L93 Difference]: Finished difference Result 1546 states and 2279 transitions. [2020-07-17 22:26:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2279 transitions. [2020-07-17 22:26:40,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:40,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:40,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:40,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2020-07-17 22:26:40,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2020-07-17 22:26:40,857 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2020-07-17 22:26:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:40,858 INFO L479 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2020-07-17 22:26:40,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2020-07-17 22:26:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:26:40,864 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:40,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:40,864 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 22:26:40,864 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:40,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:40,865 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2020-07-17 22:26:40,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:40,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897653501] [2020-07-17 22:26:40,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:40,897 INFO L280 TraceCheckUtils]: 0: Hoare triple {29201#true} assume true; {29201#true} is VALID [2020-07-17 22:26:40,897 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29201#true} {29201#true} #180#return; {29201#true} is VALID [2020-07-17 22:26:40,897 INFO L263 TraceCheckUtils]: 0: Hoare triple {29201#true} call ULTIMATE.init(); {29201#true} is VALID [2020-07-17 22:26:40,898 INFO L280 TraceCheckUtils]: 1: Hoare triple {29201#true} assume true; {29201#true} is VALID [2020-07-17 22:26:40,898 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29201#true} {29201#true} #180#return; {29201#true} is VALID [2020-07-17 22:26:40,898 INFO L263 TraceCheckUtils]: 3: Hoare triple {29201#true} call #t~ret10 := main(); {29201#true} is VALID [2020-07-17 22:26:40,898 INFO L280 TraceCheckUtils]: 4: Hoare triple {29201#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {29201#true} is VALID [2020-07-17 22:26:40,898 INFO L280 TraceCheckUtils]: 5: Hoare triple {29201#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {29201#true} is VALID [2020-07-17 22:26:40,899 INFO L280 TraceCheckUtils]: 6: Hoare triple {29201#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;~lk8~0 := 0;~lk9~0 := 0; {29201#true} is VALID [2020-07-17 22:26:40,899 INFO L280 TraceCheckUtils]: 7: Hoare triple {29201#true} assume !(0 != ~p1~0); {29201#true} is VALID [2020-07-17 22:26:40,899 INFO L280 TraceCheckUtils]: 8: Hoare triple {29201#true} assume !(0 != ~p2~0); {29201#true} is VALID [2020-07-17 22:26:40,899 INFO L280 TraceCheckUtils]: 9: Hoare triple {29201#true} assume !(0 != ~p3~0); {29201#true} is VALID [2020-07-17 22:26:40,899 INFO L280 TraceCheckUtils]: 10: Hoare triple {29201#true} assume !(0 != ~p4~0); {29201#true} is VALID [2020-07-17 22:26:40,900 INFO L280 TraceCheckUtils]: 11: Hoare triple {29201#true} assume !(0 != ~p5~0); {29201#true} is VALID [2020-07-17 22:26:40,901 INFO L280 TraceCheckUtils]: 12: Hoare triple {29201#true} assume !(0 != ~p6~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:40,901 INFO L280 TraceCheckUtils]: 13: Hoare triple {29205#(= 0 main_~p6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {29205#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:40,902 INFO L280 TraceCheckUtils]: 14: Hoare triple {29205#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:40,902 INFO L280 TraceCheckUtils]: 15: Hoare triple {29205#(= 0 main_~p6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {29205#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:40,903 INFO L280 TraceCheckUtils]: 16: Hoare triple {29205#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:40,903 INFO L280 TraceCheckUtils]: 17: Hoare triple {29205#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:40,904 INFO L280 TraceCheckUtils]: 18: Hoare triple {29205#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:40,904 INFO L280 TraceCheckUtils]: 19: Hoare triple {29205#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:40,905 INFO L280 TraceCheckUtils]: 20: Hoare triple {29205#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:40,905 INFO L280 TraceCheckUtils]: 21: Hoare triple {29205#(= 0 main_~p6~0)} assume 0 != ~p6~0; {29202#false} is VALID [2020-07-17 22:26:40,905 INFO L280 TraceCheckUtils]: 22: Hoare triple {29202#false} assume 1 != ~lk6~0; {29202#false} is VALID [2020-07-17 22:26:40,906 INFO L280 TraceCheckUtils]: 23: Hoare triple {29202#false} assume !false; {29202#false} is VALID [2020-07-17 22:26:40,906 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:40,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897653501] [2020-07-17 22:26:40,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:40,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:40,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575395130] [2020-07-17 22:26:40,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:40,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:40,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:40,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:40,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:40,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:40,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:40,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:40,931 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2020-07-17 22:26:41,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:41,678 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2020-07-17 22:26:41,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:41,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:41,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2020-07-17 22:26:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2020-07-17 22:26:41,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2020-07-17 22:26:41,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:41,942 INFO L225 Difference]: With dead ends: 2956 [2020-07-17 22:26:41,943 INFO L226 Difference]: Without dead ends: 1706 [2020-07-17 22:26:41,945 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:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2020-07-17 22:26:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2020-07-17 22:26:42,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:42,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1706 states. Second operand 1704 states. [2020-07-17 22:26:42,319 INFO L74 IsIncluded]: Start isIncluded. First operand 1706 states. Second operand 1704 states. [2020-07-17 22:26:42,319 INFO L87 Difference]: Start difference. First operand 1706 states. Second operand 1704 states. [2020-07-17 22:26:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:42,459 INFO L93 Difference]: Finished difference Result 1706 states and 2375 transitions. [2020-07-17 22:26:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2375 transitions. [2020-07-17 22:26:42,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:42,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:42,464 INFO L74 IsIncluded]: Start isIncluded. First operand 1704 states. Second operand 1706 states. [2020-07-17 22:26:42,464 INFO L87 Difference]: Start difference. First operand 1704 states. Second operand 1706 states. [2020-07-17 22:26:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:42,591 INFO L93 Difference]: Finished difference Result 1706 states and 2375 transitions. [2020-07-17 22:26:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2375 transitions. [2020-07-17 22:26:42,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:42,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:42,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:42,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2020-07-17 22:26:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2020-07-17 22:26:42,702 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2020-07-17 22:26:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:42,702 INFO L479 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2020-07-17 22:26:42,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2020-07-17 22:26:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:26:42,704 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:42,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:42,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-17 22:26:42,704 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:42,705 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2020-07-17 22:26:42,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:42,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622933254] [2020-07-17 22:26:42,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:42,726 INFO L280 TraceCheckUtils]: 0: Hoare triple {37454#true} assume true; {37454#true} is VALID [2020-07-17 22:26:42,726 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37454#true} {37454#true} #180#return; {37454#true} is VALID [2020-07-17 22:26:42,726 INFO L263 TraceCheckUtils]: 0: Hoare triple {37454#true} call ULTIMATE.init(); {37454#true} is VALID [2020-07-17 22:26:42,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {37454#true} assume true; {37454#true} is VALID [2020-07-17 22:26:42,727 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37454#true} {37454#true} #180#return; {37454#true} is VALID [2020-07-17 22:26:42,727 INFO L263 TraceCheckUtils]: 3: Hoare triple {37454#true} call #t~ret10 := main(); {37454#true} is VALID [2020-07-17 22:26:42,727 INFO L280 TraceCheckUtils]: 4: Hoare triple {37454#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {37454#true} is VALID [2020-07-17 22:26:42,728 INFO L280 TraceCheckUtils]: 5: Hoare triple {37454#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {37454#true} is VALID [2020-07-17 22:26:42,728 INFO L280 TraceCheckUtils]: 6: Hoare triple {37454#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;~lk8~0 := 0;~lk9~0 := 0; {37454#true} is VALID [2020-07-17 22:26:42,728 INFO L280 TraceCheckUtils]: 7: Hoare triple {37454#true} assume !(0 != ~p1~0); {37454#true} is VALID [2020-07-17 22:26:42,728 INFO L280 TraceCheckUtils]: 8: Hoare triple {37454#true} assume !(0 != ~p2~0); {37454#true} is VALID [2020-07-17 22:26:42,728 INFO L280 TraceCheckUtils]: 9: Hoare triple {37454#true} assume !(0 != ~p3~0); {37454#true} is VALID [2020-07-17 22:26:42,729 INFO L280 TraceCheckUtils]: 10: Hoare triple {37454#true} assume !(0 != ~p4~0); {37454#true} is VALID [2020-07-17 22:26:42,729 INFO L280 TraceCheckUtils]: 11: Hoare triple {37454#true} assume !(0 != ~p5~0); {37454#true} is VALID [2020-07-17 22:26:42,733 INFO L280 TraceCheckUtils]: 12: Hoare triple {37454#true} assume 0 != ~p6~0;~lk6~0 := 1; {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:42,733 INFO L280 TraceCheckUtils]: 13: Hoare triple {37458#(not (= 0 main_~p6~0))} assume 0 != ~p7~0;~lk7~0 := 1; {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:42,734 INFO L280 TraceCheckUtils]: 14: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p8~0); {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:42,734 INFO L280 TraceCheckUtils]: 15: Hoare triple {37458#(not (= 0 main_~p6~0))} assume 0 != ~p9~0;~lk9~0 := 1; {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:42,735 INFO L280 TraceCheckUtils]: 16: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p1~0); {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:42,736 INFO L280 TraceCheckUtils]: 17: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p2~0); {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:42,736 INFO L280 TraceCheckUtils]: 18: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p3~0); {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:42,737 INFO L280 TraceCheckUtils]: 19: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p4~0); {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:42,737 INFO L280 TraceCheckUtils]: 20: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p5~0); {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:42,738 INFO L280 TraceCheckUtils]: 21: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p6~0); {37455#false} is VALID [2020-07-17 22:26:42,738 INFO L280 TraceCheckUtils]: 22: Hoare triple {37455#false} assume 0 != ~p7~0; {37455#false} is VALID [2020-07-17 22:26:42,738 INFO L280 TraceCheckUtils]: 23: Hoare triple {37455#false} assume 1 != ~lk7~0; {37455#false} is VALID [2020-07-17 22:26:42,739 INFO L280 TraceCheckUtils]: 24: Hoare triple {37455#false} assume !false; {37455#false} is VALID [2020-07-17 22:26:42,739 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:42,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622933254] [2020-07-17 22:26:42,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:42,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:42,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729088980] [2020-07-17 22:26:42,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:42,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:42,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:42,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:42,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:42,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:42,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:42,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:42,767 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2020-07-17 22:26:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:43,399 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2020-07-17 22:26:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:43,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-17 22:26:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-17 22:26:43,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2020-07-17 22:26:43,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:43,653 INFO L225 Difference]: With dead ends: 2556 [2020-07-17 22:26:43,653 INFO L226 Difference]: Without dead ends: 1738 [2020-07-17 22:26:43,656 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:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-07-17 22:26:44,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2020-07-17 22:26:44,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:44,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1738 states. Second operand 1736 states. [2020-07-17 22:26:44,033 INFO L74 IsIncluded]: Start isIncluded. First operand 1738 states. Second operand 1736 states. [2020-07-17 22:26:44,034 INFO L87 Difference]: Start difference. First operand 1738 states. Second operand 1736 states. [2020-07-17 22:26:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:44,125 INFO L93 Difference]: Finished difference Result 1738 states and 2375 transitions. [2020-07-17 22:26:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2375 transitions. [2020-07-17 22:26:44,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:44,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:44,128 INFO L74 IsIncluded]: Start isIncluded. First operand 1736 states. Second operand 1738 states. [2020-07-17 22:26:44,128 INFO L87 Difference]: Start difference. First operand 1736 states. Second operand 1738 states. [2020-07-17 22:26:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:44,241 INFO L93 Difference]: Finished difference Result 1738 states and 2375 transitions. [2020-07-17 22:26:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2375 transitions. [2020-07-17 22:26:44,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:44,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:44,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:44,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2020-07-17 22:26:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2020-07-17 22:26:44,336 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2020-07-17 22:26:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:44,336 INFO L479 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2020-07-17 22:26:44,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2020-07-17 22:26:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:26:44,337 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:44,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:44,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-17 22:26:44,338 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2020-07-17 22:26:44,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:44,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579402336] [2020-07-17 22:26:44,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:44,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {45403#true} assume true; {45403#true} is VALID [2020-07-17 22:26:44,364 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45403#true} {45403#true} #180#return; {45403#true} is VALID [2020-07-17 22:26:44,365 INFO L263 TraceCheckUtils]: 0: Hoare triple {45403#true} call ULTIMATE.init(); {45403#true} is VALID [2020-07-17 22:26:44,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {45403#true} assume true; {45403#true} is VALID [2020-07-17 22:26:44,365 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45403#true} {45403#true} #180#return; {45403#true} is VALID [2020-07-17 22:26:44,365 INFO L263 TraceCheckUtils]: 3: Hoare triple {45403#true} call #t~ret10 := main(); {45403#true} is VALID [2020-07-17 22:26:44,365 INFO L280 TraceCheckUtils]: 4: Hoare triple {45403#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {45403#true} is VALID [2020-07-17 22:26:44,366 INFO L280 TraceCheckUtils]: 5: Hoare triple {45403#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {45403#true} is VALID [2020-07-17 22:26:44,366 INFO L280 TraceCheckUtils]: 6: Hoare triple {45403#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;~lk8~0 := 0;~lk9~0 := 0; {45403#true} is VALID [2020-07-17 22:26:44,366 INFO L280 TraceCheckUtils]: 7: Hoare triple {45403#true} assume !(0 != ~p1~0); {45403#true} is VALID [2020-07-17 22:26:44,366 INFO L280 TraceCheckUtils]: 8: Hoare triple {45403#true} assume !(0 != ~p2~0); {45403#true} is VALID [2020-07-17 22:26:44,366 INFO L280 TraceCheckUtils]: 9: Hoare triple {45403#true} assume !(0 != ~p3~0); {45403#true} is VALID [2020-07-17 22:26:44,367 INFO L280 TraceCheckUtils]: 10: Hoare triple {45403#true} assume !(0 != ~p4~0); {45403#true} is VALID [2020-07-17 22:26:44,367 INFO L280 TraceCheckUtils]: 11: Hoare triple {45403#true} assume !(0 != ~p5~0); {45403#true} is VALID [2020-07-17 22:26:44,367 INFO L280 TraceCheckUtils]: 12: Hoare triple {45403#true} assume !(0 != ~p6~0); {45403#true} is VALID [2020-07-17 22:26:44,368 INFO L280 TraceCheckUtils]: 13: Hoare triple {45403#true} assume 0 != ~p7~0;~lk7~0 := 1; {45407#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:44,369 INFO L280 TraceCheckUtils]: 14: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:44,369 INFO L280 TraceCheckUtils]: 15: Hoare triple {45407#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {45407#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:44,370 INFO L280 TraceCheckUtils]: 16: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:44,370 INFO L280 TraceCheckUtils]: 17: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:44,371 INFO L280 TraceCheckUtils]: 18: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:44,371 INFO L280 TraceCheckUtils]: 19: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:44,372 INFO L280 TraceCheckUtils]: 20: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:44,372 INFO L280 TraceCheckUtils]: 21: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:44,373 INFO L280 TraceCheckUtils]: 22: Hoare triple {45407#(= main_~lk7~0 1)} assume 0 != ~p7~0; {45407#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:44,373 INFO L280 TraceCheckUtils]: 23: Hoare triple {45407#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {45404#false} is VALID [2020-07-17 22:26:44,373 INFO L280 TraceCheckUtils]: 24: Hoare triple {45404#false} assume !false; {45404#false} is VALID [2020-07-17 22:26:44,374 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:44,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579402336] [2020-07-17 22:26:44,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:44,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:44,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679513198] [2020-07-17 22:26:44,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:44,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:44,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:44,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:44,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:44,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:44,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:44,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:44,405 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2020-07-17 22:26:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:45,360 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2020-07-17 22:26:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:45,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-17 22:26:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-17 22:26:45,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2020-07-17 22:26:45,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:45,742 INFO L225 Difference]: With dead ends: 2956 [2020-07-17 22:26:45,742 INFO L226 Difference]: Without dead ends: 2954 [2020-07-17 22:26:45,743 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:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-07-17 22:26:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2020-07-17 22:26:46,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:46,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2954 states. Second operand 2568 states. [2020-07-17 22:26:46,130 INFO L74 IsIncluded]: Start isIncluded. First operand 2954 states. Second operand 2568 states. [2020-07-17 22:26:46,130 INFO L87 Difference]: Start difference. First operand 2954 states. Second operand 2568 states. [2020-07-17 22:26:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:46,402 INFO L93 Difference]: Finished difference Result 2954 states and 4039 transitions. [2020-07-17 22:26:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4039 transitions. [2020-07-17 22:26:46,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:46,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:46,406 INFO L74 IsIncluded]: Start isIncluded. First operand 2568 states. Second operand 2954 states. [2020-07-17 22:26:46,406 INFO L87 Difference]: Start difference. First operand 2568 states. Second operand 2954 states. [2020-07-17 22:26:46,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:46,653 INFO L93 Difference]: Finished difference Result 2954 states and 4039 transitions. [2020-07-17 22:26:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4039 transitions. [2020-07-17 22:26:46,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:46,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:46,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:46,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2020-07-17 22:26:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2020-07-17 22:26:46,857 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2020-07-17 22:26:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:46,857 INFO L479 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2020-07-17 22:26:46,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2020-07-17 22:26:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:26:46,860 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:46,860 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:46,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-17 22:26:46,860 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:46,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:46,861 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2020-07-17 22:26:46,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:46,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809361716] [2020-07-17 22:26:46,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:46,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {57048#true} assume true; {57048#true} is VALID [2020-07-17 22:26:46,887 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {57048#true} {57048#true} #180#return; {57048#true} is VALID [2020-07-17 22:26:46,887 INFO L263 TraceCheckUtils]: 0: Hoare triple {57048#true} call ULTIMATE.init(); {57048#true} is VALID [2020-07-17 22:26:46,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {57048#true} assume true; {57048#true} is VALID [2020-07-17 22:26:46,888 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {57048#true} {57048#true} #180#return; {57048#true} is VALID [2020-07-17 22:26:46,888 INFO L263 TraceCheckUtils]: 3: Hoare triple {57048#true} call #t~ret10 := main(); {57048#true} is VALID [2020-07-17 22:26:46,888 INFO L280 TraceCheckUtils]: 4: Hoare triple {57048#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {57048#true} is VALID [2020-07-17 22:26:46,888 INFO L280 TraceCheckUtils]: 5: Hoare triple {57048#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {57048#true} is VALID [2020-07-17 22:26:46,889 INFO L280 TraceCheckUtils]: 6: Hoare triple {57048#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;~lk8~0 := 0;~lk9~0 := 0; {57048#true} is VALID [2020-07-17 22:26:46,889 INFO L280 TraceCheckUtils]: 7: Hoare triple {57048#true} assume !(0 != ~p1~0); {57048#true} is VALID [2020-07-17 22:26:46,889 INFO L280 TraceCheckUtils]: 8: Hoare triple {57048#true} assume !(0 != ~p2~0); {57048#true} is VALID [2020-07-17 22:26:46,889 INFO L280 TraceCheckUtils]: 9: Hoare triple {57048#true} assume !(0 != ~p3~0); {57048#true} is VALID [2020-07-17 22:26:46,889 INFO L280 TraceCheckUtils]: 10: Hoare triple {57048#true} assume !(0 != ~p4~0); {57048#true} is VALID [2020-07-17 22:26:46,890 INFO L280 TraceCheckUtils]: 11: Hoare triple {57048#true} assume !(0 != ~p5~0); {57048#true} is VALID [2020-07-17 22:26:46,890 INFO L280 TraceCheckUtils]: 12: Hoare triple {57048#true} assume !(0 != ~p6~0); {57048#true} is VALID [2020-07-17 22:26:46,891 INFO L280 TraceCheckUtils]: 13: Hoare triple {57048#true} assume !(0 != ~p7~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:46,891 INFO L280 TraceCheckUtils]: 14: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:46,891 INFO L280 TraceCheckUtils]: 15: Hoare triple {57052#(= 0 main_~p7~0)} assume 0 != ~p9~0;~lk9~0 := 1; {57052#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:46,892 INFO L280 TraceCheckUtils]: 16: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:46,892 INFO L280 TraceCheckUtils]: 17: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:46,893 INFO L280 TraceCheckUtils]: 18: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:46,893 INFO L280 TraceCheckUtils]: 19: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:46,894 INFO L280 TraceCheckUtils]: 20: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:46,894 INFO L280 TraceCheckUtils]: 21: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:46,895 INFO L280 TraceCheckUtils]: 22: Hoare triple {57052#(= 0 main_~p7~0)} assume 0 != ~p7~0; {57049#false} is VALID [2020-07-17 22:26:46,895 INFO L280 TraceCheckUtils]: 23: Hoare triple {57049#false} assume 1 != ~lk7~0; {57049#false} is VALID [2020-07-17 22:26:46,895 INFO L280 TraceCheckUtils]: 24: Hoare triple {57049#false} assume !false; {57049#false} is VALID [2020-07-17 22:26:46,896 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:46,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809361716] [2020-07-17 22:26:46,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:46,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:46,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178473150] [2020-07-17 22:26:46,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:46,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:46,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:46,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:46,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:46,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:46,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:46,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:46,921 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2020-07-17 22:26:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:48,815 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2020-07-17 22:26:48,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:48,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:48,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-17 22:26:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-17 22:26:48,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2020-07-17 22:26:48,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:49,359 INFO L225 Difference]: With dead ends: 5836 [2020-07-17 22:26:49,359 INFO L226 Difference]: Without dead ends: 3338 [2020-07-17 22:26:49,363 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:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2020-07-17 22:26:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2020-07-17 22:26:50,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:50,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3338 states. Second operand 3336 states. [2020-07-17 22:26:50,097 INFO L74 IsIncluded]: Start isIncluded. First operand 3338 states. Second operand 3336 states. [2020-07-17 22:26:50,097 INFO L87 Difference]: Start difference. First operand 3338 states. Second operand 3336 states. [2020-07-17 22:26:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:50,440 INFO L93 Difference]: Finished difference Result 3338 states and 4295 transitions. [2020-07-17 22:26:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4295 transitions. [2020-07-17 22:26:50,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:50,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:50,444 INFO L74 IsIncluded]: Start isIncluded. First operand 3336 states. Second operand 3338 states. [2020-07-17 22:26:50,444 INFO L87 Difference]: Start difference. First operand 3336 states. Second operand 3338 states. [2020-07-17 22:26:50,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:50,786 INFO L93 Difference]: Finished difference Result 3338 states and 4295 transitions. [2020-07-17 22:26:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4295 transitions. [2020-07-17 22:26:50,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:50,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:50,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:50,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2020-07-17 22:26:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2020-07-17 22:26:51,149 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2020-07-17 22:26:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:51,149 INFO L479 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2020-07-17 22:26:51,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2020-07-17 22:26:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:26:51,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:51,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:51,152 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-17 22:26:51,152 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2020-07-17 22:26:51,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:51,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63113302] [2020-07-17 22:26:51,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:51,193 INFO L280 TraceCheckUtils]: 0: Hoare triple {73237#true} assume true; {73237#true} is VALID [2020-07-17 22:26:51,194 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {73237#true} {73237#true} #180#return; {73237#true} is VALID [2020-07-17 22:26:51,194 INFO L263 TraceCheckUtils]: 0: Hoare triple {73237#true} call ULTIMATE.init(); {73237#true} is VALID [2020-07-17 22:26:51,194 INFO L280 TraceCheckUtils]: 1: Hoare triple {73237#true} assume true; {73237#true} is VALID [2020-07-17 22:26:51,194 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {73237#true} {73237#true} #180#return; {73237#true} is VALID [2020-07-17 22:26:51,195 INFO L263 TraceCheckUtils]: 3: Hoare triple {73237#true} call #t~ret10 := main(); {73237#true} is VALID [2020-07-17 22:26:51,195 INFO L280 TraceCheckUtils]: 4: Hoare triple {73237#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {73237#true} is VALID [2020-07-17 22:26:51,195 INFO L280 TraceCheckUtils]: 5: Hoare triple {73237#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {73237#true} is VALID [2020-07-17 22:26:51,195 INFO L280 TraceCheckUtils]: 6: Hoare triple {73237#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;~lk8~0 := 0;~lk9~0 := 0; {73237#true} is VALID [2020-07-17 22:26:51,195 INFO L280 TraceCheckUtils]: 7: Hoare triple {73237#true} assume !(0 != ~p1~0); {73237#true} is VALID [2020-07-17 22:26:51,195 INFO L280 TraceCheckUtils]: 8: Hoare triple {73237#true} assume !(0 != ~p2~0); {73237#true} is VALID [2020-07-17 22:26:51,196 INFO L280 TraceCheckUtils]: 9: Hoare triple {73237#true} assume !(0 != ~p3~0); {73237#true} is VALID [2020-07-17 22:26:51,196 INFO L280 TraceCheckUtils]: 10: Hoare triple {73237#true} assume !(0 != ~p4~0); {73237#true} is VALID [2020-07-17 22:26:51,196 INFO L280 TraceCheckUtils]: 11: Hoare triple {73237#true} assume !(0 != ~p5~0); {73237#true} is VALID [2020-07-17 22:26:51,196 INFO L280 TraceCheckUtils]: 12: Hoare triple {73237#true} assume !(0 != ~p6~0); {73237#true} is VALID [2020-07-17 22:26:51,197 INFO L280 TraceCheckUtils]: 13: Hoare triple {73237#true} assume 0 != ~p7~0;~lk7~0 := 1; {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:51,197 INFO L280 TraceCheckUtils]: 14: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p8~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:51,198 INFO L280 TraceCheckUtils]: 15: Hoare triple {73241#(not (= 0 main_~p7~0))} assume 0 != ~p9~0;~lk9~0 := 1; {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:51,198 INFO L280 TraceCheckUtils]: 16: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p1~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:51,199 INFO L280 TraceCheckUtils]: 17: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p2~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:51,199 INFO L280 TraceCheckUtils]: 18: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p3~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:51,200 INFO L280 TraceCheckUtils]: 19: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p4~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:51,200 INFO L280 TraceCheckUtils]: 20: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p5~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:51,201 INFO L280 TraceCheckUtils]: 21: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p6~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:51,202 INFO L280 TraceCheckUtils]: 22: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p7~0); {73238#false} is VALID [2020-07-17 22:26:51,202 INFO L280 TraceCheckUtils]: 23: Hoare triple {73238#false} assume 0 != ~p8~0; {73238#false} is VALID [2020-07-17 22:26:51,202 INFO L280 TraceCheckUtils]: 24: Hoare triple {73238#false} assume 1 != ~lk8~0; {73238#false} is VALID [2020-07-17 22:26:51,202 INFO L280 TraceCheckUtils]: 25: Hoare triple {73238#false} assume !false; {73238#false} is VALID [2020-07-17 22:26:51,205 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:51,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63113302] [2020-07-17 22:26:51,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:51,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:51,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142639487] [2020-07-17 22:26:51,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:51,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:51,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:51,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:51,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:51,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:51,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:51,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:51,236 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2020-07-17 22:26:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:52,816 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2020-07-17 22:26:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:52,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:52,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-17 22:26:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-17 22:26:52,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2020-07-17 22:26:52,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:53,401 INFO L225 Difference]: With dead ends: 5004 [2020-07-17 22:26:53,401 INFO L226 Difference]: Without dead ends: 3402 [2020-07-17 22:26:53,404 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:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2020-07-17 22:26:54,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2020-07-17 22:26:54,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:54,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3402 states. Second operand 3400 states. [2020-07-17 22:26:54,183 INFO L74 IsIncluded]: Start isIncluded. First operand 3402 states. Second operand 3400 states. [2020-07-17 22:26:54,183 INFO L87 Difference]: Start difference. First operand 3402 states. Second operand 3400 states. [2020-07-17 22:26:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:54,524 INFO L93 Difference]: Finished difference Result 3402 states and 4295 transitions. [2020-07-17 22:26:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4295 transitions. [2020-07-17 22:26:54,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:54,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:54,530 INFO L74 IsIncluded]: Start isIncluded. First operand 3400 states. Second operand 3402 states. [2020-07-17 22:26:54,530 INFO L87 Difference]: Start difference. First operand 3400 states. Second operand 3402 states. [2020-07-17 22:26:54,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:54,886 INFO L93 Difference]: Finished difference Result 3402 states and 4295 transitions. [2020-07-17 22:26:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4295 transitions. [2020-07-17 22:26:54,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:54,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:54,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:54,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2020-07-17 22:26:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2020-07-17 22:26:55,272 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2020-07-17 22:26:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:55,272 INFO L479 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2020-07-17 22:26:55,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2020-07-17 22:26:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:26:55,274 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:55,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:55,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-17 22:26:55,275 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:55,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:55,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2020-07-17 22:26:55,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:55,275 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495963631] [2020-07-17 22:26:55,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:55,307 INFO L280 TraceCheckUtils]: 0: Hoare triple {88786#true} assume true; {88786#true} is VALID [2020-07-17 22:26:55,308 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {88786#true} {88786#true} #180#return; {88786#true} is VALID [2020-07-17 22:26:55,308 INFO L263 TraceCheckUtils]: 0: Hoare triple {88786#true} call ULTIMATE.init(); {88786#true} is VALID [2020-07-17 22:26:55,310 INFO L280 TraceCheckUtils]: 1: Hoare triple {88786#true} assume true; {88786#true} is VALID [2020-07-17 22:26:55,310 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {88786#true} {88786#true} #180#return; {88786#true} is VALID [2020-07-17 22:26:55,311 INFO L263 TraceCheckUtils]: 3: Hoare triple {88786#true} call #t~ret10 := main(); {88786#true} is VALID [2020-07-17 22:26:55,311 INFO L280 TraceCheckUtils]: 4: Hoare triple {88786#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {88786#true} is VALID [2020-07-17 22:26:55,311 INFO L280 TraceCheckUtils]: 5: Hoare triple {88786#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {88786#true} is VALID [2020-07-17 22:26:55,311 INFO L280 TraceCheckUtils]: 6: Hoare triple {88786#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;~lk8~0 := 0;~lk9~0 := 0; {88786#true} is VALID [2020-07-17 22:26:55,311 INFO L280 TraceCheckUtils]: 7: Hoare triple {88786#true} assume !(0 != ~p1~0); {88786#true} is VALID [2020-07-17 22:26:55,312 INFO L280 TraceCheckUtils]: 8: Hoare triple {88786#true} assume !(0 != ~p2~0); {88786#true} is VALID [2020-07-17 22:26:55,312 INFO L280 TraceCheckUtils]: 9: Hoare triple {88786#true} assume !(0 != ~p3~0); {88786#true} is VALID [2020-07-17 22:26:55,312 INFO L280 TraceCheckUtils]: 10: Hoare triple {88786#true} assume !(0 != ~p4~0); {88786#true} is VALID [2020-07-17 22:26:55,312 INFO L280 TraceCheckUtils]: 11: Hoare triple {88786#true} assume !(0 != ~p5~0); {88786#true} is VALID [2020-07-17 22:26:55,312 INFO L280 TraceCheckUtils]: 12: Hoare triple {88786#true} assume !(0 != ~p6~0); {88786#true} is VALID [2020-07-17 22:26:55,313 INFO L280 TraceCheckUtils]: 13: Hoare triple {88786#true} assume !(0 != ~p7~0); {88786#true} is VALID [2020-07-17 22:26:55,314 INFO L280 TraceCheckUtils]: 14: Hoare triple {88786#true} assume !(0 != ~p8~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:55,315 INFO L280 TraceCheckUtils]: 15: Hoare triple {88790#(= 0 main_~p8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {88790#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:55,316 INFO L280 TraceCheckUtils]: 16: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:55,317 INFO L280 TraceCheckUtils]: 17: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:55,317 INFO L280 TraceCheckUtils]: 18: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:55,317 INFO L280 TraceCheckUtils]: 19: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:55,318 INFO L280 TraceCheckUtils]: 20: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:55,318 INFO L280 TraceCheckUtils]: 21: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:55,318 INFO L280 TraceCheckUtils]: 22: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:55,319 INFO L280 TraceCheckUtils]: 23: Hoare triple {88790#(= 0 main_~p8~0)} assume 0 != ~p8~0; {88787#false} is VALID [2020-07-17 22:26:55,319 INFO L280 TraceCheckUtils]: 24: Hoare triple {88787#false} assume 1 != ~lk8~0; {88787#false} is VALID [2020-07-17 22:26:55,319 INFO L280 TraceCheckUtils]: 25: Hoare triple {88787#false} assume !false; {88787#false} is VALID [2020-07-17 22:26:55,319 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:55,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495963631] [2020-07-17 22:26:55,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:55,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:55,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308186098] [2020-07-17 22:26:55,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:55,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:55,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:55,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:55,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:55,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:55,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:55,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:55,346 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2020-07-17 22:26:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:59,898 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2020-07-17 22:26:59,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:59,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-17 22:26:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-17 22:26:59,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2020-07-17 22:27:00,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:01,617 INFO L225 Difference]: With dead ends: 9804 [2020-07-17 22:27:01,618 INFO L226 Difference]: Without dead ends: 6538 [2020-07-17 22:27:01,622 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:27:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2020-07-17 22:27:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2020-07-17 22:27:03,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:03,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6538 states. Second operand 6536 states. [2020-07-17 22:27:03,250 INFO L74 IsIncluded]: Start isIncluded. First operand 6538 states. Second operand 6536 states. [2020-07-17 22:27:03,250 INFO L87 Difference]: Start difference. First operand 6538 states. Second operand 6536 states. [2020-07-17 22:27:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:04,529 INFO L93 Difference]: Finished difference Result 6538 states and 7815 transitions. [2020-07-17 22:27:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 6538 states and 7815 transitions. [2020-07-17 22:27:04,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:04,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:04,536 INFO L74 IsIncluded]: Start isIncluded. First operand 6536 states. Second operand 6538 states. [2020-07-17 22:27:04,536 INFO L87 Difference]: Start difference. First operand 6536 states. Second operand 6538 states. [2020-07-17 22:27:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:05,900 INFO L93 Difference]: Finished difference Result 6538 states and 7815 transitions. [2020-07-17 22:27:05,900 INFO L276 IsEmpty]: Start isEmpty. Operand 6538 states and 7815 transitions. [2020-07-17 22:27:05,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:05,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:05,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:05,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2020-07-17 22:27:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2020-07-17 22:27:07,218 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2020-07-17 22:27:07,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:07,218 INFO L479 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2020-07-17 22:27:07,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:27:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2020-07-17 22:27:07,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:27:07,220 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:07,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:07,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-17 22:27:07,221 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:07,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:07,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2020-07-17 22:27:07,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:07,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564020363] [2020-07-17 22:27:07,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:07,249 INFO L280 TraceCheckUtils]: 0: Hoare triple {118863#true} assume true; {118863#true} is VALID [2020-07-17 22:27:07,249 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {118863#true} {118863#true} #180#return; {118863#true} is VALID [2020-07-17 22:27:07,250 INFO L263 TraceCheckUtils]: 0: Hoare triple {118863#true} call ULTIMATE.init(); {118863#true} is VALID [2020-07-17 22:27:07,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {118863#true} assume true; {118863#true} is VALID [2020-07-17 22:27:07,250 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {118863#true} {118863#true} #180#return; {118863#true} is VALID [2020-07-17 22:27:07,250 INFO L263 TraceCheckUtils]: 3: Hoare triple {118863#true} call #t~ret10 := main(); {118863#true} is VALID [2020-07-17 22:27:07,250 INFO L280 TraceCheckUtils]: 4: Hoare triple {118863#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {118863#true} is VALID [2020-07-17 22:27:07,250 INFO L280 TraceCheckUtils]: 5: Hoare triple {118863#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {118863#true} is VALID [2020-07-17 22:27:07,251 INFO L280 TraceCheckUtils]: 6: Hoare triple {118863#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;~lk8~0 := 0;~lk9~0 := 0; {118863#true} is VALID [2020-07-17 22:27:07,251 INFO L280 TraceCheckUtils]: 7: Hoare triple {118863#true} assume !(0 != ~p1~0); {118863#true} is VALID [2020-07-17 22:27:07,251 INFO L280 TraceCheckUtils]: 8: Hoare triple {118863#true} assume !(0 != ~p2~0); {118863#true} is VALID [2020-07-17 22:27:07,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {118863#true} assume !(0 != ~p3~0); {118863#true} is VALID [2020-07-17 22:27:07,251 INFO L280 TraceCheckUtils]: 10: Hoare triple {118863#true} assume !(0 != ~p4~0); {118863#true} is VALID [2020-07-17 22:27:07,251 INFO L280 TraceCheckUtils]: 11: Hoare triple {118863#true} assume !(0 != ~p5~0); {118863#true} is VALID [2020-07-17 22:27:07,252 INFO L280 TraceCheckUtils]: 12: Hoare triple {118863#true} assume !(0 != ~p6~0); {118863#true} is VALID [2020-07-17 22:27:07,252 INFO L280 TraceCheckUtils]: 13: Hoare triple {118863#true} assume !(0 != ~p7~0); {118863#true} is VALID [2020-07-17 22:27:07,252 INFO L280 TraceCheckUtils]: 14: Hoare triple {118863#true} assume 0 != ~p8~0;~lk8~0 := 1; {118867#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:27:07,253 INFO L280 TraceCheckUtils]: 15: Hoare triple {118867#(= 1 main_~lk8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {118867#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:27:07,253 INFO L280 TraceCheckUtils]: 16: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:27:07,253 INFO L280 TraceCheckUtils]: 17: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:27:07,254 INFO L280 TraceCheckUtils]: 18: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:27:07,254 INFO L280 TraceCheckUtils]: 19: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:27:07,255 INFO L280 TraceCheckUtils]: 20: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:27:07,255 INFO L280 TraceCheckUtils]: 21: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:27:07,256 INFO L280 TraceCheckUtils]: 22: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:27:07,256 INFO L280 TraceCheckUtils]: 23: Hoare triple {118867#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {118867#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:27:07,256 INFO L280 TraceCheckUtils]: 24: Hoare triple {118867#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {118864#false} is VALID [2020-07-17 22:27:07,256 INFO L280 TraceCheckUtils]: 25: Hoare triple {118864#false} assume !false; {118864#false} is VALID [2020-07-17 22:27:07,257 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:27:07,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564020363] [2020-07-17 22:27:07,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:07,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:27:07,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856924674] [2020-07-17 22:27:07,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:27:07,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:07,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:27:07,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:07,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:27:07,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:07,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:27:07,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:27:07,285 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2020-07-17 22:27:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:11,232 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2020-07-17 22:27:11,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:27:11,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:27:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:27:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-17 22:27:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:27:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-17 22:27:11,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2020-07-17 22:27:11,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:13,102 INFO L225 Difference]: With dead ends: 7052 [2020-07-17 22:27:13,102 INFO L226 Difference]: Without dead ends: 7050 [2020-07-17 22:27:13,103 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:27:13,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2020-07-17 22:27:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2020-07-17 22:27:14,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:14,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7050 states. Second operand 6536 states. [2020-07-17 22:27:14,783 INFO L74 IsIncluded]: Start isIncluded. First operand 7050 states. Second operand 6536 states. [2020-07-17 22:27:14,783 INFO L87 Difference]: Start difference. First operand 7050 states. Second operand 6536 states. [2020-07-17 22:27:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:16,325 INFO L93 Difference]: Finished difference Result 7050 states and 8455 transitions. [2020-07-17 22:27:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 8455 transitions. [2020-07-17 22:27:16,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:16,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:16,329 INFO L74 IsIncluded]: Start isIncluded. First operand 6536 states. Second operand 7050 states. [2020-07-17 22:27:16,329 INFO L87 Difference]: Start difference. First operand 6536 states. Second operand 7050 states. [2020-07-17 22:27:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:17,882 INFO L93 Difference]: Finished difference Result 7050 states and 8455 transitions. [2020-07-17 22:27:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 8455 transitions. [2020-07-17 22:27:17,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:17,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:17,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:17,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2020-07-17 22:27:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2020-07-17 22:27:19,424 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2020-07-17 22:27:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:19,424 INFO L479 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2020-07-17 22:27:19,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:27:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2020-07-17 22:27:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:27:19,499 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:19,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:19,499 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-17 22:27:19,499 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:19,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:19,500 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2020-07-17 22:27:19,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:19,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259665660] [2020-07-17 22:27:19,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:19,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {147212#true} assume true; {147212#true} is VALID [2020-07-17 22:27:19,537 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {147212#true} {147212#true} #180#return; {147212#true} is VALID [2020-07-17 22:27:19,537 INFO L263 TraceCheckUtils]: 0: Hoare triple {147212#true} call ULTIMATE.init(); {147212#true} is VALID [2020-07-17 22:27:19,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {147212#true} assume true; {147212#true} is VALID [2020-07-17 22:27:19,538 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {147212#true} {147212#true} #180#return; {147212#true} is VALID [2020-07-17 22:27:19,538 INFO L263 TraceCheckUtils]: 3: Hoare triple {147212#true} call #t~ret10 := main(); {147212#true} is VALID [2020-07-17 22:27:19,538 INFO L280 TraceCheckUtils]: 4: Hoare triple {147212#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {147212#true} is VALID [2020-07-17 22:27:19,539 INFO L280 TraceCheckUtils]: 5: Hoare triple {147212#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {147212#true} is VALID [2020-07-17 22:27:19,539 INFO L280 TraceCheckUtils]: 6: Hoare triple {147212#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;~lk8~0 := 0;~lk9~0 := 0; {147212#true} is VALID [2020-07-17 22:27:19,539 INFO L280 TraceCheckUtils]: 7: Hoare triple {147212#true} assume !(0 != ~p1~0); {147212#true} is VALID [2020-07-17 22:27:19,539 INFO L280 TraceCheckUtils]: 8: Hoare triple {147212#true} assume !(0 != ~p2~0); {147212#true} is VALID [2020-07-17 22:27:19,539 INFO L280 TraceCheckUtils]: 9: Hoare triple {147212#true} assume !(0 != ~p3~0); {147212#true} is VALID [2020-07-17 22:27:19,539 INFO L280 TraceCheckUtils]: 10: Hoare triple {147212#true} assume !(0 != ~p4~0); {147212#true} is VALID [2020-07-17 22:27:19,540 INFO L280 TraceCheckUtils]: 11: Hoare triple {147212#true} assume !(0 != ~p5~0); {147212#true} is VALID [2020-07-17 22:27:19,540 INFO L280 TraceCheckUtils]: 12: Hoare triple {147212#true} assume !(0 != ~p6~0); {147212#true} is VALID [2020-07-17 22:27:19,540 INFO L280 TraceCheckUtils]: 13: Hoare triple {147212#true} assume !(0 != ~p7~0); {147212#true} is VALID [2020-07-17 22:27:19,540 INFO L280 TraceCheckUtils]: 14: Hoare triple {147212#true} assume !(0 != ~p8~0); {147212#true} is VALID [2020-07-17 22:27:19,541 INFO L280 TraceCheckUtils]: 15: Hoare triple {147212#true} assume 0 != ~p9~0;~lk9~0 := 1; {147216#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:19,541 INFO L280 TraceCheckUtils]: 16: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p1~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:19,542 INFO L280 TraceCheckUtils]: 17: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p2~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:19,542 INFO L280 TraceCheckUtils]: 18: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p3~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:19,543 INFO L280 TraceCheckUtils]: 19: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p4~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:19,543 INFO L280 TraceCheckUtils]: 20: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p5~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:19,544 INFO L280 TraceCheckUtils]: 21: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p6~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:19,544 INFO L280 TraceCheckUtils]: 22: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p7~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:19,545 INFO L280 TraceCheckUtils]: 23: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p8~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:19,545 INFO L280 TraceCheckUtils]: 24: Hoare triple {147216#(= 1 main_~lk9~0)} assume 0 != ~p9~0; {147216#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:19,546 INFO L280 TraceCheckUtils]: 25: Hoare triple {147216#(= 1 main_~lk9~0)} assume 1 != ~lk9~0; {147213#false} is VALID [2020-07-17 22:27:19,546 INFO L280 TraceCheckUtils]: 26: Hoare triple {147213#false} assume !false; {147213#false} is VALID [2020-07-17 22:27:19,547 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:27:19,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259665660] [2020-07-17 22:27:19,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:19,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:27:19,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688060165] [2020-07-17 22:27:19,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:27:19,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:19,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:27:19,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:19,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:27:19,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:19,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:27:19,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:27:19,581 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2020-07-17 22:27:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:26,203 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2020-07-17 22:27:26,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:27:26,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:27:26,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:27:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2020-07-17 22:27:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:27:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2020-07-17 22:27:26,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2020-07-17 22:27:26,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:30,234 INFO L225 Difference]: With dead ends: 10634 [2020-07-17 22:27:30,234 INFO L226 Difference]: Without dead ends: 10632 [2020-07-17 22:27:30,235 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:27:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2020-07-17 22:27:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2020-07-17 22:27:31,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:31,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10632 states. Second operand 10120 states. [2020-07-17 22:27:31,992 INFO L74 IsIncluded]: Start isIncluded. First operand 10632 states. Second operand 10120 states. [2020-07-17 22:27:31,992 INFO L87 Difference]: Start difference. First operand 10632 states. Second operand 10120 states. [2020-07-17 22:27:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:35,079 INFO L93 Difference]: Finished difference Result 10632 states and 12166 transitions. [2020-07-17 22:27:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 12166 transitions. [2020-07-17 22:27:35,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:35,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:35,085 INFO L74 IsIncluded]: Start isIncluded. First operand 10120 states. Second operand 10632 states. [2020-07-17 22:27:35,086 INFO L87 Difference]: Start difference. First operand 10120 states. Second operand 10632 states. [2020-07-17 22:27:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:38,410 INFO L93 Difference]: Finished difference Result 10632 states and 12166 transitions. [2020-07-17 22:27:38,410 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 12166 transitions. [2020-07-17 22:27:38,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:38,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:38,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:38,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2020-07-17 22:27:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2020-07-17 22:27:41,652 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2020-07-17 22:27:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:41,652 INFO L479 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2020-07-17 22:27:41,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:27:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2020-07-17 22:27:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:27:41,659 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:41,659 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:41,660 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-17 22:27:41,660 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:41,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:41,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2020-07-17 22:27:41,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:41,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597844982] [2020-07-17 22:27:41,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:41,684 INFO L280 TraceCheckUtils]: 0: Hoare triple {190018#true} assume true; {190018#true} is VALID [2020-07-17 22:27:41,684 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {190018#true} {190018#true} #180#return; {190018#true} is VALID [2020-07-17 22:27:41,684 INFO L263 TraceCheckUtils]: 0: Hoare triple {190018#true} call ULTIMATE.init(); {190018#true} is VALID [2020-07-17 22:27:41,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {190018#true} assume true; {190018#true} is VALID [2020-07-17 22:27:41,685 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {190018#true} {190018#true} #180#return; {190018#true} is VALID [2020-07-17 22:27:41,685 INFO L263 TraceCheckUtils]: 3: Hoare triple {190018#true} call #t~ret10 := main(); {190018#true} is VALID [2020-07-17 22:27:41,685 INFO L280 TraceCheckUtils]: 4: Hoare triple {190018#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;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {190018#true} is VALID [2020-07-17 22:27:41,685 INFO L280 TraceCheckUtils]: 5: Hoare triple {190018#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {190018#true} is VALID [2020-07-17 22:27:41,686 INFO L280 TraceCheckUtils]: 6: Hoare triple {190018#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;~lk8~0 := 0;~lk9~0 := 0; {190018#true} is VALID [2020-07-17 22:27:41,686 INFO L280 TraceCheckUtils]: 7: Hoare triple {190018#true} assume !(0 != ~p1~0); {190018#true} is VALID [2020-07-17 22:27:41,686 INFO L280 TraceCheckUtils]: 8: Hoare triple {190018#true} assume !(0 != ~p2~0); {190018#true} is VALID [2020-07-17 22:27:41,686 INFO L280 TraceCheckUtils]: 9: Hoare triple {190018#true} assume !(0 != ~p3~0); {190018#true} is VALID [2020-07-17 22:27:41,686 INFO L280 TraceCheckUtils]: 10: Hoare triple {190018#true} assume !(0 != ~p4~0); {190018#true} is VALID [2020-07-17 22:27:41,687 INFO L280 TraceCheckUtils]: 11: Hoare triple {190018#true} assume !(0 != ~p5~0); {190018#true} is VALID [2020-07-17 22:27:41,687 INFO L280 TraceCheckUtils]: 12: Hoare triple {190018#true} assume !(0 != ~p6~0); {190018#true} is VALID [2020-07-17 22:27:41,687 INFO L280 TraceCheckUtils]: 13: Hoare triple {190018#true} assume !(0 != ~p7~0); {190018#true} is VALID [2020-07-17 22:27:41,687 INFO L280 TraceCheckUtils]: 14: Hoare triple {190018#true} assume !(0 != ~p8~0); {190018#true} is VALID [2020-07-17 22:27:41,688 INFO L280 TraceCheckUtils]: 15: Hoare triple {190018#true} assume !(0 != ~p9~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,697 INFO L280 TraceCheckUtils]: 16: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p1~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,699 INFO L280 TraceCheckUtils]: 17: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p2~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,700 INFO L280 TraceCheckUtils]: 18: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p3~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,701 INFO L280 TraceCheckUtils]: 19: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p4~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,701 INFO L280 TraceCheckUtils]: 20: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p5~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,701 INFO L280 TraceCheckUtils]: 21: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p6~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,702 INFO L280 TraceCheckUtils]: 22: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p7~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,702 INFO L280 TraceCheckUtils]: 23: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p8~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,703 INFO L280 TraceCheckUtils]: 24: Hoare triple {190022#(= 0 main_~p9~0)} assume 0 != ~p9~0; {190019#false} is VALID [2020-07-17 22:27:41,703 INFO L280 TraceCheckUtils]: 25: Hoare triple {190019#false} assume 1 != ~lk9~0; {190019#false} is VALID [2020-07-17 22:27:41,703 INFO L280 TraceCheckUtils]: 26: Hoare triple {190019#false} assume !false; {190019#false} is VALID [2020-07-17 22:27:41,704 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:27:41,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597844982] [2020-07-17 22:27:41,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:41,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:27:41,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260228193] [2020-07-17 22:27:41,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:27:41,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:41,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:27:41,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:41,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:27:41,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:41,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:27:41,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:27:41,731 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2020-07-17 22:28:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:09,704 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2020-07-17 22:28:09,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:28:09,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:28:09,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:28:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:28:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-17 22:28:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:28:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-17 22:28:09,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2020-07-17 22:28:09,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:28:09,851 INFO L225 Difference]: With dead ends: 22664 [2020-07-17 22:28:09,851 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:28:09,875 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:28:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:28:09,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:28:09,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:28:09,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:28:09,876 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:28:09,876 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:28:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:09,876 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:28:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:28:09,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:09,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:09,877 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:28:09,877 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:28:09,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:09,878 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:28:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:28:09,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:09,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:09,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:28:09,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:28:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:28:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:28:09,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2020-07-17 22:28:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:28:09,879 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:28:09,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:28:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:28:09,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:09,880 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-17 22:28:09,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:28:09,914 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:28:09,915 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:28:09,915 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:28:09,915 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:28:09,915 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:28:09,915 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:28:09,915 INFO L268 CegarLoopResult]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,915 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2020-07-17 22:28:09,915 INFO L268 CegarLoopResult]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,916 INFO L268 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-07-17 22:28:09,916 INFO L268 CegarLoopResult]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,916 INFO L268 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2020-07-17 22:28:09,916 INFO L268 CegarLoopResult]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,916 INFO L268 CegarLoopResult]: For program point L61(lines 61 63) no Hoare annotation was computed. [2020-07-17 22:28:09,916 INFO L268 CegarLoopResult]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,917 INFO L268 CegarLoopResult]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,917 INFO L268 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2020-07-17 22:28:09,918 INFO L271 CegarLoopResult]: At program point L145(lines 5 149) the Hoare annotation is: true [2020-07-17 22:28:09,918 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2020-07-17 22:28:09,918 INFO L268 CegarLoopResult]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,918 INFO L268 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2020-07-17 22:28:09,918 INFO L268 CegarLoopResult]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,918 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2020-07-17 22:28:09,919 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2020-07-17 22:28:09,919 INFO L268 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2020-07-17 22:28:09,919 INFO L268 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2020-07-17 22:28:09,919 INFO L268 CegarLoopResult]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,919 INFO L268 CegarLoopResult]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,919 INFO L268 CegarLoopResult]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,919 INFO L271 CegarLoopResult]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2020-07-17 22:28:09,919 INFO L268 CegarLoopResult]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,920 INFO L268 CegarLoopResult]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,920 INFO L268 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2020-07-17 22:28:09,920 INFO L268 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-07-17 22:28:09,920 INFO L264 CegarLoopResult]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2020-07-17 22:28:09,920 INFO L268 CegarLoopResult]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,920 INFO L268 CegarLoopResult]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,920 INFO L268 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2020-07-17 22:28:09,920 INFO L268 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-07-17 22:28:09,921 INFO L268 CegarLoopResult]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,921 INFO L268 CegarLoopResult]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2020-07-17 22:28:09,925 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:28:09,926 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:28:09,926 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:28:09,926 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:28:09,926 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:28:09,926 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:28:09,926 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:28:09,926 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:28:09,927 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:28:09,927 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-17 22:28:09,927 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-17 22:28:09,927 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:28:09,927 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2020-07-17 22:28:09,927 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2020-07-17 22:28:09,927 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-17 22:28:09,927 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-17 22:28:09,927 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2020-07-17 22:28:09,927 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2020-07-17 22:28:09,928 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2020-07-17 22:28:09,928 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2020-07-17 22:28:09,928 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-17 22:28:09,928 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-17 22:28:09,928 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2020-07-17 22:28:09,928 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2020-07-17 22:28:09,928 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2020-07-17 22:28:09,928 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2020-07-17 22:28:09,928 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2020-07-17 22:28:09,928 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2020-07-17 22:28:09,929 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2020-07-17 22:28:09,929 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2020-07-17 22:28:09,929 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2020-07-17 22:28:09,929 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2020-07-17 22:28:09,929 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2020-07-17 22:28:09,929 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2020-07-17 22:28:09,930 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-17 22:28:09,931 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:28:09,931 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2020-07-17 22:28:09,931 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2020-07-17 22:28:09,931 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2020-07-17 22:28:09,931 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2020-07-17 22:28:09,931 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2020-07-17 22:28:09,931 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2020-07-17 22:28:09,931 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2020-07-17 22:28:09,931 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2020-07-17 22:28:09,931 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2020-07-17 22:28:09,932 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2020-07-17 22:28:09,932 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2020-07-17 22:28:09,932 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2020-07-17 22:28:09,932 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2020-07-17 22:28:09,932 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2020-07-17 22:28:09,932 WARN L170 areAnnotationChecker]: L119-1 has no Hoare annotation [2020-07-17 22:28:09,932 WARN L170 areAnnotationChecker]: L119-1 has no Hoare annotation [2020-07-17 22:28:09,932 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2020-07-17 22:28:09,932 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2020-07-17 22:28:09,932 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2020-07-17 22:28:09,933 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2020-07-17 22:28:09,933 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2020-07-17 22:28:09,933 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2020-07-17 22:28:09,933 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2020-07-17 22:28:09,933 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2020-07-17 22:28:09,933 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2020-07-17 22:28:09,933 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2020-07-17 22:28:09,933 WARN L170 areAnnotationChecker]: L134-1 has no Hoare annotation [2020-07-17 22:28:09,933 WARN L170 areAnnotationChecker]: L134-1 has no Hoare annotation [2020-07-17 22:28:09,933 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2020-07-17 22:28:09,933 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2020-07-17 22:28:09,934 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:28:09,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:28:09 BoogieIcfgContainer [2020-07-17 22:28:09,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:28:09,946 INFO L168 Benchmark]: Toolchain (without parser) took 100234.20 ms. Allocated memory was 136.8 MB in the beginning and 725.6 MB in the end (delta: 588.8 MB). Free memory was 102.2 MB in the beginning and 476.7 MB in the end (delta: -374.5 MB). Peak memory consumption was 214.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:09,947 INFO L168 Benchmark]: CDTParser took 1.51 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-17 22:28:09,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.32 ms. Allocated memory is still 136.8 MB. Free memory was 101.7 MB in the beginning and 90.9 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:09,948 INFO L168 Benchmark]: Boogie Preprocessor took 136.80 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 90.9 MB in the beginning and 178.2 MB in the end (delta: -87.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:09,950 INFO L168 Benchmark]: RCFGBuilder took 547.74 ms. Allocated memory is still 200.3 MB. Free memory was 178.2 MB in the beginning and 150.6 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:09,951 INFO L168 Benchmark]: TraceAbstraction took 99267.08 ms. Allocated memory was 200.3 MB in the beginning and 725.6 MB in the end (delta: 525.3 MB). Free memory was 149.9 MB in the beginning and 476.7 MB in the end (delta: -326.8 MB). Peak memory consumption was 198.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:09,953 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.51 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 276.32 ms. Allocated memory is still 136.8 MB. Free memory was 101.7 MB in the beginning and 90.9 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.80 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 90.9 MB in the beginning and 178.2 MB in the end (delta: -87.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 547.74 ms. Allocated memory is still 200.3 MB. Free memory was 178.2 MB in the beginning and 150.6 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99267.08 ms. Allocated memory was 200.3 MB in the beginning and 725.6 MB in the end (delta: 525.3 MB). Free memory was 149.9 MB in the beginning and 476.7 MB in the end (delta: -326.8 MB). Peak memory consumption was 198.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 99.1s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 65.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 31.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 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.9s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...