/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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:20:48,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:20:48,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:20:48,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:20:48,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:20:48,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:20:48,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:20:48,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:20:48,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:20:48,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:20:48,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:20:48,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:20:48,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:20:48,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:20:48,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:20:48,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:20:48,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:20:48,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:20:48,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:20:48,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:20:48,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:20:48,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:20:48,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:20:48,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:20:48,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:20:48,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:20:48,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:20:48,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:20:48,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:20:48,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:20:48,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:20:48,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:20:48,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:20:48,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:20:48,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:20:48,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:20:48,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:20:48,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:20:48,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:20:48,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:20:48,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:20:48,856 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-08 12:20:48,870 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:20:48,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:20:48,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:20:48,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:20:48,872 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:20:48,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:20:48,872 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:20:48,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:20:48,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:20:48,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:20:48,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:20:48,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:20:48,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:20:48,874 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:20:48,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:20:48,874 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:20:48,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:20:48,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:20:48,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:20:48,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:20:48,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:20:48,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:20:48,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:20:48,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:20:48,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:20:48,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:20:48,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:20:48,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:20:48,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:20:48,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:20:49,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:20:49,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:20:49,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:20:49,182 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:20:49,182 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:20:49,183 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2020-07-08 12:20:49,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029bb97d4/c8a7795a8c504e8d88a74d1c94085d11/FLAGc29a7dd02 [2020-07-08 12:20:49,707 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:20:49,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2020-07-08 12:20:49,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029bb97d4/c8a7795a8c504e8d88a74d1c94085d11/FLAGc29a7dd02 [2020-07-08 12:20:50,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029bb97d4/c8a7795a8c504e8d88a74d1c94085d11 [2020-07-08 12:20:50,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:20:50,087 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:20:50,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:20:50,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:20:50,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:20:50,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:20:50" (1/1) ... [2020-07-08 12:20:50,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5a1e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:50, skipping insertion in model container [2020-07-08 12:20:50,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:20:50" (1/1) ... [2020-07-08 12:20:50,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:20:50,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:20:50,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:20:50,350 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:20:50,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:20:50,395 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:20:50,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:50 WrapperNode [2020-07-08 12:20:50,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:20:50,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:20:50,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:20:50,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:20:50,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:50" (1/1) ... [2020-07-08 12:20:50,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:50" (1/1) ... [2020-07-08 12:20:50,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:50" (1/1) ... [2020-07-08 12:20:50,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:50" (1/1) ... [2020-07-08 12:20:50,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:50" (1/1) ... [2020-07-08 12:20:50,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:50" (1/1) ... [2020-07-08 12:20:50,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:50" (1/1) ... [2020-07-08 12:20:50,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:20:50,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:20:50,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:20:50,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:20:50,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:50" (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-08 12:20:50,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:20:50,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:20:50,575 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:20:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:20:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:20:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:20:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:20:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:20:51,072 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:20:51,072 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:20:51,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:20:51 BoogieIcfgContainer [2020-07-08 12:20:51,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:20:51,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:20:51,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:20:51,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:20:51,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:20:50" (1/3) ... [2020-07-08 12:20:51,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c73cb99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:20:51, skipping insertion in model container [2020-07-08 12:20:51,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:50" (2/3) ... [2020-07-08 12:20:51,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c73cb99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:20:51, skipping insertion in model container [2020-07-08 12:20:51,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:20:51" (3/3) ... [2020-07-08 12:20:51,084 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2020-07-08 12:20:51,093 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:20:51,100 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:20:51,113 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:20:51,134 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:20:51,134 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:20:51,134 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:20:51,134 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:20:51,134 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:20:51,135 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:20:51,135 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:20:51,135 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:20:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-07-08 12:20:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:20:51,158 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:51,158 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-08 12:20:51,159 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:51,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:51,164 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2020-07-08 12:20:51,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:51,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735638201] [2020-07-08 12:20:51,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:51,438 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#true} assume true; {50#true} is VALID [2020-07-08 12:20:51,439 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {50#true} {50#true} #214#return; {50#true} is VALID [2020-07-08 12:20:51,441 INFO L263 TraceCheckUtils]: 0: Hoare triple {50#true} call ULTIMATE.init(); {50#true} is VALID [2020-07-08 12:20:51,442 INFO L280 TraceCheckUtils]: 1: Hoare triple {50#true} assume true; {50#true} is VALID [2020-07-08 12:20:51,444 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {50#true} {50#true} #214#return; {50#true} is VALID [2020-07-08 12:20:51,444 INFO L263 TraceCheckUtils]: 3: Hoare triple {50#true} call #t~ret12 := main(); {50#true} is VALID [2020-07-08 12:20:51,445 INFO L280 TraceCheckUtils]: 4: Hoare triple {50#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {50#true} is VALID [2020-07-08 12:20:51,445 INFO L280 TraceCheckUtils]: 5: Hoare triple {50#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {50#true} is VALID [2020-07-08 12:20:51,446 INFO L280 TraceCheckUtils]: 6: Hoare triple {50#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;~lk10~0 := 0;~lk11~0 := 0; {50#true} is VALID [2020-07-08 12:20:51,448 INFO L280 TraceCheckUtils]: 7: Hoare triple {50#true} assume 0 != ~p1~0;~lk1~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:51,452 INFO L280 TraceCheckUtils]: 8: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:51,456 INFO L280 TraceCheckUtils]: 9: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:51,457 INFO L280 TraceCheckUtils]: 10: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:51,459 INFO L280 TraceCheckUtils]: 11: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:51,463 INFO L280 TraceCheckUtils]: 12: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:51,465 INFO L280 TraceCheckUtils]: 13: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:51,466 INFO L280 TraceCheckUtils]: 14: Hoare triple {54#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {54#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:51,469 INFO L280 TraceCheckUtils]: 15: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:51,470 INFO L280 TraceCheckUtils]: 16: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:51,472 INFO L280 TraceCheckUtils]: 17: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p11~0;~lk11~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:51,473 INFO L280 TraceCheckUtils]: 18: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {54#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:51,474 INFO L280 TraceCheckUtils]: 19: Hoare triple {54#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {51#false} is VALID [2020-07-08 12:20:51,475 INFO L280 TraceCheckUtils]: 20: Hoare triple {51#false} assume !false; {51#false} is VALID [2020-07-08 12:20:51,481 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-08 12:20:51,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735638201] [2020-07-08 12:20:51,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:51,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:51,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670807475] [2020-07-08 12:20:51,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:20:51,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:51,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:51,572 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-08 12:20:51,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:51,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:51,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:51,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:51,588 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2020-07-08 12:20:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:51,882 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2020-07-08 12:20:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:51,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:20:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-08 12:20:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-08 12:20:51,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2020-07-08 12:20:52,161 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-08 12:20:52,178 INFO L225 Difference]: With dead ends: 93 [2020-07-08 12:20:52,179 INFO L226 Difference]: Without dead ends: 78 [2020-07-08 12:20:52,183 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-08 12:20:52,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-08 12:20:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2020-07-08 12:20:52,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:52,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 54 states. [2020-07-08 12:20:52,229 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 54 states. [2020-07-08 12:20:52,230 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 54 states. [2020-07-08 12:20:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:52,239 INFO L93 Difference]: Finished difference Result 78 states and 140 transitions. [2020-07-08 12:20:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 140 transitions. [2020-07-08 12:20:52,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:52,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:52,241 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 78 states. [2020-07-08 12:20:52,241 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 78 states. [2020-07-08 12:20:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:52,249 INFO L93 Difference]: Finished difference Result 78 states and 140 transitions. [2020-07-08 12:20:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 140 transitions. [2020-07-08 12:20:52,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:52,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:52,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:52,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-08 12:20:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2020-07-08 12:20:52,258 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2020-07-08 12:20:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:52,259 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2020-07-08 12:20:52,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2020-07-08 12:20:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:20:52,260 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:52,261 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-08 12:20:52,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:20:52,261 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:52,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:52,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2020-07-08 12:20:52,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:52,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442522966] [2020-07-08 12:20:52,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:52,374 INFO L280 TraceCheckUtils]: 0: Hoare triple {378#true} assume true; {378#true} is VALID [2020-07-08 12:20:52,374 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {378#true} {378#true} #214#return; {378#true} is VALID [2020-07-08 12:20:52,375 INFO L263 TraceCheckUtils]: 0: Hoare triple {378#true} call ULTIMATE.init(); {378#true} is VALID [2020-07-08 12:20:52,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {378#true} assume true; {378#true} is VALID [2020-07-08 12:20:52,376 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {378#true} {378#true} #214#return; {378#true} is VALID [2020-07-08 12:20:52,377 INFO L263 TraceCheckUtils]: 3: Hoare triple {378#true} call #t~ret12 := main(); {378#true} is VALID [2020-07-08 12:20:52,378 INFO L280 TraceCheckUtils]: 4: Hoare triple {378#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {378#true} is VALID [2020-07-08 12:20:52,378 INFO L280 TraceCheckUtils]: 5: Hoare triple {378#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {378#true} is VALID [2020-07-08 12:20:52,378 INFO L280 TraceCheckUtils]: 6: Hoare triple {378#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;~lk10~0 := 0;~lk11~0 := 0; {378#true} is VALID [2020-07-08 12:20:52,380 INFO L280 TraceCheckUtils]: 7: Hoare triple {378#true} assume !(0 != ~p1~0); {382#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:52,381 INFO L280 TraceCheckUtils]: 8: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:52,383 INFO L280 TraceCheckUtils]: 9: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:52,384 INFO L280 TraceCheckUtils]: 10: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:52,384 INFO L280 TraceCheckUtils]: 11: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:52,386 INFO L280 TraceCheckUtils]: 12: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:52,387 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:52,388 INFO L280 TraceCheckUtils]: 14: Hoare triple {382#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {382#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:52,388 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:52,389 INFO L280 TraceCheckUtils]: 16: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:52,390 INFO L280 TraceCheckUtils]: 17: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p11~0;~lk11~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:52,391 INFO L280 TraceCheckUtils]: 18: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p1~0; {379#false} is VALID [2020-07-08 12:20:52,392 INFO L280 TraceCheckUtils]: 19: Hoare triple {379#false} assume 1 != ~lk1~0; {379#false} is VALID [2020-07-08 12:20:52,392 INFO L280 TraceCheckUtils]: 20: Hoare triple {379#false} assume !false; {379#false} is VALID [2020-07-08 12:20:52,393 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-08 12:20:52,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442522966] [2020-07-08 12:20:52,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:52,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:52,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481677784] [2020-07-08 12:20:52,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:20:52,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:52,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:52,425 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-08 12:20:52,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:52,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:52,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:52,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:52,426 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2020-07-08 12:20:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:52,610 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2020-07-08 12:20:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:52,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:20:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2020-07-08 12:20:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2020-07-08 12:20:52,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 209 transitions. [2020-07-08 12:20:52,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:52,879 INFO L225 Difference]: With dead ends: 127 [2020-07-08 12:20:52,880 INFO L226 Difference]: Without dead ends: 78 [2020-07-08 12:20:52,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-08 12:20:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-07-08 12:20:52,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:52,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2020-07-08 12:20:52,898 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2020-07-08 12:20:52,898 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2020-07-08 12:20:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:52,905 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2020-07-08 12:20:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 138 transitions. [2020-07-08 12:20:52,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:52,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:52,909 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2020-07-08 12:20:52,909 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2020-07-08 12:20:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:52,919 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2020-07-08 12:20:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 138 transitions. [2020-07-08 12:20:52,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:52,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:52,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:52,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-08 12:20:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2020-07-08 12:20:52,931 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2020-07-08 12:20:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:52,931 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2020-07-08 12:20:52,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2020-07-08 12:20:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:20:52,938 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:52,938 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-08 12:20:52,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:20:52,939 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:52,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:52,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2020-07-08 12:20:52,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:52,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532790577] [2020-07-08 12:20:52,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:53,051 INFO L280 TraceCheckUtils]: 0: Hoare triple {761#true} assume true; {761#true} is VALID [2020-07-08 12:20:53,052 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {761#true} {761#true} #214#return; {761#true} is VALID [2020-07-08 12:20:53,052 INFO L263 TraceCheckUtils]: 0: Hoare triple {761#true} call ULTIMATE.init(); {761#true} is VALID [2020-07-08 12:20:53,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {761#true} assume true; {761#true} is VALID [2020-07-08 12:20:53,053 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {761#true} {761#true} #214#return; {761#true} is VALID [2020-07-08 12:20:53,053 INFO L263 TraceCheckUtils]: 3: Hoare triple {761#true} call #t~ret12 := main(); {761#true} is VALID [2020-07-08 12:20:53,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {761#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {761#true} is VALID [2020-07-08 12:20:53,054 INFO L280 TraceCheckUtils]: 5: Hoare triple {761#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {761#true} is VALID [2020-07-08 12:20:53,055 INFO L280 TraceCheckUtils]: 6: Hoare triple {761#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;~lk10~0 := 0;~lk11~0 := 0; {761#true} is VALID [2020-07-08 12:20:53,055 INFO L280 TraceCheckUtils]: 7: Hoare triple {761#true} assume 0 != ~p1~0;~lk1~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:53,056 INFO L280 TraceCheckUtils]: 8: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:53,057 INFO L280 TraceCheckUtils]: 9: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:53,058 INFO L280 TraceCheckUtils]: 10: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:53,058 INFO L280 TraceCheckUtils]: 11: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:53,059 INFO L280 TraceCheckUtils]: 12: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:53,060 INFO L280 TraceCheckUtils]: 13: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p7~0;~lk7~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:53,060 INFO L280 TraceCheckUtils]: 14: Hoare triple {765#(not (= 0 main_~p1~0))} assume !(0 != ~p8~0); {765#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:53,061 INFO L280 TraceCheckUtils]: 15: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p9~0;~lk9~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:53,062 INFO L280 TraceCheckUtils]: 16: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p10~0;~lk10~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:53,063 INFO L280 TraceCheckUtils]: 17: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p11~0;~lk11~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:53,063 INFO L280 TraceCheckUtils]: 18: Hoare triple {765#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {762#false} is VALID [2020-07-08 12:20:53,064 INFO L280 TraceCheckUtils]: 19: Hoare triple {762#false} assume 0 != ~p2~0; {762#false} is VALID [2020-07-08 12:20:53,064 INFO L280 TraceCheckUtils]: 20: Hoare triple {762#false} assume 1 != ~lk2~0; {762#false} is VALID [2020-07-08 12:20:53,064 INFO L280 TraceCheckUtils]: 21: Hoare triple {762#false} assume !false; {762#false} is VALID [2020-07-08 12:20:53,066 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-08 12:20:53,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532790577] [2020-07-08 12:20:53,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:53,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:53,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865487614] [2020-07-08 12:20:53,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:20:53,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:53,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:53,099 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-08 12:20:53,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:53,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:53,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:53,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:53,111 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2020-07-08 12:20:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:53,246 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2020-07-08 12:20:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:53,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:20:53,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2020-07-08 12:20:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2020-07-08 12:20:53,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 204 transitions. [2020-07-08 12:20:53,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:53,456 INFO L225 Difference]: With dead ends: 117 [2020-07-08 12:20:53,456 INFO L226 Difference]: Without dead ends: 81 [2020-07-08 12:20:53,457 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-08 12:20:53,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-08 12:20:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2020-07-08 12:20:53,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:53,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 79 states. [2020-07-08 12:20:53,480 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 79 states. [2020-07-08 12:20:53,480 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 79 states. [2020-07-08 12:20:53,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:53,485 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2020-07-08 12:20:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 140 transitions. [2020-07-08 12:20:53,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:53,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:53,487 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 81 states. [2020-07-08 12:20:53,487 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 81 states. [2020-07-08 12:20:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:53,491 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2020-07-08 12:20:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 140 transitions. [2020-07-08 12:20:53,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:53,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:53,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:53,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-08 12:20:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2020-07-08 12:20:53,497 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2020-07-08 12:20:53,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:53,498 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2020-07-08 12:20:53,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2020-07-08 12:20:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:20:53,499 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:53,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] [2020-07-08 12:20:53,499 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:20:53,499 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:53,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2020-07-08 12:20:53,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:53,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030822126] [2020-07-08 12:20:53,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:53,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-08 12:20:53,559 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1145#true} {1145#true} #214#return; {1145#true} is VALID [2020-07-08 12:20:53,559 INFO L263 TraceCheckUtils]: 0: Hoare triple {1145#true} call ULTIMATE.init(); {1145#true} is VALID [2020-07-08 12:20:53,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-08 12:20:53,559 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1145#true} {1145#true} #214#return; {1145#true} is VALID [2020-07-08 12:20:53,560 INFO L263 TraceCheckUtils]: 3: Hoare triple {1145#true} call #t~ret12 := main(); {1145#true} is VALID [2020-07-08 12:20:53,560 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {1145#true} is VALID [2020-07-08 12:20:53,560 INFO L280 TraceCheckUtils]: 5: Hoare triple {1145#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1145#true} is VALID [2020-07-08 12:20:53,561 INFO L280 TraceCheckUtils]: 6: Hoare triple {1145#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;~lk10~0 := 0;~lk11~0 := 0; {1145#true} is VALID [2020-07-08 12:20:53,561 INFO L280 TraceCheckUtils]: 7: Hoare triple {1145#true} assume !(0 != ~p1~0); {1145#true} is VALID [2020-07-08 12:20:53,562 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#true} assume 0 != ~p2~0;~lk2~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:53,562 INFO L280 TraceCheckUtils]: 9: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:53,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:53,563 INFO L280 TraceCheckUtils]: 11: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:53,564 INFO L280 TraceCheckUtils]: 12: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:53,565 INFO L280 TraceCheckUtils]: 13: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:53,565 INFO L280 TraceCheckUtils]: 14: Hoare triple {1149#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {1149#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:53,566 INFO L280 TraceCheckUtils]: 15: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:53,566 INFO L280 TraceCheckUtils]: 16: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p10~0;~lk10~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:53,567 INFO L280 TraceCheckUtils]: 17: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p11~0;~lk11~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:53,568 INFO L280 TraceCheckUtils]: 18: Hoare triple {1149#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {1149#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:53,568 INFO L280 TraceCheckUtils]: 19: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:53,569 INFO L280 TraceCheckUtils]: 20: Hoare triple {1149#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {1146#false} is VALID [2020-07-08 12:20:53,569 INFO L280 TraceCheckUtils]: 21: Hoare triple {1146#false} assume !false; {1146#false} is VALID [2020-07-08 12:20:53,570 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-08 12:20:53,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030822126] [2020-07-08 12:20:53,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:53,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:53,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873897751] [2020-07-08 12:20:53,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:20:53,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:53,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:53,596 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-08 12:20:53,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:53,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:53,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:53,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:53,597 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2020-07-08 12:20:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:53,732 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2020-07-08 12:20:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:53,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:20:53,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-08 12:20:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-08 12:20:53,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-08 12:20:53,879 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-08 12:20:53,883 INFO L225 Difference]: With dead ends: 148 [2020-07-08 12:20:53,883 INFO L226 Difference]: Without dead ends: 146 [2020-07-08 12:20:53,884 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-08 12:20:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-07-08 12:20:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2020-07-08 12:20:53,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:53,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 104 states. [2020-07-08 12:20:53,897 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 104 states. [2020-07-08 12:20:53,897 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 104 states. [2020-07-08 12:20:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:53,904 INFO L93 Difference]: Finished difference Result 146 states and 261 transitions. [2020-07-08 12:20:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 261 transitions. [2020-07-08 12:20:53,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:53,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:53,905 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 146 states. [2020-07-08 12:20:53,905 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 146 states. [2020-07-08 12:20:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:53,911 INFO L93 Difference]: Finished difference Result 146 states and 261 transitions. [2020-07-08 12:20:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 261 transitions. [2020-07-08 12:20:53,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:53,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:53,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:53,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-08 12:20:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2020-07-08 12:20:53,917 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2020-07-08 12:20:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:53,917 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2020-07-08 12:20:53,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2020-07-08 12:20:53,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:20:53,918 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:53,918 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-08 12:20:53,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:20:53,919 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:53,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:53,919 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2020-07-08 12:20:53,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:53,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772017603] [2020-07-08 12:20:53,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:54,003 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-08 12:20:54,004 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1716#true} {1716#true} #214#return; {1716#true} is VALID [2020-07-08 12:20:54,004 INFO L263 TraceCheckUtils]: 0: Hoare triple {1716#true} call ULTIMATE.init(); {1716#true} is VALID [2020-07-08 12:20:54,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-08 12:20:54,004 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1716#true} {1716#true} #214#return; {1716#true} is VALID [2020-07-08 12:20:54,004 INFO L263 TraceCheckUtils]: 3: Hoare triple {1716#true} call #t~ret12 := main(); {1716#true} is VALID [2020-07-08 12:20:54,005 INFO L280 TraceCheckUtils]: 4: Hoare triple {1716#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {1716#true} is VALID [2020-07-08 12:20:54,005 INFO L280 TraceCheckUtils]: 5: Hoare triple {1716#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1716#true} is VALID [2020-07-08 12:20:54,005 INFO L280 TraceCheckUtils]: 6: Hoare triple {1716#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;~lk10~0 := 0;~lk11~0 := 0; {1716#true} is VALID [2020-07-08 12:20:54,005 INFO L280 TraceCheckUtils]: 7: Hoare triple {1716#true} assume !(0 != ~p1~0); {1716#true} is VALID [2020-07-08 12:20:54,006 INFO L280 TraceCheckUtils]: 8: Hoare triple {1716#true} assume !(0 != ~p2~0); {1720#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:54,006 INFO L280 TraceCheckUtils]: 9: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:54,007 INFO L280 TraceCheckUtils]: 10: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:54,007 INFO L280 TraceCheckUtils]: 11: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:54,008 INFO L280 TraceCheckUtils]: 12: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:54,008 INFO L280 TraceCheckUtils]: 13: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:54,009 INFO L280 TraceCheckUtils]: 14: Hoare triple {1720#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {1720#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:54,009 INFO L280 TraceCheckUtils]: 15: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:54,009 INFO L280 TraceCheckUtils]: 16: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p10~0;~lk10~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:54,010 INFO L280 TraceCheckUtils]: 17: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p11~0;~lk11~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:54,016 INFO L280 TraceCheckUtils]: 18: Hoare triple {1720#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1720#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:54,017 INFO L280 TraceCheckUtils]: 19: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1717#false} is VALID [2020-07-08 12:20:54,017 INFO L280 TraceCheckUtils]: 20: Hoare triple {1717#false} assume 1 != ~lk2~0; {1717#false} is VALID [2020-07-08 12:20:54,017 INFO L280 TraceCheckUtils]: 21: Hoare triple {1717#false} assume !false; {1717#false} is VALID [2020-07-08 12:20:54,018 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-08 12:20:54,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772017603] [2020-07-08 12:20:54,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:54,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:54,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463558951] [2020-07-08 12:20:54,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:20:54,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:54,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:54,046 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-08 12:20:54,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:54,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:54,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:54,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:54,048 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2020-07-08 12:20:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:54,179 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2020-07-08 12:20:54,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:54,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:20:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2020-07-08 12:20:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2020-07-08 12:20:54,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 206 transitions. [2020-07-08 12:20:54,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:54,399 INFO L225 Difference]: With dead ends: 244 [2020-07-08 12:20:54,399 INFO L226 Difference]: Without dead ends: 148 [2020-07-08 12:20:54,400 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-08 12:20:54,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-07-08 12:20:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2020-07-08 12:20:54,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:54,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 146 states. [2020-07-08 12:20:54,429 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 146 states. [2020-07-08 12:20:54,429 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 146 states. [2020-07-08 12:20:54,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:54,437 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2020-07-08 12:20:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 259 transitions. [2020-07-08 12:20:54,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:54,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:54,438 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 148 states. [2020-07-08 12:20:54,438 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 148 states. [2020-07-08 12:20:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:54,446 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2020-07-08 12:20:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 259 transitions. [2020-07-08 12:20:54,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:54,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:54,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:54,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-07-08 12:20:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2020-07-08 12:20:54,454 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2020-07-08 12:20:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:54,454 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2020-07-08 12:20:54,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2020-07-08 12:20:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:20:54,456 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:54,456 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-08 12:20:54,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:20:54,457 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:54,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:54,458 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2020-07-08 12:20:54,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:54,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264145671] [2020-07-08 12:20:54,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:54,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {2433#true} assume true; {2433#true} is VALID [2020-07-08 12:20:54,536 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2433#true} {2433#true} #214#return; {2433#true} is VALID [2020-07-08 12:20:54,536 INFO L263 TraceCheckUtils]: 0: Hoare triple {2433#true} call ULTIMATE.init(); {2433#true} is VALID [2020-07-08 12:20:54,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {2433#true} assume true; {2433#true} is VALID [2020-07-08 12:20:54,537 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2433#true} {2433#true} #214#return; {2433#true} is VALID [2020-07-08 12:20:54,537 INFO L263 TraceCheckUtils]: 3: Hoare triple {2433#true} call #t~ret12 := main(); {2433#true} is VALID [2020-07-08 12:20:54,537 INFO L280 TraceCheckUtils]: 4: Hoare triple {2433#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {2433#true} is VALID [2020-07-08 12:20:54,538 INFO L280 TraceCheckUtils]: 5: Hoare triple {2433#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {2433#true} is VALID [2020-07-08 12:20:54,538 INFO L280 TraceCheckUtils]: 6: Hoare triple {2433#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;~lk10~0 := 0;~lk11~0 := 0; {2433#true} is VALID [2020-07-08 12:20:54,538 INFO L280 TraceCheckUtils]: 7: Hoare triple {2433#true} assume !(0 != ~p1~0); {2433#true} is VALID [2020-07-08 12:20:54,540 INFO L280 TraceCheckUtils]: 8: Hoare triple {2433#true} assume 0 != ~p2~0;~lk2~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:54,540 INFO L280 TraceCheckUtils]: 9: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:54,541 INFO L280 TraceCheckUtils]: 10: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:54,541 INFO L280 TraceCheckUtils]: 11: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:54,542 INFO L280 TraceCheckUtils]: 12: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:54,542 INFO L280 TraceCheckUtils]: 13: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p7~0;~lk7~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:54,543 INFO L280 TraceCheckUtils]: 14: Hoare triple {2437#(not (= 0 main_~p2~0))} assume !(0 != ~p8~0); {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:54,544 INFO L280 TraceCheckUtils]: 15: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p9~0;~lk9~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:54,544 INFO L280 TraceCheckUtils]: 16: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p10~0;~lk10~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:54,545 INFO L280 TraceCheckUtils]: 17: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p11~0;~lk11~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:54,545 INFO L280 TraceCheckUtils]: 18: Hoare triple {2437#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:54,546 INFO L280 TraceCheckUtils]: 19: Hoare triple {2437#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {2434#false} is VALID [2020-07-08 12:20:54,546 INFO L280 TraceCheckUtils]: 20: Hoare triple {2434#false} assume 0 != ~p3~0; {2434#false} is VALID [2020-07-08 12:20:54,547 INFO L280 TraceCheckUtils]: 21: Hoare triple {2434#false} assume 1 != ~lk3~0; {2434#false} is VALID [2020-07-08 12:20:54,547 INFO L280 TraceCheckUtils]: 22: Hoare triple {2434#false} assume !false; {2434#false} is VALID [2020-07-08 12:20:54,548 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-08 12:20:54,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264145671] [2020-07-08 12:20:54,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:54,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:54,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077885171] [2020-07-08 12:20:54,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:20:54,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:54,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:54,583 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-08 12:20:54,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:54,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:54,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:54,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:54,584 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2020-07-08 12:20:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:54,733 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2020-07-08 12:20:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:54,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:20:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2020-07-08 12:20:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2020-07-08 12:20:54,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 201 transitions. [2020-07-08 12:20:54,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:54,933 INFO L225 Difference]: With dead ends: 219 [2020-07-08 12:20:54,933 INFO L226 Difference]: Without dead ends: 150 [2020-07-08 12:20:54,934 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-08 12:20:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-07-08 12:20:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2020-07-08 12:20:54,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:54,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 148 states. [2020-07-08 12:20:54,965 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 148 states. [2020-07-08 12:20:54,966 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 148 states. [2020-07-08 12:20:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:54,974 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2020-07-08 12:20:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 259 transitions. [2020-07-08 12:20:54,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:54,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:54,976 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 150 states. [2020-07-08 12:20:54,976 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 150 states. [2020-07-08 12:20:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:54,982 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2020-07-08 12:20:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 259 transitions. [2020-07-08 12:20:54,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:54,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:54,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:54,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-08 12:20:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2020-07-08 12:20:54,988 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2020-07-08 12:20:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:54,988 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2020-07-08 12:20:54,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2020-07-08 12:20:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:20:54,989 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:54,989 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-08 12:20:54,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:20:54,990 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2020-07-08 12:20:54,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:54,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891973200] [2020-07-08 12:20:54,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:55,028 INFO L280 TraceCheckUtils]: 0: Hoare triple {3131#true} assume true; {3131#true} is VALID [2020-07-08 12:20:55,028 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3131#true} {3131#true} #214#return; {3131#true} is VALID [2020-07-08 12:20:55,029 INFO L263 TraceCheckUtils]: 0: Hoare triple {3131#true} call ULTIMATE.init(); {3131#true} is VALID [2020-07-08 12:20:55,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {3131#true} assume true; {3131#true} is VALID [2020-07-08 12:20:55,029 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3131#true} {3131#true} #214#return; {3131#true} is VALID [2020-07-08 12:20:55,029 INFO L263 TraceCheckUtils]: 3: Hoare triple {3131#true} call #t~ret12 := main(); {3131#true} is VALID [2020-07-08 12:20:55,030 INFO L280 TraceCheckUtils]: 4: Hoare triple {3131#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {3131#true} is VALID [2020-07-08 12:20:55,030 INFO L280 TraceCheckUtils]: 5: Hoare triple {3131#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {3131#true} is VALID [2020-07-08 12:20:55,030 INFO L280 TraceCheckUtils]: 6: Hoare triple {3131#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;~lk10~0 := 0;~lk11~0 := 0; {3131#true} is VALID [2020-07-08 12:20:55,030 INFO L280 TraceCheckUtils]: 7: Hoare triple {3131#true} assume !(0 != ~p1~0); {3131#true} is VALID [2020-07-08 12:20:55,031 INFO L280 TraceCheckUtils]: 8: Hoare triple {3131#true} assume !(0 != ~p2~0); {3131#true} is VALID [2020-07-08 12:20:55,031 INFO L280 TraceCheckUtils]: 9: Hoare triple {3131#true} assume 0 != ~p3~0;~lk3~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:55,032 INFO L280 TraceCheckUtils]: 10: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:55,032 INFO L280 TraceCheckUtils]: 11: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:55,033 INFO L280 TraceCheckUtils]: 12: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:55,034 INFO L280 TraceCheckUtils]: 13: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:55,034 INFO L280 TraceCheckUtils]: 14: Hoare triple {3135#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {3135#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:55,035 INFO L280 TraceCheckUtils]: 15: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:55,035 INFO L280 TraceCheckUtils]: 16: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p10~0;~lk10~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:55,036 INFO L280 TraceCheckUtils]: 17: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p11~0;~lk11~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:55,036 INFO L280 TraceCheckUtils]: 18: Hoare triple {3135#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {3135#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:55,037 INFO L280 TraceCheckUtils]: 19: Hoare triple {3135#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {3135#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:55,038 INFO L280 TraceCheckUtils]: 20: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:55,038 INFO L280 TraceCheckUtils]: 21: Hoare triple {3135#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {3132#false} is VALID [2020-07-08 12:20:55,038 INFO L280 TraceCheckUtils]: 22: Hoare triple {3132#false} assume !false; {3132#false} is VALID [2020-07-08 12:20:55,039 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-08 12:20:55,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891973200] [2020-07-08 12:20:55,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:55,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:55,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620678394] [2020-07-08 12:20:55,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:20:55,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:55,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:55,063 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-08 12:20:55,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:55,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:55,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:55,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:55,064 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2020-07-08 12:20:55,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:55,217 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2020-07-08 12:20:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:55,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:20:55,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-08 12:20:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-08 12:20:55,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2020-07-08 12:20:55,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:55,369 INFO L225 Difference]: With dead ends: 276 [2020-07-08 12:20:55,370 INFO L226 Difference]: Without dead ends: 274 [2020-07-08 12:20:55,370 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-08 12:20:55,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-07-08 12:20:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2020-07-08 12:20:55,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:55,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand 200 states. [2020-07-08 12:20:55,395 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand 200 states. [2020-07-08 12:20:55,395 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 200 states. [2020-07-08 12:20:55,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:55,406 INFO L93 Difference]: Finished difference Result 274 states and 483 transitions. [2020-07-08 12:20:55,406 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 483 transitions. [2020-07-08 12:20:55,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:55,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:55,407 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 274 states. [2020-07-08 12:20:55,407 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 274 states. [2020-07-08 12:20:55,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:55,417 INFO L93 Difference]: Finished difference Result 274 states and 483 transitions. [2020-07-08 12:20:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 483 transitions. [2020-07-08 12:20:55,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:55,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:55,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:55,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:55,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-07-08 12:20:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2020-07-08 12:20:55,425 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2020-07-08 12:20:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:55,426 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2020-07-08 12:20:55,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2020-07-08 12:20:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:20:55,427 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:55,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] [2020-07-08 12:20:55,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 12:20:55,427 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:55,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:55,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2020-07-08 12:20:55,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:55,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060843192] [2020-07-08 12:20:55,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:55,464 INFO L280 TraceCheckUtils]: 0: Hoare triple {4188#true} assume true; {4188#true} is VALID [2020-07-08 12:20:55,464 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4188#true} {4188#true} #214#return; {4188#true} is VALID [2020-07-08 12:20:55,465 INFO L263 TraceCheckUtils]: 0: Hoare triple {4188#true} call ULTIMATE.init(); {4188#true} is VALID [2020-07-08 12:20:55,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {4188#true} assume true; {4188#true} is VALID [2020-07-08 12:20:55,465 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4188#true} {4188#true} #214#return; {4188#true} is VALID [2020-07-08 12:20:55,465 INFO L263 TraceCheckUtils]: 3: Hoare triple {4188#true} call #t~ret12 := main(); {4188#true} is VALID [2020-07-08 12:20:55,466 INFO L280 TraceCheckUtils]: 4: Hoare triple {4188#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {4188#true} is VALID [2020-07-08 12:20:55,466 INFO L280 TraceCheckUtils]: 5: Hoare triple {4188#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {4188#true} is VALID [2020-07-08 12:20:55,466 INFO L280 TraceCheckUtils]: 6: Hoare triple {4188#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;~lk10~0 := 0;~lk11~0 := 0; {4188#true} is VALID [2020-07-08 12:20:55,466 INFO L280 TraceCheckUtils]: 7: Hoare triple {4188#true} assume !(0 != ~p1~0); {4188#true} is VALID [2020-07-08 12:20:55,467 INFO L280 TraceCheckUtils]: 8: Hoare triple {4188#true} assume !(0 != ~p2~0); {4188#true} is VALID [2020-07-08 12:20:55,467 INFO L280 TraceCheckUtils]: 9: Hoare triple {4188#true} assume !(0 != ~p3~0); {4192#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:55,468 INFO L280 TraceCheckUtils]: 10: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:55,468 INFO L280 TraceCheckUtils]: 11: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:55,469 INFO L280 TraceCheckUtils]: 12: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:55,470 INFO L280 TraceCheckUtils]: 13: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:55,470 INFO L280 TraceCheckUtils]: 14: Hoare triple {4192#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {4192#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:55,471 INFO L280 TraceCheckUtils]: 15: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:55,471 INFO L280 TraceCheckUtils]: 16: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p10~0;~lk10~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:55,472 INFO L280 TraceCheckUtils]: 17: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p11~0;~lk11~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:55,472 INFO L280 TraceCheckUtils]: 18: Hoare triple {4192#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {4192#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:55,473 INFO L280 TraceCheckUtils]: 19: Hoare triple {4192#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {4192#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:55,473 INFO L280 TraceCheckUtils]: 20: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p3~0; {4189#false} is VALID [2020-07-08 12:20:55,474 INFO L280 TraceCheckUtils]: 21: Hoare triple {4189#false} assume 1 != ~lk3~0; {4189#false} is VALID [2020-07-08 12:20:55,474 INFO L280 TraceCheckUtils]: 22: Hoare triple {4189#false} assume !false; {4189#false} is VALID [2020-07-08 12:20:55,475 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-08 12:20:55,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060843192] [2020-07-08 12:20:55,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:55,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:55,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591504704] [2020-07-08 12:20:55,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:20:55,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:55,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:55,499 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-08 12:20:55,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:55,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:55,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:55,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:55,500 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2020-07-08 12:20:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:55,653 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2020-07-08 12:20:55,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:55,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:20:55,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:55,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2020-07-08 12:20:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2020-07-08 12:20:55,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 203 transitions. [2020-07-08 12:20:55,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:55,878 INFO L225 Difference]: With dead ends: 472 [2020-07-08 12:20:55,878 INFO L226 Difference]: Without dead ends: 282 [2020-07-08 12:20:55,879 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-08 12:20:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-07-08 12:20:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2020-07-08 12:20:55,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:55,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 280 states. [2020-07-08 12:20:55,909 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 280 states. [2020-07-08 12:20:55,909 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 280 states. [2020-07-08 12:20:55,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:55,917 INFO L93 Difference]: Finished difference Result 282 states and 483 transitions. [2020-07-08 12:20:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 483 transitions. [2020-07-08 12:20:55,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:55,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:55,919 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand 282 states. [2020-07-08 12:20:55,919 INFO L87 Difference]: Start difference. First operand 280 states. Second operand 282 states. [2020-07-08 12:20:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:55,927 INFO L93 Difference]: Finished difference Result 282 states and 483 transitions. [2020-07-08 12:20:55,927 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 483 transitions. [2020-07-08 12:20:55,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:55,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:55,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:55,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-07-08 12:20:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2020-07-08 12:20:55,936 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2020-07-08 12:20:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:55,936 INFO L479 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2020-07-08 12:20:55,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2020-07-08 12:20:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:20:55,938 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:55,938 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-08 12:20:55,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 12:20:55,938 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:55,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:55,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2020-07-08 12:20:55,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:55,939 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968325858] [2020-07-08 12:20:55,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:55,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {5545#true} assume true; {5545#true} is VALID [2020-07-08 12:20:55,969 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5545#true} {5545#true} #214#return; {5545#true} is VALID [2020-07-08 12:20:55,970 INFO L263 TraceCheckUtils]: 0: Hoare triple {5545#true} call ULTIMATE.init(); {5545#true} is VALID [2020-07-08 12:20:55,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {5545#true} assume true; {5545#true} is VALID [2020-07-08 12:20:55,970 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5545#true} {5545#true} #214#return; {5545#true} is VALID [2020-07-08 12:20:55,971 INFO L263 TraceCheckUtils]: 3: Hoare triple {5545#true} call #t~ret12 := main(); {5545#true} is VALID [2020-07-08 12:20:55,971 INFO L280 TraceCheckUtils]: 4: Hoare triple {5545#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {5545#true} is VALID [2020-07-08 12:20:55,971 INFO L280 TraceCheckUtils]: 5: Hoare triple {5545#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {5545#true} is VALID [2020-07-08 12:20:55,971 INFO L280 TraceCheckUtils]: 6: Hoare triple {5545#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;~lk10~0 := 0;~lk11~0 := 0; {5545#true} is VALID [2020-07-08 12:20:55,971 INFO L280 TraceCheckUtils]: 7: Hoare triple {5545#true} assume !(0 != ~p1~0); {5545#true} is VALID [2020-07-08 12:20:55,972 INFO L280 TraceCheckUtils]: 8: Hoare triple {5545#true} assume !(0 != ~p2~0); {5545#true} is VALID [2020-07-08 12:20:55,973 INFO L280 TraceCheckUtils]: 9: Hoare triple {5545#true} assume 0 != ~p3~0;~lk3~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:55,973 INFO L280 TraceCheckUtils]: 10: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:55,974 INFO L280 TraceCheckUtils]: 11: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:55,974 INFO L280 TraceCheckUtils]: 12: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p6~0;~lk6~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:55,975 INFO L280 TraceCheckUtils]: 13: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p7~0;~lk7~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:55,975 INFO L280 TraceCheckUtils]: 14: Hoare triple {5549#(not (= 0 main_~p3~0))} assume !(0 != ~p8~0); {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:55,976 INFO L280 TraceCheckUtils]: 15: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p9~0;~lk9~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:55,976 INFO L280 TraceCheckUtils]: 16: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p10~0;~lk10~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:55,977 INFO L280 TraceCheckUtils]: 17: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p11~0;~lk11~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:55,978 INFO L280 TraceCheckUtils]: 18: Hoare triple {5549#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:55,978 INFO L280 TraceCheckUtils]: 19: Hoare triple {5549#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:55,979 INFO L280 TraceCheckUtils]: 20: Hoare triple {5549#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {5546#false} is VALID [2020-07-08 12:20:55,979 INFO L280 TraceCheckUtils]: 21: Hoare triple {5546#false} assume 0 != ~p4~0; {5546#false} is VALID [2020-07-08 12:20:55,979 INFO L280 TraceCheckUtils]: 22: Hoare triple {5546#false} assume 1 != ~lk4~0; {5546#false} is VALID [2020-07-08 12:20:55,979 INFO L280 TraceCheckUtils]: 23: Hoare triple {5546#false} assume !false; {5546#false} is VALID [2020-07-08 12:20:55,980 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-08 12:20:55,981 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968325858] [2020-07-08 12:20:55,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:55,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:55,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136116064] [2020-07-08 12:20:55,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:20:55,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:55,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:56,005 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-08 12:20:56,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:56,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:56,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:56,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:56,007 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2020-07-08 12:20:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:56,166 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2020-07-08 12:20:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:56,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:20:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-08 12:20:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-08 12:20:56,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2020-07-08 12:20:56,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:56,346 INFO L225 Difference]: With dead ends: 420 [2020-07-08 12:20:56,346 INFO L226 Difference]: Without dead ends: 286 [2020-07-08 12:20:56,347 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-08 12:20:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-07-08 12:20:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2020-07-08 12:20:56,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:56,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand 284 states. [2020-07-08 12:20:56,384 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand 284 states. [2020-07-08 12:20:56,384 INFO L87 Difference]: Start difference. First operand 286 states. Second operand 284 states. [2020-07-08 12:20:56,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:56,392 INFO L93 Difference]: Finished difference Result 286 states and 483 transitions. [2020-07-08 12:20:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 483 transitions. [2020-07-08 12:20:56,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:56,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:56,394 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand 286 states. [2020-07-08 12:20:56,394 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 286 states. [2020-07-08 12:20:56,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:56,404 INFO L93 Difference]: Finished difference Result 286 states and 483 transitions. [2020-07-08 12:20:56,404 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 483 transitions. [2020-07-08 12:20:56,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:56,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:56,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:56,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2020-07-08 12:20:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2020-07-08 12:20:56,413 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2020-07-08 12:20:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:56,414 INFO L479 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2020-07-08 12:20:56,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2020-07-08 12:20:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:20:56,415 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:56,415 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-08 12:20:56,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 12:20:56,415 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:56,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:56,416 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2020-07-08 12:20:56,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:56,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733803348] [2020-07-08 12:20:56,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:56,463 INFO L280 TraceCheckUtils]: 0: Hoare triple {6862#true} assume true; {6862#true} is VALID [2020-07-08 12:20:56,463 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6862#true} {6862#true} #214#return; {6862#true} is VALID [2020-07-08 12:20:56,464 INFO L263 TraceCheckUtils]: 0: Hoare triple {6862#true} call ULTIMATE.init(); {6862#true} is VALID [2020-07-08 12:20:56,464 INFO L280 TraceCheckUtils]: 1: Hoare triple {6862#true} assume true; {6862#true} is VALID [2020-07-08 12:20:56,464 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6862#true} {6862#true} #214#return; {6862#true} is VALID [2020-07-08 12:20:56,465 INFO L263 TraceCheckUtils]: 3: Hoare triple {6862#true} call #t~ret12 := main(); {6862#true} is VALID [2020-07-08 12:20:56,465 INFO L280 TraceCheckUtils]: 4: Hoare triple {6862#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {6862#true} is VALID [2020-07-08 12:20:56,465 INFO L280 TraceCheckUtils]: 5: Hoare triple {6862#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {6862#true} is VALID [2020-07-08 12:20:56,465 INFO L280 TraceCheckUtils]: 6: Hoare triple {6862#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;~lk10~0 := 0;~lk11~0 := 0; {6862#true} is VALID [2020-07-08 12:20:56,466 INFO L280 TraceCheckUtils]: 7: Hoare triple {6862#true} assume !(0 != ~p1~0); {6862#true} is VALID [2020-07-08 12:20:56,466 INFO L280 TraceCheckUtils]: 8: Hoare triple {6862#true} assume !(0 != ~p2~0); {6862#true} is VALID [2020-07-08 12:20:56,466 INFO L280 TraceCheckUtils]: 9: Hoare triple {6862#true} assume !(0 != ~p3~0); {6862#true} is VALID [2020-07-08 12:20:56,468 INFO L280 TraceCheckUtils]: 10: Hoare triple {6862#true} assume 0 != ~p4~0;~lk4~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:56,468 INFO L280 TraceCheckUtils]: 11: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:56,469 INFO L280 TraceCheckUtils]: 12: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:56,469 INFO L280 TraceCheckUtils]: 13: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:56,470 INFO L280 TraceCheckUtils]: 14: Hoare triple {6866#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {6866#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:56,470 INFO L280 TraceCheckUtils]: 15: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:56,471 INFO L280 TraceCheckUtils]: 16: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p10~0;~lk10~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:56,471 INFO L280 TraceCheckUtils]: 17: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p11~0;~lk11~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:56,472 INFO L280 TraceCheckUtils]: 18: Hoare triple {6866#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {6866#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:56,473 INFO L280 TraceCheckUtils]: 19: Hoare triple {6866#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {6866#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:56,473 INFO L280 TraceCheckUtils]: 20: Hoare triple {6866#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {6866#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:56,474 INFO L280 TraceCheckUtils]: 21: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:56,474 INFO L280 TraceCheckUtils]: 22: Hoare triple {6866#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {6863#false} is VALID [2020-07-08 12:20:56,474 INFO L280 TraceCheckUtils]: 23: Hoare triple {6863#false} assume !false; {6863#false} is VALID [2020-07-08 12:20:56,475 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-08 12:20:56,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733803348] [2020-07-08 12:20:56,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:56,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:56,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304802143] [2020-07-08 12:20:56,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:20:56,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:56,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:56,504 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-08 12:20:56,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:56,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:56,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:56,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:56,505 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2020-07-08 12:20:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:56,663 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2020-07-08 12:20:56,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:56,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:20:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-08 12:20:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-08 12:20:56,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2020-07-08 12:20:56,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:56,808 INFO L225 Difference]: With dead ends: 524 [2020-07-08 12:20:56,808 INFO L226 Difference]: Without dead ends: 522 [2020-07-08 12:20:56,809 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-08 12:20:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-07-08 12:20:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2020-07-08 12:20:56,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:56,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand 392 states. [2020-07-08 12:20:56,842 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand 392 states. [2020-07-08 12:20:56,842 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 392 states. [2020-07-08 12:20:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:56,860 INFO L93 Difference]: Finished difference Result 522 states and 895 transitions. [2020-07-08 12:20:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 895 transitions. [2020-07-08 12:20:56,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:56,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:56,862 INFO L74 IsIncluded]: Start isIncluded. First operand 392 states. Second operand 522 states. [2020-07-08 12:20:56,862 INFO L87 Difference]: Start difference. First operand 392 states. Second operand 522 states. [2020-07-08 12:20:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:56,881 INFO L93 Difference]: Finished difference Result 522 states and 895 transitions. [2020-07-08 12:20:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 895 transitions. [2020-07-08 12:20:56,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:56,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:56,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:56,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-07-08 12:20:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2020-07-08 12:20:56,896 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2020-07-08 12:20:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:56,896 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2020-07-08 12:20:56,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2020-07-08 12:20:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:20:56,897 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:56,897 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-08 12:20:56,898 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 12:20:56,898 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:56,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:56,898 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2020-07-08 12:20:56,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:56,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681286254] [2020-07-08 12:20:56,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:56,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {8867#true} assume true; {8867#true} is VALID [2020-07-08 12:20:56,930 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8867#true} {8867#true} #214#return; {8867#true} is VALID [2020-07-08 12:20:56,930 INFO L263 TraceCheckUtils]: 0: Hoare triple {8867#true} call ULTIMATE.init(); {8867#true} is VALID [2020-07-08 12:20:56,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {8867#true} assume true; {8867#true} is VALID [2020-07-08 12:20:56,930 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8867#true} {8867#true} #214#return; {8867#true} is VALID [2020-07-08 12:20:56,930 INFO L263 TraceCheckUtils]: 3: Hoare triple {8867#true} call #t~ret12 := main(); {8867#true} is VALID [2020-07-08 12:20:56,931 INFO L280 TraceCheckUtils]: 4: Hoare triple {8867#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {8867#true} is VALID [2020-07-08 12:20:56,931 INFO L280 TraceCheckUtils]: 5: Hoare triple {8867#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {8867#true} is VALID [2020-07-08 12:20:56,931 INFO L280 TraceCheckUtils]: 6: Hoare triple {8867#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;~lk10~0 := 0;~lk11~0 := 0; {8867#true} is VALID [2020-07-08 12:20:56,931 INFO L280 TraceCheckUtils]: 7: Hoare triple {8867#true} assume !(0 != ~p1~0); {8867#true} is VALID [2020-07-08 12:20:56,932 INFO L280 TraceCheckUtils]: 8: Hoare triple {8867#true} assume !(0 != ~p2~0); {8867#true} is VALID [2020-07-08 12:20:56,932 INFO L280 TraceCheckUtils]: 9: Hoare triple {8867#true} assume !(0 != ~p3~0); {8867#true} is VALID [2020-07-08 12:20:56,933 INFO L280 TraceCheckUtils]: 10: Hoare triple {8867#true} assume !(0 != ~p4~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:56,935 INFO L280 TraceCheckUtils]: 11: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:56,939 INFO L280 TraceCheckUtils]: 12: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:56,940 INFO L280 TraceCheckUtils]: 13: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:56,946 INFO L280 TraceCheckUtils]: 14: Hoare triple {8871#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:56,946 INFO L280 TraceCheckUtils]: 15: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:56,949 INFO L280 TraceCheckUtils]: 16: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p10~0;~lk10~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:56,950 INFO L280 TraceCheckUtils]: 17: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p11~0;~lk11~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:56,951 INFO L280 TraceCheckUtils]: 18: Hoare triple {8871#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:56,951 INFO L280 TraceCheckUtils]: 19: Hoare triple {8871#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:56,951 INFO L280 TraceCheckUtils]: 20: Hoare triple {8871#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:56,952 INFO L280 TraceCheckUtils]: 21: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p4~0; {8868#false} is VALID [2020-07-08 12:20:56,952 INFO L280 TraceCheckUtils]: 22: Hoare triple {8868#false} assume 1 != ~lk4~0; {8868#false} is VALID [2020-07-08 12:20:56,953 INFO L280 TraceCheckUtils]: 23: Hoare triple {8868#false} assume !false; {8868#false} is VALID [2020-07-08 12:20:56,953 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-08 12:20:56,954 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681286254] [2020-07-08 12:20:56,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:56,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:56,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981173171] [2020-07-08 12:20:56,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:20:56,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:56,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:56,978 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-08 12:20:56,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:56,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:56,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:56,979 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2020-07-08 12:20:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:57,184 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2020-07-08 12:20:57,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:57,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:20:57,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2020-07-08 12:20:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2020-07-08 12:20:57,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 200 transitions. [2020-07-08 12:20:57,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:57,395 INFO L225 Difference]: With dead ends: 924 [2020-07-08 12:20:57,395 INFO L226 Difference]: Without dead ends: 546 [2020-07-08 12:20:57,397 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-08 12:20:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-07-08 12:20:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2020-07-08 12:20:57,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:57,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 546 states. Second operand 544 states. [2020-07-08 12:20:57,464 INFO L74 IsIncluded]: Start isIncluded. First operand 546 states. Second operand 544 states. [2020-07-08 12:20:57,464 INFO L87 Difference]: Start difference. First operand 546 states. Second operand 544 states. [2020-07-08 12:20:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:57,486 INFO L93 Difference]: Finished difference Result 546 states and 903 transitions. [2020-07-08 12:20:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 903 transitions. [2020-07-08 12:20:57,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:57,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:57,488 INFO L74 IsIncluded]: Start isIncluded. First operand 544 states. Second operand 546 states. [2020-07-08 12:20:57,488 INFO L87 Difference]: Start difference. First operand 544 states. Second operand 546 states. [2020-07-08 12:20:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:57,511 INFO L93 Difference]: Finished difference Result 546 states and 903 transitions. [2020-07-08 12:20:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 903 transitions. [2020-07-08 12:20:57,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:57,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:57,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:57,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-07-08 12:20:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2020-07-08 12:20:57,533 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2020-07-08 12:20:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:57,534 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2020-07-08 12:20:57,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2020-07-08 12:20:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:20:57,537 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:57,538 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-08 12:20:57,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 12:20:57,538 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:57,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:57,539 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2020-07-08 12:20:57,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:57,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824520785] [2020-07-08 12:20:57,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:57,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {11488#true} assume true; {11488#true} is VALID [2020-07-08 12:20:57,577 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {11488#true} {11488#true} #214#return; {11488#true} is VALID [2020-07-08 12:20:57,577 INFO L263 TraceCheckUtils]: 0: Hoare triple {11488#true} call ULTIMATE.init(); {11488#true} is VALID [2020-07-08 12:20:57,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {11488#true} assume true; {11488#true} is VALID [2020-07-08 12:20:57,578 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11488#true} {11488#true} #214#return; {11488#true} is VALID [2020-07-08 12:20:57,578 INFO L263 TraceCheckUtils]: 3: Hoare triple {11488#true} call #t~ret12 := main(); {11488#true} is VALID [2020-07-08 12:20:57,578 INFO L280 TraceCheckUtils]: 4: Hoare triple {11488#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {11488#true} is VALID [2020-07-08 12:20:57,578 INFO L280 TraceCheckUtils]: 5: Hoare triple {11488#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {11488#true} is VALID [2020-07-08 12:20:57,578 INFO L280 TraceCheckUtils]: 6: Hoare triple {11488#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;~lk10~0 := 0;~lk11~0 := 0; {11488#true} is VALID [2020-07-08 12:20:57,579 INFO L280 TraceCheckUtils]: 7: Hoare triple {11488#true} assume !(0 != ~p1~0); {11488#true} is VALID [2020-07-08 12:20:57,579 INFO L280 TraceCheckUtils]: 8: Hoare triple {11488#true} assume !(0 != ~p2~0); {11488#true} is VALID [2020-07-08 12:20:57,579 INFO L280 TraceCheckUtils]: 9: Hoare triple {11488#true} assume !(0 != ~p3~0); {11488#true} is VALID [2020-07-08 12:20:57,580 INFO L280 TraceCheckUtils]: 10: Hoare triple {11488#true} assume 0 != ~p4~0;~lk4~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:57,580 INFO L280 TraceCheckUtils]: 11: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:57,581 INFO L280 TraceCheckUtils]: 12: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p6~0;~lk6~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:57,581 INFO L280 TraceCheckUtils]: 13: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p7~0;~lk7~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:57,582 INFO L280 TraceCheckUtils]: 14: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p8~0); {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:57,582 INFO L280 TraceCheckUtils]: 15: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p9~0;~lk9~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:57,583 INFO L280 TraceCheckUtils]: 16: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p10~0;~lk10~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:57,583 INFO L280 TraceCheckUtils]: 17: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p11~0;~lk11~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:57,584 INFO L280 TraceCheckUtils]: 18: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:57,584 INFO L280 TraceCheckUtils]: 19: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:57,585 INFO L280 TraceCheckUtils]: 20: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:57,585 INFO L280 TraceCheckUtils]: 21: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {11489#false} is VALID [2020-07-08 12:20:57,586 INFO L280 TraceCheckUtils]: 22: Hoare triple {11489#false} assume 0 != ~p5~0; {11489#false} is VALID [2020-07-08 12:20:57,586 INFO L280 TraceCheckUtils]: 23: Hoare triple {11489#false} assume 1 != ~lk5~0; {11489#false} is VALID [2020-07-08 12:20:57,586 INFO L280 TraceCheckUtils]: 24: Hoare triple {11489#false} assume !false; {11489#false} is VALID [2020-07-08 12:20:57,587 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-08 12:20:57,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824520785] [2020-07-08 12:20:57,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:57,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:57,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515622955] [2020-07-08 12:20:57,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:20:57,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:57,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:57,613 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-08 12:20:57,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:57,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:57,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:57,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:57,614 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2020-07-08 12:20:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:57,832 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2020-07-08 12:20:57,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:57,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:20:57,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2020-07-08 12:20:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2020-07-08 12:20:57,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 195 transitions. [2020-07-08 12:20:58,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:58,063 INFO L225 Difference]: With dead ends: 816 [2020-07-08 12:20:58,063 INFO L226 Difference]: Without dead ends: 554 [2020-07-08 12:20:58,064 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-08 12:20:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-07-08 12:20:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2020-07-08 12:20:58,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:58,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 554 states. Second operand 552 states. [2020-07-08 12:20:58,129 INFO L74 IsIncluded]: Start isIncluded. First operand 554 states. Second operand 552 states. [2020-07-08 12:20:58,130 INFO L87 Difference]: Start difference. First operand 554 states. Second operand 552 states. [2020-07-08 12:20:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:58,149 INFO L93 Difference]: Finished difference Result 554 states and 903 transitions. [2020-07-08 12:20:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 903 transitions. [2020-07-08 12:20:58,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:58,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:58,151 INFO L74 IsIncluded]: Start isIncluded. First operand 552 states. Second operand 554 states. [2020-07-08 12:20:58,151 INFO L87 Difference]: Start difference. First operand 552 states. Second operand 554 states. [2020-07-08 12:20:58,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:58,172 INFO L93 Difference]: Finished difference Result 554 states and 903 transitions. [2020-07-08 12:20:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 903 transitions. [2020-07-08 12:20:58,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:58,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:58,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:58,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-07-08 12:20:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2020-07-08 12:20:58,194 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2020-07-08 12:20:58,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:58,194 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2020-07-08 12:20:58,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:58,195 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2020-07-08 12:20:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:20:58,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:58,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:20:58,196 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-08 12:20:58,196 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:58,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2020-07-08 12:20:58,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:58,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174724840] [2020-07-08 12:20:58,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:58,225 INFO L280 TraceCheckUtils]: 0: Hoare triple {14025#true} assume true; {14025#true} is VALID [2020-07-08 12:20:58,226 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14025#true} {14025#true} #214#return; {14025#true} is VALID [2020-07-08 12:20:58,226 INFO L263 TraceCheckUtils]: 0: Hoare triple {14025#true} call ULTIMATE.init(); {14025#true} is VALID [2020-07-08 12:20:58,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {14025#true} assume true; {14025#true} is VALID [2020-07-08 12:20:58,226 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14025#true} {14025#true} #214#return; {14025#true} is VALID [2020-07-08 12:20:58,227 INFO L263 TraceCheckUtils]: 3: Hoare triple {14025#true} call #t~ret12 := main(); {14025#true} is VALID [2020-07-08 12:20:58,227 INFO L280 TraceCheckUtils]: 4: Hoare triple {14025#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {14025#true} is VALID [2020-07-08 12:20:58,227 INFO L280 TraceCheckUtils]: 5: Hoare triple {14025#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {14025#true} is VALID [2020-07-08 12:20:58,227 INFO L280 TraceCheckUtils]: 6: Hoare triple {14025#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;~lk10~0 := 0;~lk11~0 := 0; {14025#true} is VALID [2020-07-08 12:20:58,227 INFO L280 TraceCheckUtils]: 7: Hoare triple {14025#true} assume !(0 != ~p1~0); {14025#true} is VALID [2020-07-08 12:20:58,228 INFO L280 TraceCheckUtils]: 8: Hoare triple {14025#true} assume !(0 != ~p2~0); {14025#true} is VALID [2020-07-08 12:20:58,228 INFO L280 TraceCheckUtils]: 9: Hoare triple {14025#true} assume !(0 != ~p3~0); {14025#true} is VALID [2020-07-08 12:20:58,228 INFO L280 TraceCheckUtils]: 10: Hoare triple {14025#true} assume !(0 != ~p4~0); {14025#true} is VALID [2020-07-08 12:20:58,229 INFO L280 TraceCheckUtils]: 11: Hoare triple {14025#true} assume 0 != ~p5~0;~lk5~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:58,229 INFO L280 TraceCheckUtils]: 12: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:58,230 INFO L280 TraceCheckUtils]: 13: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:58,230 INFO L280 TraceCheckUtils]: 14: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:58,231 INFO L280 TraceCheckUtils]: 15: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:58,231 INFO L280 TraceCheckUtils]: 16: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p10~0;~lk10~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:58,232 INFO L280 TraceCheckUtils]: 17: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p11~0;~lk11~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:58,232 INFO L280 TraceCheckUtils]: 18: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:58,233 INFO L280 TraceCheckUtils]: 19: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:58,233 INFO L280 TraceCheckUtils]: 20: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:58,234 INFO L280 TraceCheckUtils]: 21: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:58,234 INFO L280 TraceCheckUtils]: 22: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:58,235 INFO L280 TraceCheckUtils]: 23: Hoare triple {14029#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {14026#false} is VALID [2020-07-08 12:20:58,235 INFO L280 TraceCheckUtils]: 24: Hoare triple {14026#false} assume !false; {14026#false} is VALID [2020-07-08 12:20:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:20:58,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174724840] [2020-07-08 12:20:58,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:58,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:58,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948512906] [2020-07-08 12:20:58,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:20:58,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:58,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:58,262 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-08 12:20:58,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:58,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:58,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:58,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:58,263 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2020-07-08 12:20:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:58,533 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2020-07-08 12:20:58,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:58,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:20:58,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-08 12:20:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-08 12:20:58,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-08 12:20:58,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:58,697 INFO L225 Difference]: With dead ends: 1004 [2020-07-08 12:20:58,697 INFO L226 Difference]: Without dead ends: 1002 [2020-07-08 12:20:58,698 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-08 12:20:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2020-07-08 12:20:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2020-07-08 12:20:58,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:58,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1002 states. Second operand 776 states. [2020-07-08 12:20:58,773 INFO L74 IsIncluded]: Start isIncluded. First operand 1002 states. Second operand 776 states. [2020-07-08 12:20:58,773 INFO L87 Difference]: Start difference. First operand 1002 states. Second operand 776 states. [2020-07-08 12:20:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:58,830 INFO L93 Difference]: Finished difference Result 1002 states and 1655 transitions. [2020-07-08 12:20:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1655 transitions. [2020-07-08 12:20:58,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:58,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:58,833 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand 1002 states. [2020-07-08 12:20:58,833 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 1002 states. [2020-07-08 12:20:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:58,887 INFO L93 Difference]: Finished difference Result 1002 states and 1655 transitions. [2020-07-08 12:20:58,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1655 transitions. [2020-07-08 12:20:58,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:58,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:58,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:58,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-07-08 12:20:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2020-07-08 12:20:58,925 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2020-07-08 12:20:58,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:58,925 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2020-07-08 12:20:58,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2020-07-08 12:20:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:20:58,927 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:58,927 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-08 12:20:58,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-08 12:20:58,927 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:58,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:58,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2020-07-08 12:20:58,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:58,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905706190] [2020-07-08 12:20:58,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:58,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {17878#true} assume true; {17878#true} is VALID [2020-07-08 12:20:58,959 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17878#true} {17878#true} #214#return; {17878#true} is VALID [2020-07-08 12:20:58,959 INFO L263 TraceCheckUtils]: 0: Hoare triple {17878#true} call ULTIMATE.init(); {17878#true} is VALID [2020-07-08 12:20:58,959 INFO L280 TraceCheckUtils]: 1: Hoare triple {17878#true} assume true; {17878#true} is VALID [2020-07-08 12:20:58,959 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17878#true} {17878#true} #214#return; {17878#true} is VALID [2020-07-08 12:20:58,960 INFO L263 TraceCheckUtils]: 3: Hoare triple {17878#true} call #t~ret12 := main(); {17878#true} is VALID [2020-07-08 12:20:58,960 INFO L280 TraceCheckUtils]: 4: Hoare triple {17878#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {17878#true} is VALID [2020-07-08 12:20:58,960 INFO L280 TraceCheckUtils]: 5: Hoare triple {17878#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {17878#true} is VALID [2020-07-08 12:20:58,960 INFO L280 TraceCheckUtils]: 6: Hoare triple {17878#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;~lk10~0 := 0;~lk11~0 := 0; {17878#true} is VALID [2020-07-08 12:20:58,960 INFO L280 TraceCheckUtils]: 7: Hoare triple {17878#true} assume !(0 != ~p1~0); {17878#true} is VALID [2020-07-08 12:20:58,960 INFO L280 TraceCheckUtils]: 8: Hoare triple {17878#true} assume !(0 != ~p2~0); {17878#true} is VALID [2020-07-08 12:20:58,961 INFO L280 TraceCheckUtils]: 9: Hoare triple {17878#true} assume !(0 != ~p3~0); {17878#true} is VALID [2020-07-08 12:20:58,961 INFO L280 TraceCheckUtils]: 10: Hoare triple {17878#true} assume !(0 != ~p4~0); {17878#true} is VALID [2020-07-08 12:20:58,962 INFO L280 TraceCheckUtils]: 11: Hoare triple {17878#true} assume !(0 != ~p5~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,962 INFO L280 TraceCheckUtils]: 12: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,963 INFO L280 TraceCheckUtils]: 13: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,963 INFO L280 TraceCheckUtils]: 14: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,964 INFO L280 TraceCheckUtils]: 15: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,964 INFO L280 TraceCheckUtils]: 16: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p10~0;~lk10~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,965 INFO L280 TraceCheckUtils]: 17: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p11~0;~lk11~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,965 INFO L280 TraceCheckUtils]: 18: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,967 INFO L280 TraceCheckUtils]: 19: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,969 INFO L280 TraceCheckUtils]: 20: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,971 INFO L280 TraceCheckUtils]: 21: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,973 INFO L280 TraceCheckUtils]: 22: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p5~0; {17879#false} is VALID [2020-07-08 12:20:58,973 INFO L280 TraceCheckUtils]: 23: Hoare triple {17879#false} assume 1 != ~lk5~0; {17879#false} is VALID [2020-07-08 12:20:58,974 INFO L280 TraceCheckUtils]: 24: Hoare triple {17879#false} assume !false; {17879#false} is VALID [2020-07-08 12:20:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:20:58,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905706190] [2020-07-08 12:20:58,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:58,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:58,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989025165] [2020-07-08 12:20:58,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:20:58,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:58,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:59,002 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-08 12:20:59,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:59,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:59,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:59,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:59,003 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2020-07-08 12:20:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:59,426 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2020-07-08 12:20:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:59,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:20:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2020-07-08 12:20:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2020-07-08 12:20:59,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 197 transitions. [2020-07-08 12:20:59,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:59,664 INFO L225 Difference]: With dead ends: 1820 [2020-07-08 12:20:59,664 INFO L226 Difference]: Without dead ends: 1066 [2020-07-08 12:20:59,665 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-08 12:20:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2020-07-08 12:20:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2020-07-08 12:20:59,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:59,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1066 states. Second operand 1064 states. [2020-07-08 12:20:59,818 INFO L74 IsIncluded]: Start isIncluded. First operand 1066 states. Second operand 1064 states. [2020-07-08 12:20:59,819 INFO L87 Difference]: Start difference. First operand 1066 states. Second operand 1064 states. [2020-07-08 12:20:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:59,877 INFO L93 Difference]: Finished difference Result 1066 states and 1687 transitions. [2020-07-08 12:20:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1687 transitions. [2020-07-08 12:20:59,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:59,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:59,879 INFO L74 IsIncluded]: Start isIncluded. First operand 1064 states. Second operand 1066 states. [2020-07-08 12:20:59,879 INFO L87 Difference]: Start difference. First operand 1064 states. Second operand 1066 states. [2020-07-08 12:20:59,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:59,940 INFO L93 Difference]: Finished difference Result 1066 states and 1687 transitions. [2020-07-08 12:20:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1687 transitions. [2020-07-08 12:20:59,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:59,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:59,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:59,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2020-07-08 12:21:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2020-07-08 12:21:00,007 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2020-07-08 12:21:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:00,007 INFO L479 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2020-07-08 12:21:00,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2020-07-08 12:21:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:21:00,011 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:00,011 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-08 12:21:00,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-08 12:21:00,011 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:00,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:00,012 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2020-07-08 12:21:00,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:00,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93633587] [2020-07-08 12:21:00,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:00,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {22995#true} assume true; {22995#true} is VALID [2020-07-08 12:21:00,043 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22995#true} {22995#true} #214#return; {22995#true} is VALID [2020-07-08 12:21:00,043 INFO L263 TraceCheckUtils]: 0: Hoare triple {22995#true} call ULTIMATE.init(); {22995#true} is VALID [2020-07-08 12:21:00,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {22995#true} assume true; {22995#true} is VALID [2020-07-08 12:21:00,044 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22995#true} {22995#true} #214#return; {22995#true} is VALID [2020-07-08 12:21:00,044 INFO L263 TraceCheckUtils]: 3: Hoare triple {22995#true} call #t~ret12 := main(); {22995#true} is VALID [2020-07-08 12:21:00,044 INFO L280 TraceCheckUtils]: 4: Hoare triple {22995#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {22995#true} is VALID [2020-07-08 12:21:00,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {22995#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {22995#true} is VALID [2020-07-08 12:21:00,045 INFO L280 TraceCheckUtils]: 6: Hoare triple {22995#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;~lk10~0 := 0;~lk11~0 := 0; {22995#true} is VALID [2020-07-08 12:21:00,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {22995#true} assume !(0 != ~p1~0); {22995#true} is VALID [2020-07-08 12:21:00,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {22995#true} assume !(0 != ~p2~0); {22995#true} is VALID [2020-07-08 12:21:00,045 INFO L280 TraceCheckUtils]: 9: Hoare triple {22995#true} assume !(0 != ~p3~0); {22995#true} is VALID [2020-07-08 12:21:00,045 INFO L280 TraceCheckUtils]: 10: Hoare triple {22995#true} assume !(0 != ~p4~0); {22995#true} is VALID [2020-07-08 12:21:00,046 INFO L280 TraceCheckUtils]: 11: Hoare triple {22995#true} assume 0 != ~p5~0;~lk5~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:00,047 INFO L280 TraceCheckUtils]: 12: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p6~0;~lk6~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:00,047 INFO L280 TraceCheckUtils]: 13: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p7~0;~lk7~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:00,048 INFO L280 TraceCheckUtils]: 14: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p8~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:00,048 INFO L280 TraceCheckUtils]: 15: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p9~0;~lk9~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:00,049 INFO L280 TraceCheckUtils]: 16: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p10~0;~lk10~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:00,050 INFO L280 TraceCheckUtils]: 17: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p11~0;~lk11~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:00,050 INFO L280 TraceCheckUtils]: 18: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p1~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:00,051 INFO L280 TraceCheckUtils]: 19: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p2~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:00,051 INFO L280 TraceCheckUtils]: 20: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p3~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:00,052 INFO L280 TraceCheckUtils]: 21: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p4~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:00,052 INFO L280 TraceCheckUtils]: 22: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {22996#false} is VALID [2020-07-08 12:21:00,052 INFO L280 TraceCheckUtils]: 23: Hoare triple {22996#false} assume 0 != ~p6~0; {22996#false} is VALID [2020-07-08 12:21:00,053 INFO L280 TraceCheckUtils]: 24: Hoare triple {22996#false} assume 1 != ~lk6~0; {22996#false} is VALID [2020-07-08 12:21:00,053 INFO L280 TraceCheckUtils]: 25: Hoare triple {22996#false} assume !false; {22996#false} is VALID [2020-07-08 12:21:00,054 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-08 12:21:00,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93633587] [2020-07-08 12:21:00,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:00,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:00,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968133601] [2020-07-08 12:21:00,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:21:00,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:00,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:00,081 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-08 12:21:00,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:00,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:00,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:00,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:00,082 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2020-07-08 12:21:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:00,474 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2020-07-08 12:21:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:00,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:21:00,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2020-07-08 12:21:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2020-07-08 12:21:00,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 192 transitions. [2020-07-08 12:21:00,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:00,735 INFO L225 Difference]: With dead ends: 1596 [2020-07-08 12:21:00,736 INFO L226 Difference]: Without dead ends: 1082 [2020-07-08 12:21:00,748 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-08 12:21:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2020-07-08 12:21:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2020-07-08 12:21:00,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:00,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1082 states. Second operand 1080 states. [2020-07-08 12:21:00,913 INFO L74 IsIncluded]: Start isIncluded. First operand 1082 states. Second operand 1080 states. [2020-07-08 12:21:00,913 INFO L87 Difference]: Start difference. First operand 1082 states. Second operand 1080 states. [2020-07-08 12:21:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:00,992 INFO L93 Difference]: Finished difference Result 1082 states and 1687 transitions. [2020-07-08 12:21:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1687 transitions. [2020-07-08 12:21:00,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:00,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:00,995 INFO L74 IsIncluded]: Start isIncluded. First operand 1080 states. Second operand 1082 states. [2020-07-08 12:21:00,995 INFO L87 Difference]: Start difference. First operand 1080 states. Second operand 1082 states. [2020-07-08 12:21:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:01,066 INFO L93 Difference]: Finished difference Result 1082 states and 1687 transitions. [2020-07-08 12:21:01,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1687 transitions. [2020-07-08 12:21:01,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:01,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:01,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:01,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2020-07-08 12:21:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2020-07-08 12:21:01,134 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2020-07-08 12:21:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:01,134 INFO L479 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2020-07-08 12:21:01,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2020-07-08 12:21:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:21:01,137 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:01,137 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-08 12:21:01,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-08 12:21:01,137 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:01,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:01,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2020-07-08 12:21:01,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:01,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213543393] [2020-07-08 12:21:01,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:01,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {27936#true} assume true; {27936#true} is VALID [2020-07-08 12:21:01,169 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27936#true} {27936#true} #214#return; {27936#true} is VALID [2020-07-08 12:21:01,169 INFO L263 TraceCheckUtils]: 0: Hoare triple {27936#true} call ULTIMATE.init(); {27936#true} is VALID [2020-07-08 12:21:01,169 INFO L280 TraceCheckUtils]: 1: Hoare triple {27936#true} assume true; {27936#true} is VALID [2020-07-08 12:21:01,169 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27936#true} {27936#true} #214#return; {27936#true} is VALID [2020-07-08 12:21:01,170 INFO L263 TraceCheckUtils]: 3: Hoare triple {27936#true} call #t~ret12 := main(); {27936#true} is VALID [2020-07-08 12:21:01,170 INFO L280 TraceCheckUtils]: 4: Hoare triple {27936#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {27936#true} is VALID [2020-07-08 12:21:01,170 INFO L280 TraceCheckUtils]: 5: Hoare triple {27936#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {27936#true} is VALID [2020-07-08 12:21:01,170 INFO L280 TraceCheckUtils]: 6: Hoare triple {27936#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;~lk10~0 := 0;~lk11~0 := 0; {27936#true} is VALID [2020-07-08 12:21:01,170 INFO L280 TraceCheckUtils]: 7: Hoare triple {27936#true} assume !(0 != ~p1~0); {27936#true} is VALID [2020-07-08 12:21:01,171 INFO L280 TraceCheckUtils]: 8: Hoare triple {27936#true} assume !(0 != ~p2~0); {27936#true} is VALID [2020-07-08 12:21:01,171 INFO L280 TraceCheckUtils]: 9: Hoare triple {27936#true} assume !(0 != ~p3~0); {27936#true} is VALID [2020-07-08 12:21:01,171 INFO L280 TraceCheckUtils]: 10: Hoare triple {27936#true} assume !(0 != ~p4~0); {27936#true} is VALID [2020-07-08 12:21:01,172 INFO L280 TraceCheckUtils]: 11: Hoare triple {27936#true} assume !(0 != ~p5~0); {27936#true} is VALID [2020-07-08 12:21:01,173 INFO L280 TraceCheckUtils]: 12: Hoare triple {27936#true} assume 0 != ~p6~0;~lk6~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:01,173 INFO L280 TraceCheckUtils]: 13: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:01,174 INFO L280 TraceCheckUtils]: 14: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:01,174 INFO L280 TraceCheckUtils]: 15: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:01,175 INFO L280 TraceCheckUtils]: 16: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p10~0;~lk10~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:01,176 INFO L280 TraceCheckUtils]: 17: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p11~0;~lk11~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:01,176 INFO L280 TraceCheckUtils]: 18: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:01,177 INFO L280 TraceCheckUtils]: 19: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:01,177 INFO L280 TraceCheckUtils]: 20: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:01,178 INFO L280 TraceCheckUtils]: 21: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:01,178 INFO L280 TraceCheckUtils]: 22: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:01,179 INFO L280 TraceCheckUtils]: 23: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:01,179 INFO L280 TraceCheckUtils]: 24: Hoare triple {27940#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {27937#false} is VALID [2020-07-08 12:21:01,179 INFO L280 TraceCheckUtils]: 25: Hoare triple {27937#false} assume !false; {27937#false} is VALID [2020-07-08 12:21:01,180 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-08 12:21:01,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213543393] [2020-07-08 12:21:01,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:01,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:01,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930169922] [2020-07-08 12:21:01,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:21:01,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:01,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:01,211 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-08 12:21:01,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:01,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:01,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:01,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:01,212 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2020-07-08 12:21:01,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:01,847 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2020-07-08 12:21:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:01,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:21:01,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-08 12:21:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-08 12:21:01,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2020-07-08 12:21:01,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:02,114 INFO L225 Difference]: With dead ends: 1932 [2020-07-08 12:21:02,114 INFO L226 Difference]: Without dead ends: 1930 [2020-07-08 12:21:02,115 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-08 12:21:02,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-07-08 12:21:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2020-07-08 12:21:02,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:02,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1930 states. Second operand 1544 states. [2020-07-08 12:21:02,301 INFO L74 IsIncluded]: Start isIncluded. First operand 1930 states. Second operand 1544 states. [2020-07-08 12:21:02,301 INFO L87 Difference]: Start difference. First operand 1930 states. Second operand 1544 states. [2020-07-08 12:21:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:02,498 INFO L93 Difference]: Finished difference Result 1930 states and 3047 transitions. [2020-07-08 12:21:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3047 transitions. [2020-07-08 12:21:02,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:02,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:02,503 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand 1930 states. [2020-07-08 12:21:02,503 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand 1930 states. [2020-07-08 12:21:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:02,703 INFO L93 Difference]: Finished difference Result 1930 states and 3047 transitions. [2020-07-08 12:21:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3047 transitions. [2020-07-08 12:21:02,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:02,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:02,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:02,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2020-07-08 12:21:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2020-07-08 12:21:02,832 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2020-07-08 12:21:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:02,832 INFO L479 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2020-07-08 12:21:02,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:02,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2020-07-08 12:21:02,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:21:02,836 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:02,836 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-08 12:21:02,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-08 12:21:02,836 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:02,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:02,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2020-07-08 12:21:02,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:02,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654731357] [2020-07-08 12:21:02,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:02,868 INFO L280 TraceCheckUtils]: 0: Hoare triple {35389#true} assume true; {35389#true} is VALID [2020-07-08 12:21:02,868 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35389#true} {35389#true} #214#return; {35389#true} is VALID [2020-07-08 12:21:02,869 INFO L263 TraceCheckUtils]: 0: Hoare triple {35389#true} call ULTIMATE.init(); {35389#true} is VALID [2020-07-08 12:21:02,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {35389#true} assume true; {35389#true} is VALID [2020-07-08 12:21:02,869 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35389#true} {35389#true} #214#return; {35389#true} is VALID [2020-07-08 12:21:02,869 INFO L263 TraceCheckUtils]: 3: Hoare triple {35389#true} call #t~ret12 := main(); {35389#true} is VALID [2020-07-08 12:21:02,869 INFO L280 TraceCheckUtils]: 4: Hoare triple {35389#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {35389#true} is VALID [2020-07-08 12:21:02,870 INFO L280 TraceCheckUtils]: 5: Hoare triple {35389#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {35389#true} is VALID [2020-07-08 12:21:02,870 INFO L280 TraceCheckUtils]: 6: Hoare triple {35389#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;~lk10~0 := 0;~lk11~0 := 0; {35389#true} is VALID [2020-07-08 12:21:02,870 INFO L280 TraceCheckUtils]: 7: Hoare triple {35389#true} assume !(0 != ~p1~0); {35389#true} is VALID [2020-07-08 12:21:02,871 INFO L280 TraceCheckUtils]: 8: Hoare triple {35389#true} assume !(0 != ~p2~0); {35389#true} is VALID [2020-07-08 12:21:02,871 INFO L280 TraceCheckUtils]: 9: Hoare triple {35389#true} assume !(0 != ~p3~0); {35389#true} is VALID [2020-07-08 12:21:02,872 INFO L280 TraceCheckUtils]: 10: Hoare triple {35389#true} assume !(0 != ~p4~0); {35389#true} is VALID [2020-07-08 12:21:02,872 INFO L280 TraceCheckUtils]: 11: Hoare triple {35389#true} assume !(0 != ~p5~0); {35389#true} is VALID [2020-07-08 12:21:02,872 INFO L280 TraceCheckUtils]: 12: Hoare triple {35389#true} assume !(0 != ~p6~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,873 INFO L280 TraceCheckUtils]: 13: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {35393#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,873 INFO L280 TraceCheckUtils]: 14: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,874 INFO L280 TraceCheckUtils]: 15: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {35393#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,874 INFO L280 TraceCheckUtils]: 16: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p10~0;~lk10~0 := 1; {35393#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,875 INFO L280 TraceCheckUtils]: 17: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p11~0;~lk11~0 := 1; {35393#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,875 INFO L280 TraceCheckUtils]: 18: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,876 INFO L280 TraceCheckUtils]: 19: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,876 INFO L280 TraceCheckUtils]: 20: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,877 INFO L280 TraceCheckUtils]: 21: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,877 INFO L280 TraceCheckUtils]: 22: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,878 INFO L280 TraceCheckUtils]: 23: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p6~0; {35390#false} is VALID [2020-07-08 12:21:02,878 INFO L280 TraceCheckUtils]: 24: Hoare triple {35390#false} assume 1 != ~lk6~0; {35390#false} is VALID [2020-07-08 12:21:02,878 INFO L280 TraceCheckUtils]: 25: Hoare triple {35390#false} assume !false; {35390#false} is VALID [2020-07-08 12:21:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:21:02,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654731357] [2020-07-08 12:21:02,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:02,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:02,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270320804] [2020-07-08 12:21:02,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:21:02,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:02,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:02,908 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-08 12:21:02,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:02,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:02,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:02,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:02,909 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2020-07-08 12:21:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:04,347 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2020-07-08 12:21:04,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:04,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:21:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-08 12:21:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-08 12:21:04,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2020-07-08 12:21:04,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:04,810 INFO L225 Difference]: With dead ends: 3596 [2020-07-08 12:21:04,811 INFO L226 Difference]: Without dead ends: 2090 [2020-07-08 12:21:04,815 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-08 12:21:04,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2020-07-08 12:21:05,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2020-07-08 12:21:05,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:05,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2090 states. Second operand 2088 states. [2020-07-08 12:21:05,249 INFO L74 IsIncluded]: Start isIncluded. First operand 2090 states. Second operand 2088 states. [2020-07-08 12:21:05,249 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 2088 states. [2020-07-08 12:21:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:05,617 INFO L93 Difference]: Finished difference Result 2090 states and 3143 transitions. [2020-07-08 12:21:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3143 transitions. [2020-07-08 12:21:05,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:05,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:05,623 INFO L74 IsIncluded]: Start isIncluded. First operand 2088 states. Second operand 2090 states. [2020-07-08 12:21:05,623 INFO L87 Difference]: Start difference. First operand 2088 states. Second operand 2090 states. [2020-07-08 12:21:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:05,906 INFO L93 Difference]: Finished difference Result 2090 states and 3143 transitions. [2020-07-08 12:21:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3143 transitions. [2020-07-08 12:21:05,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:05,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:05,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:05,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2020-07-08 12:21:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2020-07-08 12:21:06,101 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2020-07-08 12:21:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:06,101 INFO L479 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2020-07-08 12:21:06,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2020-07-08 12:21:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:21:06,103 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:06,104 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-08 12:21:06,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-08 12:21:06,104 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:06,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:06,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2020-07-08 12:21:06,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:06,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396567725] [2020-07-08 12:21:06,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:06,129 INFO L280 TraceCheckUtils]: 0: Hoare triple {45434#true} assume true; {45434#true} is VALID [2020-07-08 12:21:06,129 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45434#true} {45434#true} #214#return; {45434#true} is VALID [2020-07-08 12:21:06,129 INFO L263 TraceCheckUtils]: 0: Hoare triple {45434#true} call ULTIMATE.init(); {45434#true} is VALID [2020-07-08 12:21:06,130 INFO L280 TraceCheckUtils]: 1: Hoare triple {45434#true} assume true; {45434#true} is VALID [2020-07-08 12:21:06,130 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45434#true} {45434#true} #214#return; {45434#true} is VALID [2020-07-08 12:21:06,130 INFO L263 TraceCheckUtils]: 3: Hoare triple {45434#true} call #t~ret12 := main(); {45434#true} is VALID [2020-07-08 12:21:06,130 INFO L280 TraceCheckUtils]: 4: Hoare triple {45434#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {45434#true} is VALID [2020-07-08 12:21:06,130 INFO L280 TraceCheckUtils]: 5: Hoare triple {45434#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {45434#true} is VALID [2020-07-08 12:21:06,131 INFO L280 TraceCheckUtils]: 6: Hoare triple {45434#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;~lk10~0 := 0;~lk11~0 := 0; {45434#true} is VALID [2020-07-08 12:21:06,131 INFO L280 TraceCheckUtils]: 7: Hoare triple {45434#true} assume !(0 != ~p1~0); {45434#true} is VALID [2020-07-08 12:21:06,131 INFO L280 TraceCheckUtils]: 8: Hoare triple {45434#true} assume !(0 != ~p2~0); {45434#true} is VALID [2020-07-08 12:21:06,131 INFO L280 TraceCheckUtils]: 9: Hoare triple {45434#true} assume !(0 != ~p3~0); {45434#true} is VALID [2020-07-08 12:21:06,131 INFO L280 TraceCheckUtils]: 10: Hoare triple {45434#true} assume !(0 != ~p4~0); {45434#true} is VALID [2020-07-08 12:21:06,131 INFO L280 TraceCheckUtils]: 11: Hoare triple {45434#true} assume !(0 != ~p5~0); {45434#true} is VALID [2020-07-08 12:21:06,132 INFO L280 TraceCheckUtils]: 12: Hoare triple {45434#true} assume 0 != ~p6~0;~lk6~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:06,133 INFO L280 TraceCheckUtils]: 13: Hoare triple {45438#(not (= 0 main_~p6~0))} assume 0 != ~p7~0;~lk7~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:06,133 INFO L280 TraceCheckUtils]: 14: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p8~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:06,134 INFO L280 TraceCheckUtils]: 15: Hoare triple {45438#(not (= 0 main_~p6~0))} assume 0 != ~p9~0;~lk9~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:06,134 INFO L280 TraceCheckUtils]: 16: Hoare triple {45438#(not (= 0 main_~p6~0))} assume 0 != ~p10~0;~lk10~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:06,135 INFO L280 TraceCheckUtils]: 17: Hoare triple {45438#(not (= 0 main_~p6~0))} assume 0 != ~p11~0;~lk11~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:06,135 INFO L280 TraceCheckUtils]: 18: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p1~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:06,136 INFO L280 TraceCheckUtils]: 19: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p2~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:06,136 INFO L280 TraceCheckUtils]: 20: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p3~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:06,137 INFO L280 TraceCheckUtils]: 21: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p4~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:06,137 INFO L280 TraceCheckUtils]: 22: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p5~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:06,138 INFO L280 TraceCheckUtils]: 23: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p6~0); {45435#false} is VALID [2020-07-08 12:21:06,138 INFO L280 TraceCheckUtils]: 24: Hoare triple {45435#false} assume 0 != ~p7~0; {45435#false} is VALID [2020-07-08 12:21:06,138 INFO L280 TraceCheckUtils]: 25: Hoare triple {45435#false} assume 1 != ~lk7~0; {45435#false} is VALID [2020-07-08 12:21:06,139 INFO L280 TraceCheckUtils]: 26: Hoare triple {45435#false} assume !false; {45435#false} is VALID [2020-07-08 12:21:06,140 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-08 12:21:06,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396567725] [2020-07-08 12:21:06,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:06,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:06,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016269087] [2020-07-08 12:21:06,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:21:06,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:06,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:06,167 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-08 12:21:06,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:06,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:06,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:06,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:06,168 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2020-07-08 12:21:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:06,937 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2020-07-08 12:21:06,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:06,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:21:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-08 12:21:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-08 12:21:06,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2020-07-08 12:21:07,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:07,265 INFO L225 Difference]: With dead ends: 3132 [2020-07-08 12:21:07,265 INFO L226 Difference]: Without dead ends: 2122 [2020-07-08 12:21:07,267 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-08 12:21:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-07-08 12:21:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2020-07-08 12:21:07,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:07,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2122 states. Second operand 2120 states. [2020-07-08 12:21:07,650 INFO L74 IsIncluded]: Start isIncluded. First operand 2122 states. Second operand 2120 states. [2020-07-08 12:21:07,650 INFO L87 Difference]: Start difference. First operand 2122 states. Second operand 2120 states. [2020-07-08 12:21:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:07,799 INFO L93 Difference]: Finished difference Result 2122 states and 3143 transitions. [2020-07-08 12:21:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3143 transitions. [2020-07-08 12:21:07,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:07,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:07,801 INFO L74 IsIncluded]: Start isIncluded. First operand 2120 states. Second operand 2122 states. [2020-07-08 12:21:07,801 INFO L87 Difference]: Start difference. First operand 2120 states. Second operand 2122 states. [2020-07-08 12:21:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:07,955 INFO L93 Difference]: Finished difference Result 2122 states and 3143 transitions. [2020-07-08 12:21:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3143 transitions. [2020-07-08 12:21:07,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:07,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:07,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:07,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2020-07-08 12:21:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2020-07-08 12:21:08,106 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2020-07-08 12:21:08,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:08,106 INFO L479 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2020-07-08 12:21:08,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2020-07-08 12:21:08,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:21:08,107 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:08,107 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-08 12:21:08,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-08 12:21:08,108 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:08,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:08,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2020-07-08 12:21:08,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:08,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821631826] [2020-07-08 12:21:08,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:08,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {55111#true} assume true; {55111#true} is VALID [2020-07-08 12:21:08,139 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {55111#true} {55111#true} #214#return; {55111#true} is VALID [2020-07-08 12:21:08,140 INFO L263 TraceCheckUtils]: 0: Hoare triple {55111#true} call ULTIMATE.init(); {55111#true} is VALID [2020-07-08 12:21:08,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {55111#true} assume true; {55111#true} is VALID [2020-07-08 12:21:08,140 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {55111#true} {55111#true} #214#return; {55111#true} is VALID [2020-07-08 12:21:08,140 INFO L263 TraceCheckUtils]: 3: Hoare triple {55111#true} call #t~ret12 := main(); {55111#true} is VALID [2020-07-08 12:21:08,141 INFO L280 TraceCheckUtils]: 4: Hoare triple {55111#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {55111#true} is VALID [2020-07-08 12:21:08,141 INFO L280 TraceCheckUtils]: 5: Hoare triple {55111#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {55111#true} is VALID [2020-07-08 12:21:08,141 INFO L280 TraceCheckUtils]: 6: Hoare triple {55111#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;~lk10~0 := 0;~lk11~0 := 0; {55111#true} is VALID [2020-07-08 12:21:08,141 INFO L280 TraceCheckUtils]: 7: Hoare triple {55111#true} assume !(0 != ~p1~0); {55111#true} is VALID [2020-07-08 12:21:08,141 INFO L280 TraceCheckUtils]: 8: Hoare triple {55111#true} assume !(0 != ~p2~0); {55111#true} is VALID [2020-07-08 12:21:08,142 INFO L280 TraceCheckUtils]: 9: Hoare triple {55111#true} assume !(0 != ~p3~0); {55111#true} is VALID [2020-07-08 12:21:08,142 INFO L280 TraceCheckUtils]: 10: Hoare triple {55111#true} assume !(0 != ~p4~0); {55111#true} is VALID [2020-07-08 12:21:08,142 INFO L280 TraceCheckUtils]: 11: Hoare triple {55111#true} assume !(0 != ~p5~0); {55111#true} is VALID [2020-07-08 12:21:08,142 INFO L280 TraceCheckUtils]: 12: Hoare triple {55111#true} assume !(0 != ~p6~0); {55111#true} is VALID [2020-07-08 12:21:08,143 INFO L280 TraceCheckUtils]: 13: Hoare triple {55111#true} assume 0 != ~p7~0;~lk7~0 := 1; {55115#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:08,143 INFO L280 TraceCheckUtils]: 14: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:08,144 INFO L280 TraceCheckUtils]: 15: Hoare triple {55115#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {55115#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:08,144 INFO L280 TraceCheckUtils]: 16: Hoare triple {55115#(= main_~lk7~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {55115#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:08,145 INFO L280 TraceCheckUtils]: 17: Hoare triple {55115#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {55115#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:08,145 INFO L280 TraceCheckUtils]: 18: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:08,146 INFO L280 TraceCheckUtils]: 19: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:08,146 INFO L280 TraceCheckUtils]: 20: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:08,147 INFO L280 TraceCheckUtils]: 21: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:08,147 INFO L280 TraceCheckUtils]: 22: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:08,148 INFO L280 TraceCheckUtils]: 23: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:08,148 INFO L280 TraceCheckUtils]: 24: Hoare triple {55115#(= main_~lk7~0 1)} assume 0 != ~p7~0; {55115#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:08,149 INFO L280 TraceCheckUtils]: 25: Hoare triple {55115#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {55112#false} is VALID [2020-07-08 12:21:08,149 INFO L280 TraceCheckUtils]: 26: Hoare triple {55112#false} assume !false; {55112#false} is VALID [2020-07-08 12:21:08,150 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-08 12:21:08,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821631826] [2020-07-08 12:21:08,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:08,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:08,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402039343] [2020-07-08 12:21:08,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:21:08,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:08,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:08,181 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-08 12:21:08,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:08,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:08,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:08,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:08,182 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2020-07-08 12:21:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:09,327 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2020-07-08 12:21:09,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:09,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:21:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-08 12:21:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-08 12:21:09,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2020-07-08 12:21:09,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:09,899 INFO L225 Difference]: With dead ends: 3724 [2020-07-08 12:21:09,900 INFO L226 Difference]: Without dead ends: 3722 [2020-07-08 12:21:09,901 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-08 12:21:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2020-07-08 12:21:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2020-07-08 12:21:10,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:10,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3722 states. Second operand 3080 states. [2020-07-08 12:21:10,306 INFO L74 IsIncluded]: Start isIncluded. First operand 3722 states. Second operand 3080 states. [2020-07-08 12:21:10,307 INFO L87 Difference]: Start difference. First operand 3722 states. Second operand 3080 states. [2020-07-08 12:21:10,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:10,715 INFO L93 Difference]: Finished difference Result 3722 states and 5575 transitions. [2020-07-08 12:21:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5575 transitions. [2020-07-08 12:21:10,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:10,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:10,719 INFO L74 IsIncluded]: Start isIncluded. First operand 3080 states. Second operand 3722 states. [2020-07-08 12:21:10,719 INFO L87 Difference]: Start difference. First operand 3080 states. Second operand 3722 states. [2020-07-08 12:21:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:11,181 INFO L93 Difference]: Finished difference Result 3722 states and 5575 transitions. [2020-07-08 12:21:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5575 transitions. [2020-07-08 12:21:11,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:11,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:11,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:11,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2020-07-08 12:21:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2020-07-08 12:21:11,490 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2020-07-08 12:21:11,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:11,490 INFO L479 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2020-07-08 12:21:11,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2020-07-08 12:21:11,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:21:11,492 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:11,492 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-08 12:21:11,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-08 12:21:11,493 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:11,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:11,493 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2020-07-08 12:21:11,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:11,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198444162] [2020-07-08 12:21:11,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:11,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {69572#true} assume true; {69572#true} is VALID [2020-07-08 12:21:11,524 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {69572#true} {69572#true} #214#return; {69572#true} is VALID [2020-07-08 12:21:11,524 INFO L263 TraceCheckUtils]: 0: Hoare triple {69572#true} call ULTIMATE.init(); {69572#true} is VALID [2020-07-08 12:21:11,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {69572#true} assume true; {69572#true} is VALID [2020-07-08 12:21:11,525 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {69572#true} {69572#true} #214#return; {69572#true} is VALID [2020-07-08 12:21:11,525 INFO L263 TraceCheckUtils]: 3: Hoare triple {69572#true} call #t~ret12 := main(); {69572#true} is VALID [2020-07-08 12:21:11,525 INFO L280 TraceCheckUtils]: 4: Hoare triple {69572#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {69572#true} is VALID [2020-07-08 12:21:11,525 INFO L280 TraceCheckUtils]: 5: Hoare triple {69572#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {69572#true} is VALID [2020-07-08 12:21:11,525 INFO L280 TraceCheckUtils]: 6: Hoare triple {69572#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;~lk10~0 := 0;~lk11~0 := 0; {69572#true} is VALID [2020-07-08 12:21:11,526 INFO L280 TraceCheckUtils]: 7: Hoare triple {69572#true} assume !(0 != ~p1~0); {69572#true} is VALID [2020-07-08 12:21:11,526 INFO L280 TraceCheckUtils]: 8: Hoare triple {69572#true} assume !(0 != ~p2~0); {69572#true} is VALID [2020-07-08 12:21:11,526 INFO L280 TraceCheckUtils]: 9: Hoare triple {69572#true} assume !(0 != ~p3~0); {69572#true} is VALID [2020-07-08 12:21:11,526 INFO L280 TraceCheckUtils]: 10: Hoare triple {69572#true} assume !(0 != ~p4~0); {69572#true} is VALID [2020-07-08 12:21:11,526 INFO L280 TraceCheckUtils]: 11: Hoare triple {69572#true} assume !(0 != ~p5~0); {69572#true} is VALID [2020-07-08 12:21:11,527 INFO L280 TraceCheckUtils]: 12: Hoare triple {69572#true} assume !(0 != ~p6~0); {69572#true} is VALID [2020-07-08 12:21:11,527 INFO L280 TraceCheckUtils]: 13: Hoare triple {69572#true} assume !(0 != ~p7~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:11,528 INFO L280 TraceCheckUtils]: 14: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:11,528 INFO L280 TraceCheckUtils]: 15: Hoare triple {69576#(= 0 main_~p7~0)} assume 0 != ~p9~0;~lk9~0 := 1; {69576#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:11,532 INFO L280 TraceCheckUtils]: 16: Hoare triple {69576#(= 0 main_~p7~0)} assume 0 != ~p10~0;~lk10~0 := 1; {69576#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:11,538 INFO L280 TraceCheckUtils]: 17: Hoare triple {69576#(= 0 main_~p7~0)} assume 0 != ~p11~0;~lk11~0 := 1; {69576#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:11,539 INFO L280 TraceCheckUtils]: 18: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:11,540 INFO L280 TraceCheckUtils]: 19: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:11,544 INFO L280 TraceCheckUtils]: 20: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:11,545 INFO L280 TraceCheckUtils]: 21: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:11,545 INFO L280 TraceCheckUtils]: 22: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:11,546 INFO L280 TraceCheckUtils]: 23: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:11,546 INFO L280 TraceCheckUtils]: 24: Hoare triple {69576#(= 0 main_~p7~0)} assume 0 != ~p7~0; {69573#false} is VALID [2020-07-08 12:21:11,546 INFO L280 TraceCheckUtils]: 25: Hoare triple {69573#false} assume 1 != ~lk7~0; {69573#false} is VALID [2020-07-08 12:21:11,547 INFO L280 TraceCheckUtils]: 26: Hoare triple {69573#false} assume !false; {69573#false} is VALID [2020-07-08 12:21:11,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-08 12:21:11,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198444162] [2020-07-08 12:21:11,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:11,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:11,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005300283] [2020-07-08 12:21:11,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:21:11,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:11,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:11,572 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-08 12:21:11,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:11,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:11,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:11,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:11,573 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2020-07-08 12:21:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:13,873 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2020-07-08 12:21:13,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:13,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:21:13,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-08 12:21:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-08 12:21:13,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2020-07-08 12:21:14,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:14,590 INFO L225 Difference]: With dead ends: 7116 [2020-07-08 12:21:14,591 INFO L226 Difference]: Without dead ends: 4106 [2020-07-08 12:21:14,595 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-08 12:21:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2020-07-08 12:21:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2020-07-08 12:21:15,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:15,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4106 states. Second operand 4104 states. [2020-07-08 12:21:15,305 INFO L74 IsIncluded]: Start isIncluded. First operand 4106 states. Second operand 4104 states. [2020-07-08 12:21:15,305 INFO L87 Difference]: Start difference. First operand 4106 states. Second operand 4104 states. [2020-07-08 12:21:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:15,797 INFO L93 Difference]: Finished difference Result 4106 states and 5831 transitions. [2020-07-08 12:21:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5831 transitions. [2020-07-08 12:21:15,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:15,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:15,801 INFO L74 IsIncluded]: Start isIncluded. First operand 4104 states. Second operand 4106 states. [2020-07-08 12:21:15,802 INFO L87 Difference]: Start difference. First operand 4104 states. Second operand 4106 states. [2020-07-08 12:21:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:16,317 INFO L93 Difference]: Finished difference Result 4106 states and 5831 transitions. [2020-07-08 12:21:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5831 transitions. [2020-07-08 12:21:16,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:16,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:16,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:16,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2020-07-08 12:21:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2020-07-08 12:21:16,827 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2020-07-08 12:21:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:16,828 INFO L479 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2020-07-08 12:21:16,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2020-07-08 12:21:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:21:16,830 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:16,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:16,831 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-08 12:21:16,831 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:16,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:16,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2020-07-08 12:21:16,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:16,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928977557] [2020-07-08 12:21:16,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:16,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {89345#true} assume true; {89345#true} is VALID [2020-07-08 12:21:16,853 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {89345#true} {89345#true} #214#return; {89345#true} is VALID [2020-07-08 12:21:16,853 INFO L263 TraceCheckUtils]: 0: Hoare triple {89345#true} call ULTIMATE.init(); {89345#true} is VALID [2020-07-08 12:21:16,853 INFO L280 TraceCheckUtils]: 1: Hoare triple {89345#true} assume true; {89345#true} is VALID [2020-07-08 12:21:16,853 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {89345#true} {89345#true} #214#return; {89345#true} is VALID [2020-07-08 12:21:16,854 INFO L263 TraceCheckUtils]: 3: Hoare triple {89345#true} call #t~ret12 := main(); {89345#true} is VALID [2020-07-08 12:21:16,854 INFO L280 TraceCheckUtils]: 4: Hoare triple {89345#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {89345#true} is VALID [2020-07-08 12:21:16,854 INFO L280 TraceCheckUtils]: 5: Hoare triple {89345#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {89345#true} is VALID [2020-07-08 12:21:16,854 INFO L280 TraceCheckUtils]: 6: Hoare triple {89345#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;~lk10~0 := 0;~lk11~0 := 0; {89345#true} is VALID [2020-07-08 12:21:16,854 INFO L280 TraceCheckUtils]: 7: Hoare triple {89345#true} assume !(0 != ~p1~0); {89345#true} is VALID [2020-07-08 12:21:16,854 INFO L280 TraceCheckUtils]: 8: Hoare triple {89345#true} assume !(0 != ~p2~0); {89345#true} is VALID [2020-07-08 12:21:16,855 INFO L280 TraceCheckUtils]: 9: Hoare triple {89345#true} assume !(0 != ~p3~0); {89345#true} is VALID [2020-07-08 12:21:16,855 INFO L280 TraceCheckUtils]: 10: Hoare triple {89345#true} assume !(0 != ~p4~0); {89345#true} is VALID [2020-07-08 12:21:16,855 INFO L280 TraceCheckUtils]: 11: Hoare triple {89345#true} assume !(0 != ~p5~0); {89345#true} is VALID [2020-07-08 12:21:16,855 INFO L280 TraceCheckUtils]: 12: Hoare triple {89345#true} assume !(0 != ~p6~0); {89345#true} is VALID [2020-07-08 12:21:16,856 INFO L280 TraceCheckUtils]: 13: Hoare triple {89345#true} assume 0 != ~p7~0;~lk7~0 := 1; {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:16,856 INFO L280 TraceCheckUtils]: 14: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p8~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:16,857 INFO L280 TraceCheckUtils]: 15: Hoare triple {89349#(not (= 0 main_~p7~0))} assume 0 != ~p9~0;~lk9~0 := 1; {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:16,857 INFO L280 TraceCheckUtils]: 16: Hoare triple {89349#(not (= 0 main_~p7~0))} assume 0 != ~p10~0;~lk10~0 := 1; {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:16,858 INFO L280 TraceCheckUtils]: 17: Hoare triple {89349#(not (= 0 main_~p7~0))} assume 0 != ~p11~0;~lk11~0 := 1; {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:16,858 INFO L280 TraceCheckUtils]: 18: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p1~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:16,858 INFO L280 TraceCheckUtils]: 19: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p2~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:16,859 INFO L280 TraceCheckUtils]: 20: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p3~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:16,859 INFO L280 TraceCheckUtils]: 21: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p4~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:16,860 INFO L280 TraceCheckUtils]: 22: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p5~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:16,860 INFO L280 TraceCheckUtils]: 23: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p6~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:16,861 INFO L280 TraceCheckUtils]: 24: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p7~0); {89346#false} is VALID [2020-07-08 12:21:16,861 INFO L280 TraceCheckUtils]: 25: Hoare triple {89346#false} assume 0 != ~p8~0; {89346#false} is VALID [2020-07-08 12:21:16,861 INFO L280 TraceCheckUtils]: 26: Hoare triple {89346#false} assume 1 != ~lk8~0; {89346#false} is VALID [2020-07-08 12:21:16,861 INFO L280 TraceCheckUtils]: 27: Hoare triple {89346#false} assume !false; {89346#false} is VALID [2020-07-08 12:21:16,862 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-08 12:21:16,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928977557] [2020-07-08 12:21:16,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:16,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:16,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114158062] [2020-07-08 12:21:16,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-08 12:21:16,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:16,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:16,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:16,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:16,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:16,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:16,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:16,896 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2020-07-08 12:21:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:18,927 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2020-07-08 12:21:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:18,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-08 12:21:18,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2020-07-08 12:21:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2020-07-08 12:21:18,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2020-07-08 12:21:19,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:19,714 INFO L225 Difference]: With dead ends: 6156 [2020-07-08 12:21:19,714 INFO L226 Difference]: Without dead ends: 4170 [2020-07-08 12:21:19,718 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-08 12:21:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2020-07-08 12:21:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2020-07-08 12:21:20,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:20,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4170 states. Second operand 4168 states. [2020-07-08 12:21:20,519 INFO L74 IsIncluded]: Start isIncluded. First operand 4170 states. Second operand 4168 states. [2020-07-08 12:21:20,520 INFO L87 Difference]: Start difference. First operand 4170 states. Second operand 4168 states. [2020-07-08 12:21:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:21,135 INFO L93 Difference]: Finished difference Result 4170 states and 5831 transitions. [2020-07-08 12:21:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5831 transitions. [2020-07-08 12:21:21,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:21,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:21,139 INFO L74 IsIncluded]: Start isIncluded. First operand 4168 states. Second operand 4170 states. [2020-07-08 12:21:21,139 INFO L87 Difference]: Start difference. First operand 4168 states. Second operand 4170 states. [2020-07-08 12:21:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:21,654 INFO L93 Difference]: Finished difference Result 4170 states and 5831 transitions. [2020-07-08 12:21:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5831 transitions. [2020-07-08 12:21:21,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:21,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:21,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:21,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2020-07-08 12:21:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2020-07-08 12:21:22,243 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2020-07-08 12:21:22,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:22,243 INFO L479 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2020-07-08 12:21:22,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2020-07-08 12:21:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:21:22,246 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:22,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:22,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-08 12:21:22,247 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:22,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:22,247 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2020-07-08 12:21:22,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:22,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233147415] [2020-07-08 12:21:22,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:22,272 INFO L280 TraceCheckUtils]: 0: Hoare triple {108350#true} assume true; {108350#true} is VALID [2020-07-08 12:21:22,272 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {108350#true} {108350#true} #214#return; {108350#true} is VALID [2020-07-08 12:21:22,273 INFO L263 TraceCheckUtils]: 0: Hoare triple {108350#true} call ULTIMATE.init(); {108350#true} is VALID [2020-07-08 12:21:22,273 INFO L280 TraceCheckUtils]: 1: Hoare triple {108350#true} assume true; {108350#true} is VALID [2020-07-08 12:21:22,273 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {108350#true} {108350#true} #214#return; {108350#true} is VALID [2020-07-08 12:21:22,273 INFO L263 TraceCheckUtils]: 3: Hoare triple {108350#true} call #t~ret12 := main(); {108350#true} is VALID [2020-07-08 12:21:22,273 INFO L280 TraceCheckUtils]: 4: Hoare triple {108350#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {108350#true} is VALID [2020-07-08 12:21:22,274 INFO L280 TraceCheckUtils]: 5: Hoare triple {108350#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {108350#true} is VALID [2020-07-08 12:21:22,274 INFO L280 TraceCheckUtils]: 6: Hoare triple {108350#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;~lk10~0 := 0;~lk11~0 := 0; {108350#true} is VALID [2020-07-08 12:21:22,274 INFO L280 TraceCheckUtils]: 7: Hoare triple {108350#true} assume !(0 != ~p1~0); {108350#true} is VALID [2020-07-08 12:21:22,274 INFO L280 TraceCheckUtils]: 8: Hoare triple {108350#true} assume !(0 != ~p2~0); {108350#true} is VALID [2020-07-08 12:21:22,274 INFO L280 TraceCheckUtils]: 9: Hoare triple {108350#true} assume !(0 != ~p3~0); {108350#true} is VALID [2020-07-08 12:21:22,274 INFO L280 TraceCheckUtils]: 10: Hoare triple {108350#true} assume !(0 != ~p4~0); {108350#true} is VALID [2020-07-08 12:21:22,275 INFO L280 TraceCheckUtils]: 11: Hoare triple {108350#true} assume !(0 != ~p5~0); {108350#true} is VALID [2020-07-08 12:21:22,275 INFO L280 TraceCheckUtils]: 12: Hoare triple {108350#true} assume !(0 != ~p6~0); {108350#true} is VALID [2020-07-08 12:21:22,275 INFO L280 TraceCheckUtils]: 13: Hoare triple {108350#true} assume !(0 != ~p7~0); {108350#true} is VALID [2020-07-08 12:21:22,276 INFO L280 TraceCheckUtils]: 14: Hoare triple {108350#true} assume !(0 != ~p8~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:22,276 INFO L280 TraceCheckUtils]: 15: Hoare triple {108354#(= 0 main_~p8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {108354#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:22,277 INFO L280 TraceCheckUtils]: 16: Hoare triple {108354#(= 0 main_~p8~0)} assume 0 != ~p10~0;~lk10~0 := 1; {108354#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:22,277 INFO L280 TraceCheckUtils]: 17: Hoare triple {108354#(= 0 main_~p8~0)} assume 0 != ~p11~0;~lk11~0 := 1; {108354#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:22,278 INFO L280 TraceCheckUtils]: 18: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:22,278 INFO L280 TraceCheckUtils]: 19: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:22,279 INFO L280 TraceCheckUtils]: 20: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:22,279 INFO L280 TraceCheckUtils]: 21: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:22,280 INFO L280 TraceCheckUtils]: 22: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:22,280 INFO L280 TraceCheckUtils]: 23: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:22,281 INFO L280 TraceCheckUtils]: 24: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:22,281 INFO L280 TraceCheckUtils]: 25: Hoare triple {108354#(= 0 main_~p8~0)} assume 0 != ~p8~0; {108351#false} is VALID [2020-07-08 12:21:22,281 INFO L280 TraceCheckUtils]: 26: Hoare triple {108351#false} assume 1 != ~lk8~0; {108351#false} is VALID [2020-07-08 12:21:22,281 INFO L280 TraceCheckUtils]: 27: Hoare triple {108351#false} assume !false; {108351#false} is VALID [2020-07-08 12:21:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:21:22,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233147415] [2020-07-08 12:21:22,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:22,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:22,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273035290] [2020-07-08 12:21:22,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-08 12:21:22,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:22,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:22,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:22,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:22,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:22,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:22,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:22,312 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2020-07-08 12:21:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:28,040 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2020-07-08 12:21:28,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:28,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-08 12:21:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-08 12:21:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-08 12:21:28,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2020-07-08 12:21:28,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:30,384 INFO L225 Difference]: With dead ends: 12108 [2020-07-08 12:21:30,384 INFO L226 Difference]: Without dead ends: 8074 [2020-07-08 12:21:30,388 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-08 12:21:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2020-07-08 12:21:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2020-07-08 12:21:31,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:31,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8074 states. Second operand 8072 states. [2020-07-08 12:21:31,926 INFO L74 IsIncluded]: Start isIncluded. First operand 8074 states. Second operand 8072 states. [2020-07-08 12:21:31,926 INFO L87 Difference]: Start difference. First operand 8074 states. Second operand 8072 states. [2020-07-08 12:21:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:33,856 INFO L93 Difference]: Finished difference Result 8074 states and 10887 transitions. [2020-07-08 12:21:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10887 transitions. [2020-07-08 12:21:33,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:33,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:33,862 INFO L74 IsIncluded]: Start isIncluded. First operand 8072 states. Second operand 8074 states. [2020-07-08 12:21:33,862 INFO L87 Difference]: Start difference. First operand 8072 states. Second operand 8074 states. [2020-07-08 12:21:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:35,825 INFO L93 Difference]: Finished difference Result 8074 states and 10887 transitions. [2020-07-08 12:21:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10887 transitions. [2020-07-08 12:21:35,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:35,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:35,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:35,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2020-07-08 12:21:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2020-07-08 12:21:37,970 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2020-07-08 12:21:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:37,970 INFO L479 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2020-07-08 12:21:37,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:37,971 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2020-07-08 12:21:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:21:37,973 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:37,973 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:37,973 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-08 12:21:37,973 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:37,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:37,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2020-07-08 12:21:37,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:37,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50072405] [2020-07-08 12:21:37,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:38,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {145339#true} assume true; {145339#true} is VALID [2020-07-08 12:21:38,016 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {145339#true} {145339#true} #214#return; {145339#true} is VALID [2020-07-08 12:21:38,017 INFO L263 TraceCheckUtils]: 0: Hoare triple {145339#true} call ULTIMATE.init(); {145339#true} is VALID [2020-07-08 12:21:38,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {145339#true} assume true; {145339#true} is VALID [2020-07-08 12:21:38,017 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {145339#true} {145339#true} #214#return; {145339#true} is VALID [2020-07-08 12:21:38,017 INFO L263 TraceCheckUtils]: 3: Hoare triple {145339#true} call #t~ret12 := main(); {145339#true} is VALID [2020-07-08 12:21:38,018 INFO L280 TraceCheckUtils]: 4: Hoare triple {145339#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {145339#true} is VALID [2020-07-08 12:21:38,018 INFO L280 TraceCheckUtils]: 5: Hoare triple {145339#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {145339#true} is VALID [2020-07-08 12:21:38,018 INFO L280 TraceCheckUtils]: 6: Hoare triple {145339#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;~lk10~0 := 0;~lk11~0 := 0; {145339#true} is VALID [2020-07-08 12:21:38,018 INFO L280 TraceCheckUtils]: 7: Hoare triple {145339#true} assume !(0 != ~p1~0); {145339#true} is VALID [2020-07-08 12:21:38,018 INFO L280 TraceCheckUtils]: 8: Hoare triple {145339#true} assume !(0 != ~p2~0); {145339#true} is VALID [2020-07-08 12:21:38,018 INFO L280 TraceCheckUtils]: 9: Hoare triple {145339#true} assume !(0 != ~p3~0); {145339#true} is VALID [2020-07-08 12:21:38,019 INFO L280 TraceCheckUtils]: 10: Hoare triple {145339#true} assume !(0 != ~p4~0); {145339#true} is VALID [2020-07-08 12:21:38,019 INFO L280 TraceCheckUtils]: 11: Hoare triple {145339#true} assume !(0 != ~p5~0); {145339#true} is VALID [2020-07-08 12:21:38,019 INFO L280 TraceCheckUtils]: 12: Hoare triple {145339#true} assume !(0 != ~p6~0); {145339#true} is VALID [2020-07-08 12:21:38,019 INFO L280 TraceCheckUtils]: 13: Hoare triple {145339#true} assume !(0 != ~p7~0); {145339#true} is VALID [2020-07-08 12:21:38,020 INFO L280 TraceCheckUtils]: 14: Hoare triple {145339#true} assume 0 != ~p8~0;~lk8~0 := 1; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:38,020 INFO L280 TraceCheckUtils]: 15: Hoare triple {145343#(= 1 main_~lk8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:38,021 INFO L280 TraceCheckUtils]: 16: Hoare triple {145343#(= 1 main_~lk8~0)} assume 0 != ~p10~0;~lk10~0 := 1; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:38,022 INFO L280 TraceCheckUtils]: 17: Hoare triple {145343#(= 1 main_~lk8~0)} assume 0 != ~p11~0;~lk11~0 := 1; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:38,022 INFO L280 TraceCheckUtils]: 18: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:38,023 INFO L280 TraceCheckUtils]: 19: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:38,024 INFO L280 TraceCheckUtils]: 20: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:38,024 INFO L280 TraceCheckUtils]: 21: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:38,025 INFO L280 TraceCheckUtils]: 22: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:38,026 INFO L280 TraceCheckUtils]: 23: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:38,026 INFO L280 TraceCheckUtils]: 24: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:38,027 INFO L280 TraceCheckUtils]: 25: Hoare triple {145343#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:38,028 INFO L280 TraceCheckUtils]: 26: Hoare triple {145343#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {145340#false} is VALID [2020-07-08 12:21:38,028 INFO L280 TraceCheckUtils]: 27: Hoare triple {145340#false} assume !false; {145340#false} is VALID [2020-07-08 12:21:38,029 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-08 12:21:38,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50072405] [2020-07-08 12:21:38,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:38,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:38,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861488784] [2020-07-08 12:21:38,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-08 12:21:38,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:38,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:38,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:38,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:38,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:38,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:38,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:38,069 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2020-07-08 12:21:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:42,866 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2020-07-08 12:21:42,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:42,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-08 12:21:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2020-07-08 12:21:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2020-07-08 12:21:42,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2020-07-08 12:21:42,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:45,691 INFO L225 Difference]: With dead ends: 9100 [2020-07-08 12:21:45,691 INFO L226 Difference]: Without dead ends: 9098 [2020-07-08 12:21:45,692 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-08 12:21:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2020-07-08 12:21:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2020-07-08 12:21:47,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:47,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9098 states. Second operand 8072 states. [2020-07-08 12:21:47,316 INFO L74 IsIncluded]: Start isIncluded. First operand 9098 states. Second operand 8072 states. [2020-07-08 12:21:47,317 INFO L87 Difference]: Start difference. First operand 9098 states. Second operand 8072 states. [2020-07-08 12:21:49,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:49,758 INFO L93 Difference]: Finished difference Result 9098 states and 12551 transitions. [2020-07-08 12:21:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 12551 transitions. [2020-07-08 12:21:49,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:49,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:49,763 INFO L74 IsIncluded]: Start isIncluded. First operand 8072 states. Second operand 9098 states. [2020-07-08 12:21:49,763 INFO L87 Difference]: Start difference. First operand 8072 states. Second operand 9098 states. [2020-07-08 12:21:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:52,241 INFO L93 Difference]: Finished difference Result 9098 states and 12551 transitions. [2020-07-08 12:21:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 12551 transitions. [2020-07-08 12:21:52,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:52,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:52,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:52,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2020-07-08 12:21:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2020-07-08 12:21:54,265 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2020-07-08 12:21:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:54,265 INFO L479 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2020-07-08 12:21:54,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2020-07-08 12:21:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:21:54,269 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:54,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:54,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-08 12:21:54,269 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:54,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:54,269 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2020-07-08 12:21:54,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:54,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522415411] [2020-07-08 12:21:54,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:54,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {181368#true} assume true; {181368#true} is VALID [2020-07-08 12:21:54,294 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {181368#true} {181368#true} #214#return; {181368#true} is VALID [2020-07-08 12:21:54,294 INFO L263 TraceCheckUtils]: 0: Hoare triple {181368#true} call ULTIMATE.init(); {181368#true} is VALID [2020-07-08 12:21:54,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {181368#true} assume true; {181368#true} is VALID [2020-07-08 12:21:54,295 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {181368#true} {181368#true} #214#return; {181368#true} is VALID [2020-07-08 12:21:54,295 INFO L263 TraceCheckUtils]: 3: Hoare triple {181368#true} call #t~ret12 := main(); {181368#true} is VALID [2020-07-08 12:21:54,295 INFO L280 TraceCheckUtils]: 4: Hoare triple {181368#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {181368#true} is VALID [2020-07-08 12:21:54,295 INFO L280 TraceCheckUtils]: 5: Hoare triple {181368#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {181368#true} is VALID [2020-07-08 12:21:54,295 INFO L280 TraceCheckUtils]: 6: Hoare triple {181368#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;~lk10~0 := 0;~lk11~0 := 0; {181368#true} is VALID [2020-07-08 12:21:54,296 INFO L280 TraceCheckUtils]: 7: Hoare triple {181368#true} assume !(0 != ~p1~0); {181368#true} is VALID [2020-07-08 12:21:54,296 INFO L280 TraceCheckUtils]: 8: Hoare triple {181368#true} assume !(0 != ~p2~0); {181368#true} is VALID [2020-07-08 12:21:54,296 INFO L280 TraceCheckUtils]: 9: Hoare triple {181368#true} assume !(0 != ~p3~0); {181368#true} is VALID [2020-07-08 12:21:54,296 INFO L280 TraceCheckUtils]: 10: Hoare triple {181368#true} assume !(0 != ~p4~0); {181368#true} is VALID [2020-07-08 12:21:54,296 INFO L280 TraceCheckUtils]: 11: Hoare triple {181368#true} assume !(0 != ~p5~0); {181368#true} is VALID [2020-07-08 12:21:54,297 INFO L280 TraceCheckUtils]: 12: Hoare triple {181368#true} assume !(0 != ~p6~0); {181368#true} is VALID [2020-07-08 12:21:54,297 INFO L280 TraceCheckUtils]: 13: Hoare triple {181368#true} assume !(0 != ~p7~0); {181368#true} is VALID [2020-07-08 12:21:54,297 INFO L280 TraceCheckUtils]: 14: Hoare triple {181368#true} assume !(0 != ~p8~0); {181368#true} is VALID [2020-07-08 12:21:54,298 INFO L280 TraceCheckUtils]: 15: Hoare triple {181368#true} assume 0 != ~p9~0;~lk9~0 := 1; {181372#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:54,298 INFO L280 TraceCheckUtils]: 16: Hoare triple {181372#(= 1 main_~lk9~0)} assume 0 != ~p10~0;~lk10~0 := 1; {181372#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:54,299 INFO L280 TraceCheckUtils]: 17: Hoare triple {181372#(= 1 main_~lk9~0)} assume 0 != ~p11~0;~lk11~0 := 1; {181372#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:54,299 INFO L280 TraceCheckUtils]: 18: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p1~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:54,300 INFO L280 TraceCheckUtils]: 19: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p2~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:54,300 INFO L280 TraceCheckUtils]: 20: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p3~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:54,301 INFO L280 TraceCheckUtils]: 21: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p4~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:54,301 INFO L280 TraceCheckUtils]: 22: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p5~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:54,302 INFO L280 TraceCheckUtils]: 23: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p6~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:54,303 INFO L280 TraceCheckUtils]: 24: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p7~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:54,313 INFO L280 TraceCheckUtils]: 25: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p8~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:54,320 INFO L280 TraceCheckUtils]: 26: Hoare triple {181372#(= 1 main_~lk9~0)} assume 0 != ~p9~0; {181372#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:54,320 INFO L280 TraceCheckUtils]: 27: Hoare triple {181372#(= 1 main_~lk9~0)} assume 1 != ~lk9~0; {181369#false} is VALID [2020-07-08 12:21:54,320 INFO L280 TraceCheckUtils]: 28: Hoare triple {181369#false} assume !false; {181369#false} is VALID [2020-07-08 12:21:54,321 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-08 12:21:54,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522415411] [2020-07-08 12:21:54,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:54,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:54,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980614066] [2020-07-08 12:21:54,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:21:54,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:54,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:54,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:54,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:54,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:54,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:54,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:54,356 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2020-07-08 12:22:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:03,013 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2020-07-08 12:22:03,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:22:03,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:22:03,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:22:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-08 12:22:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:22:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-08 12:22:03,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-08 12:22:03,129 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-08 12:22:09,235 INFO L225 Difference]: With dead ends: 13708 [2020-07-08 12:22:09,235 INFO L226 Difference]: Without dead ends: 13706 [2020-07-08 12:22:09,237 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-08 12:22:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2020-07-08 12:22:10,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2020-07-08 12:22:10,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:10,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13706 states. Second operand 12168 states. [2020-07-08 12:22:10,955 INFO L74 IsIncluded]: Start isIncluded. First operand 13706 states. Second operand 12168 states. [2020-07-08 12:22:10,955 INFO L87 Difference]: Start difference. First operand 13706 states. Second operand 12168 states. [2020-07-08 12:22:16,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:16,637 INFO L93 Difference]: Finished difference Result 13706 states and 18311 transitions. [2020-07-08 12:22:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 13706 states and 18311 transitions. [2020-07-08 12:22:16,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:16,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:16,647 INFO L74 IsIncluded]: Start isIncluded. First operand 12168 states. Second operand 13706 states. [2020-07-08 12:22:16,647 INFO L87 Difference]: Start difference. First operand 12168 states. Second operand 13706 states. [2020-07-08 12:22:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:22,351 INFO L93 Difference]: Finished difference Result 13706 states and 18311 transitions. [2020-07-08 12:22:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 13706 states and 18311 transitions. [2020-07-08 12:22:22,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:22,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:22,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:22,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2020-07-08 12:22:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2020-07-08 12:22:26,954 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2020-07-08 12:22:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:26,954 INFO L479 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2020-07-08 12:22:26,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:22:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2020-07-08 12:22:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:22:26,959 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:26,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:22:26,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-08 12:22:26,960 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:26,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:26,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2020-07-08 12:22:26,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:26,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123105601] [2020-07-08 12:22:26,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:26,988 INFO L280 TraceCheckUtils]: 0: Hoare triple {235445#true} assume true; {235445#true} is VALID [2020-07-08 12:22:26,989 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {235445#true} {235445#true} #214#return; {235445#true} is VALID [2020-07-08 12:22:26,989 INFO L263 TraceCheckUtils]: 0: Hoare triple {235445#true} call ULTIMATE.init(); {235445#true} is VALID [2020-07-08 12:22:26,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {235445#true} assume true; {235445#true} is VALID [2020-07-08 12:22:26,989 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {235445#true} {235445#true} #214#return; {235445#true} is VALID [2020-07-08 12:22:26,990 INFO L263 TraceCheckUtils]: 3: Hoare triple {235445#true} call #t~ret12 := main(); {235445#true} is VALID [2020-07-08 12:22:26,990 INFO L280 TraceCheckUtils]: 4: Hoare triple {235445#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {235445#true} is VALID [2020-07-08 12:22:26,990 INFO L280 TraceCheckUtils]: 5: Hoare triple {235445#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {235445#true} is VALID [2020-07-08 12:22:26,990 INFO L280 TraceCheckUtils]: 6: Hoare triple {235445#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;~lk10~0 := 0;~lk11~0 := 0; {235445#true} is VALID [2020-07-08 12:22:26,990 INFO L280 TraceCheckUtils]: 7: Hoare triple {235445#true} assume !(0 != ~p1~0); {235445#true} is VALID [2020-07-08 12:22:26,990 INFO L280 TraceCheckUtils]: 8: Hoare triple {235445#true} assume !(0 != ~p2~0); {235445#true} is VALID [2020-07-08 12:22:26,991 INFO L280 TraceCheckUtils]: 9: Hoare triple {235445#true} assume !(0 != ~p3~0); {235445#true} is VALID [2020-07-08 12:22:26,991 INFO L280 TraceCheckUtils]: 10: Hoare triple {235445#true} assume !(0 != ~p4~0); {235445#true} is VALID [2020-07-08 12:22:26,991 INFO L280 TraceCheckUtils]: 11: Hoare triple {235445#true} assume !(0 != ~p5~0); {235445#true} is VALID [2020-07-08 12:22:26,991 INFO L280 TraceCheckUtils]: 12: Hoare triple {235445#true} assume !(0 != ~p6~0); {235445#true} is VALID [2020-07-08 12:22:26,991 INFO L280 TraceCheckUtils]: 13: Hoare triple {235445#true} assume !(0 != ~p7~0); {235445#true} is VALID [2020-07-08 12:22:26,991 INFO L280 TraceCheckUtils]: 14: Hoare triple {235445#true} assume !(0 != ~p8~0); {235445#true} is VALID [2020-07-08 12:22:26,992 INFO L280 TraceCheckUtils]: 15: Hoare triple {235445#true} assume !(0 != ~p9~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:26,993 INFO L280 TraceCheckUtils]: 16: Hoare triple {235449#(= 0 main_~p9~0)} assume 0 != ~p10~0;~lk10~0 := 1; {235449#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:26,993 INFO L280 TraceCheckUtils]: 17: Hoare triple {235449#(= 0 main_~p9~0)} assume 0 != ~p11~0;~lk11~0 := 1; {235449#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:26,994 INFO L280 TraceCheckUtils]: 18: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p1~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:26,994 INFO L280 TraceCheckUtils]: 19: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p2~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:26,995 INFO L280 TraceCheckUtils]: 20: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p3~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:26,995 INFO L280 TraceCheckUtils]: 21: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p4~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:26,996 INFO L280 TraceCheckUtils]: 22: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p5~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:26,996 INFO L280 TraceCheckUtils]: 23: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p6~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:26,997 INFO L280 TraceCheckUtils]: 24: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p7~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:26,997 INFO L280 TraceCheckUtils]: 25: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p8~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:26,998 INFO L280 TraceCheckUtils]: 26: Hoare triple {235449#(= 0 main_~p9~0)} assume 0 != ~p9~0; {235446#false} is VALID [2020-07-08 12:22:26,998 INFO L280 TraceCheckUtils]: 27: Hoare triple {235446#false} assume 1 != ~lk9~0; {235446#false} is VALID [2020-07-08 12:22:26,998 INFO L280 TraceCheckUtils]: 28: Hoare triple {235446#false} assume !false; {235446#false} is VALID [2020-07-08 12:22:26,999 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-08 12:22:26,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123105601] [2020-07-08 12:22:26,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:22:27,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:22:27,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229955085] [2020-07-08 12:22:27,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:22:27,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:27,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:22:27,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:27,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:22:27,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:27,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:22:27,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:22:27,045 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2020-07-08 12:22:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:55,337 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2020-07-08 12:22:55,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:22:55,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:22:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:22:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2020-07-08 12:22:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:22:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2020-07-08 12:22:55,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2020-07-08 12:22:55,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:23:03,790 INFO L225 Difference]: With dead ends: 27788 [2020-07-08 12:23:03,790 INFO L226 Difference]: Without dead ends: 15754 [2020-07-08 12:23:03,800 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-08 12:23:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2020-07-08 12:23:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2020-07-08 12:23:07,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:23:07,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15754 states. Second operand 15752 states. [2020-07-08 12:23:07,182 INFO L74 IsIncluded]: Start isIncluded. First operand 15754 states. Second operand 15752 states. [2020-07-08 12:23:07,182 INFO L87 Difference]: Start difference. First operand 15754 states. Second operand 15752 states. [2020-07-08 12:23:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:23:14,175 INFO L93 Difference]: Finished difference Result 15754 states and 19975 transitions. [2020-07-08 12:23:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 15754 states and 19975 transitions. [2020-07-08 12:23:14,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:23:14,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:23:14,182 INFO L74 IsIncluded]: Start isIncluded. First operand 15752 states. Second operand 15754 states. [2020-07-08 12:23:14,182 INFO L87 Difference]: Start difference. First operand 15752 states. Second operand 15754 states. [2020-07-08 12:23:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:23:21,005 INFO L93 Difference]: Finished difference Result 15754 states and 19975 transitions. [2020-07-08 12:23:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 15754 states and 19975 transitions. [2020-07-08 12:23:21,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:23:21,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:23:21,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:23:21,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:23:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2020-07-08 12:23:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2020-07-08 12:23:28,723 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2020-07-08 12:23:28,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:23:28,723 INFO L479 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2020-07-08 12:23:28,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:23:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2020-07-08 12:23:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 12:23:28,729 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:23:28,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:23:28,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-08 12:23:28,729 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:23:28,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:23:28,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2020-07-08 12:23:28,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:23:28,731 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721307382] [2020-07-08 12:23:28,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:23:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:23:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:23:28,767 INFO L280 TraceCheckUtils]: 0: Hoare triple {311794#true} assume true; {311794#true} is VALID [2020-07-08 12:23:28,767 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {311794#true} {311794#true} #214#return; {311794#true} is VALID [2020-07-08 12:23:28,767 INFO L263 TraceCheckUtils]: 0: Hoare triple {311794#true} call ULTIMATE.init(); {311794#true} is VALID [2020-07-08 12:23:28,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {311794#true} assume true; {311794#true} is VALID [2020-07-08 12:23:28,768 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {311794#true} {311794#true} #214#return; {311794#true} is VALID [2020-07-08 12:23:28,768 INFO L263 TraceCheckUtils]: 3: Hoare triple {311794#true} call #t~ret12 := main(); {311794#true} is VALID [2020-07-08 12:23:28,768 INFO L280 TraceCheckUtils]: 4: Hoare triple {311794#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {311794#true} is VALID [2020-07-08 12:23:28,769 INFO L280 TraceCheckUtils]: 5: Hoare triple {311794#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {311794#true} is VALID [2020-07-08 12:23:28,769 INFO L280 TraceCheckUtils]: 6: Hoare triple {311794#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;~lk10~0 := 0;~lk11~0 := 0; {311794#true} is VALID [2020-07-08 12:23:28,769 INFO L280 TraceCheckUtils]: 7: Hoare triple {311794#true} assume !(0 != ~p1~0); {311794#true} is VALID [2020-07-08 12:23:28,769 INFO L280 TraceCheckUtils]: 8: Hoare triple {311794#true} assume !(0 != ~p2~0); {311794#true} is VALID [2020-07-08 12:23:28,769 INFO L280 TraceCheckUtils]: 9: Hoare triple {311794#true} assume !(0 != ~p3~0); {311794#true} is VALID [2020-07-08 12:23:28,769 INFO L280 TraceCheckUtils]: 10: Hoare triple {311794#true} assume !(0 != ~p4~0); {311794#true} is VALID [2020-07-08 12:23:28,770 INFO L280 TraceCheckUtils]: 11: Hoare triple {311794#true} assume !(0 != ~p5~0); {311794#true} is VALID [2020-07-08 12:23:28,770 INFO L280 TraceCheckUtils]: 12: Hoare triple {311794#true} assume !(0 != ~p6~0); {311794#true} is VALID [2020-07-08 12:23:28,770 INFO L280 TraceCheckUtils]: 13: Hoare triple {311794#true} assume !(0 != ~p7~0); {311794#true} is VALID [2020-07-08 12:23:28,770 INFO L280 TraceCheckUtils]: 14: Hoare triple {311794#true} assume !(0 != ~p8~0); {311794#true} is VALID [2020-07-08 12:23:28,774 INFO L280 TraceCheckUtils]: 15: Hoare triple {311794#true} assume 0 != ~p9~0;~lk9~0 := 1; {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:28,775 INFO L280 TraceCheckUtils]: 16: Hoare triple {311798#(not (= 0 main_~p9~0))} assume 0 != ~p10~0;~lk10~0 := 1; {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:28,775 INFO L280 TraceCheckUtils]: 17: Hoare triple {311798#(not (= 0 main_~p9~0))} assume 0 != ~p11~0;~lk11~0 := 1; {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:28,776 INFO L280 TraceCheckUtils]: 18: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p1~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:28,776 INFO L280 TraceCheckUtils]: 19: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p2~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:28,777 INFO L280 TraceCheckUtils]: 20: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p3~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:28,777 INFO L280 TraceCheckUtils]: 21: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p4~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:28,778 INFO L280 TraceCheckUtils]: 22: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p5~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:28,779 INFO L280 TraceCheckUtils]: 23: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p6~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:28,779 INFO L280 TraceCheckUtils]: 24: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p7~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:28,780 INFO L280 TraceCheckUtils]: 25: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p8~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:28,780 INFO L280 TraceCheckUtils]: 26: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p9~0); {311795#false} is VALID [2020-07-08 12:23:28,780 INFO L280 TraceCheckUtils]: 27: Hoare triple {311795#false} assume 0 != ~p10~0; {311795#false} is VALID [2020-07-08 12:23:28,781 INFO L280 TraceCheckUtils]: 28: Hoare triple {311795#false} assume 1 != ~lk10~0; {311795#false} is VALID [2020-07-08 12:23:28,781 INFO L280 TraceCheckUtils]: 29: Hoare triple {311795#false} assume !false; {311795#false} is VALID [2020-07-08 12:23:28,782 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-08 12:23:28,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721307382] [2020-07-08 12:23:28,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:23:28,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:23:28,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686262399] [2020-07-08 12:23:28,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 12:23:28,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:23:28,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:23:28,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:23:28,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:23:28,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:23:28,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:23:28,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:23:28,820 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2020-07-08 12:23:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:23:49,238 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2020-07-08 12:23:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:23:49,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 12:23:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:23:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:23:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-08 12:23:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:23:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-08 12:23:49,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2020-07-08 12:23:49,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:23:58,312 INFO L225 Difference]: With dead ends: 23820 [2020-07-08 12:23:58,312 INFO L226 Difference]: Without dead ends: 16138 [2020-07-08 12:23:58,319 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-08 12:23:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2020-07-08 12:24:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2020-07-08 12:24:01,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:24:01,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16138 states. Second operand 16136 states. [2020-07-08 12:24:01,783 INFO L74 IsIncluded]: Start isIncluded. First operand 16138 states. Second operand 16136 states. [2020-07-08 12:24:01,783 INFO L87 Difference]: Start difference. First operand 16138 states. Second operand 16136 states. [2020-07-08 12:24:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:09,498 INFO L93 Difference]: Finished difference Result 16138 states and 20231 transitions. [2020-07-08 12:24:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 16138 states and 20231 transitions. [2020-07-08 12:24:09,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:24:09,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:24:09,505 INFO L74 IsIncluded]: Start isIncluded. First operand 16136 states. Second operand 16138 states. [2020-07-08 12:24:09,505 INFO L87 Difference]: Start difference. First operand 16136 states. Second operand 16138 states. [2020-07-08 12:24:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:17,303 INFO L93 Difference]: Finished difference Result 16138 states and 20231 transitions. [2020-07-08 12:24:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand 16138 states and 20231 transitions. [2020-07-08 12:24:17,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:24:17,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:24:17,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:24:17,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:24:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2020-07-08 12:24:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2020-07-08 12:24:24,697 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2020-07-08 12:24:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:24:24,697 INFO L479 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2020-07-08 12:24:24,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:24:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2020-07-08 12:24:24,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 12:24:24,702 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:24:24,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:24:24,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-07-08 12:24:24,703 INFO L427 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:24:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:24:24,704 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2020-07-08 12:24:24,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:24:24,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154506419] [2020-07-08 12:24:24,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:24:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:24,739 INFO L280 TraceCheckUtils]: 0: Hoare triple {385327#true} assume true; {385327#true} is VALID [2020-07-08 12:24:24,739 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {385327#true} {385327#true} #214#return; {385327#true} is VALID [2020-07-08 12:24:24,740 INFO L263 TraceCheckUtils]: 0: Hoare triple {385327#true} call ULTIMATE.init(); {385327#true} is VALID [2020-07-08 12:24:24,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {385327#true} assume true; {385327#true} is VALID [2020-07-08 12:24:24,740 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {385327#true} {385327#true} #214#return; {385327#true} is VALID [2020-07-08 12:24:24,740 INFO L263 TraceCheckUtils]: 3: Hoare triple {385327#true} call #t~ret12 := main(); {385327#true} is VALID [2020-07-08 12:24:24,740 INFO L280 TraceCheckUtils]: 4: Hoare triple {385327#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {385327#true} is VALID [2020-07-08 12:24:24,740 INFO L280 TraceCheckUtils]: 5: Hoare triple {385327#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {385327#true} is VALID [2020-07-08 12:24:24,741 INFO L280 TraceCheckUtils]: 6: Hoare triple {385327#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;~lk10~0 := 0;~lk11~0 := 0; {385327#true} is VALID [2020-07-08 12:24:24,741 INFO L280 TraceCheckUtils]: 7: Hoare triple {385327#true} assume !(0 != ~p1~0); {385327#true} is VALID [2020-07-08 12:24:24,741 INFO L280 TraceCheckUtils]: 8: Hoare triple {385327#true} assume !(0 != ~p2~0); {385327#true} is VALID [2020-07-08 12:24:24,741 INFO L280 TraceCheckUtils]: 9: Hoare triple {385327#true} assume !(0 != ~p3~0); {385327#true} is VALID [2020-07-08 12:24:24,741 INFO L280 TraceCheckUtils]: 10: Hoare triple {385327#true} assume !(0 != ~p4~0); {385327#true} is VALID [2020-07-08 12:24:24,742 INFO L280 TraceCheckUtils]: 11: Hoare triple {385327#true} assume !(0 != ~p5~0); {385327#true} is VALID [2020-07-08 12:24:24,742 INFO L280 TraceCheckUtils]: 12: Hoare triple {385327#true} assume !(0 != ~p6~0); {385327#true} is VALID [2020-07-08 12:24:24,742 INFO L280 TraceCheckUtils]: 13: Hoare triple {385327#true} assume !(0 != ~p7~0); {385327#true} is VALID [2020-07-08 12:24:24,742 INFO L280 TraceCheckUtils]: 14: Hoare triple {385327#true} assume !(0 != ~p8~0); {385327#true} is VALID [2020-07-08 12:24:24,742 INFO L280 TraceCheckUtils]: 15: Hoare triple {385327#true} assume !(0 != ~p9~0); {385327#true} is VALID [2020-07-08 12:24:24,743 INFO L280 TraceCheckUtils]: 16: Hoare triple {385327#true} assume 0 != ~p10~0;~lk10~0 := 1; {385331#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:24,743 INFO L280 TraceCheckUtils]: 17: Hoare triple {385331#(= main_~lk10~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {385331#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:24,744 INFO L280 TraceCheckUtils]: 18: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:24,744 INFO L280 TraceCheckUtils]: 19: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:24,744 INFO L280 TraceCheckUtils]: 20: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:24,745 INFO L280 TraceCheckUtils]: 21: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:24,745 INFO L280 TraceCheckUtils]: 22: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:24,746 INFO L280 TraceCheckUtils]: 23: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:24,746 INFO L280 TraceCheckUtils]: 24: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:24,747 INFO L280 TraceCheckUtils]: 25: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:24,747 INFO L280 TraceCheckUtils]: 26: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:24,747 INFO L280 TraceCheckUtils]: 27: Hoare triple {385331#(= main_~lk10~0 1)} assume 0 != ~p10~0; {385331#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:24,748 INFO L280 TraceCheckUtils]: 28: Hoare triple {385331#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {385328#false} is VALID [2020-07-08 12:24:24,748 INFO L280 TraceCheckUtils]: 29: Hoare triple {385328#false} assume !false; {385328#false} is VALID [2020-07-08 12:24:24,749 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-08 12:24:24,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154506419] [2020-07-08 12:24:24,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:24:24,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:24:24,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483721883] [2020-07-08 12:24:24,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 12:24:24,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:24:24,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:24:24,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:24:24,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:24:24,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:24:24,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:24:24,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:24:24,777 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2020-07-08 12:24:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:54,847 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2020-07-08 12:24:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:24:54,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 12:24:54,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:24:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:24:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-08 12:24:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:24:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-08 12:24:54,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2020-07-08 12:24:54,958 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-08 12:25:18,225 INFO L225 Difference]: With dead ends: 26636 [2020-07-08 12:25:18,225 INFO L226 Difference]: Without dead ends: 26634 [2020-07-08 12:25:18,229 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-08 12:25:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2020-07-08 12:25:21,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2020-07-08 12:25:21,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:21,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26634 states. Second operand 24584 states. [2020-07-08 12:25:21,888 INFO L74 IsIncluded]: Start isIncluded. First operand 26634 states. Second operand 24584 states. [2020-07-08 12:25:21,888 INFO L87 Difference]: Start difference. First operand 26634 states. Second operand 24584 states. [2020-07-08 12:25:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:50,470 INFO L93 Difference]: Finished difference Result 26634 states and 33031 transitions. [2020-07-08 12:25:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 26634 states and 33031 transitions. [2020-07-08 12:25:50,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:50,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:50,487 INFO L74 IsIncluded]: Start isIncluded. First operand 24584 states. Second operand 26634 states. [2020-07-08 12:25:50,487 INFO L87 Difference]: Start difference. First operand 24584 states. Second operand 26634 states. [2020-07-08 12:26:17,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:26:17,166 INFO L93 Difference]: Finished difference Result 26634 states and 33031 transitions. [2020-07-08 12:26:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 26634 states and 33031 transitions. [2020-07-08 12:26:17,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:26:17,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:26:17,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:26:17,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:26:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2020-07-08 12:26:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2020-07-08 12:26:47,118 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2020-07-08 12:26:47,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:26:47,118 INFO L479 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2020-07-08 12:26:47,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:26:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2020-07-08 12:26:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 12:26:47,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:26:47,135 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:26:47,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-07-08 12:26:47,135 INFO L427 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:26:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:26:47,136 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2020-07-08 12:26:47,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:26:47,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553248338] [2020-07-08 12:26:47,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:26:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:26:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:26:47,163 INFO L280 TraceCheckUtils]: 0: Hoare triple {491372#true} assume true; {491372#true} is VALID [2020-07-08 12:26:47,163 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {491372#true} {491372#true} #214#return; {491372#true} is VALID [2020-07-08 12:26:47,163 INFO L263 TraceCheckUtils]: 0: Hoare triple {491372#true} call ULTIMATE.init(); {491372#true} is VALID [2020-07-08 12:26:47,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {491372#true} assume true; {491372#true} is VALID [2020-07-08 12:26:47,164 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {491372#true} {491372#true} #214#return; {491372#true} is VALID [2020-07-08 12:26:47,164 INFO L263 TraceCheckUtils]: 3: Hoare triple {491372#true} call #t~ret12 := main(); {491372#true} is VALID [2020-07-08 12:26:47,164 INFO L280 TraceCheckUtils]: 4: Hoare triple {491372#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {491372#true} is VALID [2020-07-08 12:26:47,164 INFO L280 TraceCheckUtils]: 5: Hoare triple {491372#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {491372#true} is VALID [2020-07-08 12:26:47,164 INFO L280 TraceCheckUtils]: 6: Hoare triple {491372#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;~lk10~0 := 0;~lk11~0 := 0; {491372#true} is VALID [2020-07-08 12:26:47,165 INFO L280 TraceCheckUtils]: 7: Hoare triple {491372#true} assume !(0 != ~p1~0); {491372#true} is VALID [2020-07-08 12:26:47,165 INFO L280 TraceCheckUtils]: 8: Hoare triple {491372#true} assume !(0 != ~p2~0); {491372#true} is VALID [2020-07-08 12:26:47,165 INFO L280 TraceCheckUtils]: 9: Hoare triple {491372#true} assume !(0 != ~p3~0); {491372#true} is VALID [2020-07-08 12:26:47,165 INFO L280 TraceCheckUtils]: 10: Hoare triple {491372#true} assume !(0 != ~p4~0); {491372#true} is VALID [2020-07-08 12:26:47,165 INFO L280 TraceCheckUtils]: 11: Hoare triple {491372#true} assume !(0 != ~p5~0); {491372#true} is VALID [2020-07-08 12:26:47,165 INFO L280 TraceCheckUtils]: 12: Hoare triple {491372#true} assume !(0 != ~p6~0); {491372#true} is VALID [2020-07-08 12:26:47,166 INFO L280 TraceCheckUtils]: 13: Hoare triple {491372#true} assume !(0 != ~p7~0); {491372#true} is VALID [2020-07-08 12:26:47,166 INFO L280 TraceCheckUtils]: 14: Hoare triple {491372#true} assume !(0 != ~p8~0); {491372#true} is VALID [2020-07-08 12:26:47,166 INFO L280 TraceCheckUtils]: 15: Hoare triple {491372#true} assume !(0 != ~p9~0); {491372#true} is VALID [2020-07-08 12:26:47,167 INFO L280 TraceCheckUtils]: 16: Hoare triple {491372#true} assume !(0 != ~p10~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-08 12:26:47,167 INFO L280 TraceCheckUtils]: 17: Hoare triple {491376#(= 0 main_~p10~0)} assume 0 != ~p11~0;~lk11~0 := 1; {491376#(= 0 main_~p10~0)} is VALID [2020-07-08 12:26:47,167 INFO L280 TraceCheckUtils]: 18: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p1~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-08 12:26:47,168 INFO L280 TraceCheckUtils]: 19: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p2~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-08 12:26:47,168 INFO L280 TraceCheckUtils]: 20: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p3~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-08 12:26:47,169 INFO L280 TraceCheckUtils]: 21: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p4~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-08 12:26:47,169 INFO L280 TraceCheckUtils]: 22: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p5~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-08 12:26:47,170 INFO L280 TraceCheckUtils]: 23: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p6~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-08 12:26:47,170 INFO L280 TraceCheckUtils]: 24: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p7~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-08 12:26:47,170 INFO L280 TraceCheckUtils]: 25: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p8~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-08 12:26:47,171 INFO L280 TraceCheckUtils]: 26: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p9~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-08 12:26:47,171 INFO L280 TraceCheckUtils]: 27: Hoare triple {491376#(= 0 main_~p10~0)} assume 0 != ~p10~0; {491373#false} is VALID [2020-07-08 12:26:47,171 INFO L280 TraceCheckUtils]: 28: Hoare triple {491373#false} assume 1 != ~lk10~0; {491373#false} is VALID [2020-07-08 12:26:47,172 INFO L280 TraceCheckUtils]: 29: Hoare triple {491373#false} assume !false; {491373#false} is VALID [2020-07-08 12:26:47,172 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-08 12:26:47,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553248338] [2020-07-08 12:26:47,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:26:47,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:26:47,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290732984] [2020-07-08 12:26:47,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 12:26:47,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:26:47,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:26:47,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:26:47,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:26:47,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:26:47,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:26:47,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:26:47,206 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2020-07-08 12:30:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:30:42,733 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2020-07-08 12:30:42,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:30:42,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 12:30:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:30:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:30:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2020-07-08 12:30:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:30:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2020-07-08 12:30:42,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 182 transitions. [2020-07-08 12:30:42,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:31:19,597 INFO L225 Difference]: With dead ends: 55308 [2020-07-08 12:31:19,597 INFO L226 Difference]: Without dead ends: 31242 [2020-07-08 12:31:19,619 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-08 12:31:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2020-07-08 12:31:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2020-07-08 12:31:27,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:31:27,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31242 states. Second operand 31240 states. [2020-07-08 12:31:27,410 INFO L74 IsIncluded]: Start isIncluded. First operand 31242 states. Second operand 31240 states. [2020-07-08 12:31:27,411 INFO L87 Difference]: Start difference. First operand 31242 states. Second operand 31240 states. [2020-07-08 12:32:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:32:00,846 INFO L93 Difference]: Finished difference Result 31242 states and 36871 transitions. [2020-07-08 12:32:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 31242 states and 36871 transitions. [2020-07-08 12:32:00,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:32:00,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:32:00,862 INFO L74 IsIncluded]: Start isIncluded. First operand 31240 states. Second operand 31242 states. [2020-07-08 12:32:00,863 INFO L87 Difference]: Start difference. First operand 31240 states. Second operand 31242 states. [2020-07-08 12:32:36,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:32:36,458 INFO L93 Difference]: Finished difference Result 31242 states and 36871 transitions. [2020-07-08 12:32:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 31242 states and 36871 transitions. [2020-07-08 12:32:36,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:32:36,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:32:36,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:32:36,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:32:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2020-07-08 12:33:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2020-07-08 12:33:58,157 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2020-07-08 12:33:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:33:58,158 INFO L479 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2020-07-08 12:33:58,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:33:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2020-07-08 12:33:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 12:33:58,168 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:33:58,168 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:33:58,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-07-08 12:33:58,168 INFO L427 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:33:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:33:58,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2020-07-08 12:33:58,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:33:58,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505579600] [2020-07-08 12:33:58,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:33:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:33:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:33:58,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {642985#true} assume true; {642985#true} is VALID [2020-07-08 12:33:58,199 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {642985#true} {642985#true} #214#return; {642985#true} is VALID [2020-07-08 12:33:58,199 INFO L263 TraceCheckUtils]: 0: Hoare triple {642985#true} call ULTIMATE.init(); {642985#true} is VALID [2020-07-08 12:33:58,199 INFO L280 TraceCheckUtils]: 1: Hoare triple {642985#true} assume true; {642985#true} is VALID [2020-07-08 12:33:58,200 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {642985#true} {642985#true} #214#return; {642985#true} is VALID [2020-07-08 12:33:58,200 INFO L263 TraceCheckUtils]: 3: Hoare triple {642985#true} call #t~ret12 := main(); {642985#true} is VALID [2020-07-08 12:33:58,200 INFO L280 TraceCheckUtils]: 4: Hoare triple {642985#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;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {642985#true} is VALID [2020-07-08 12:33:58,200 INFO L280 TraceCheckUtils]: 5: Hoare triple {642985#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {642985#true} is VALID [2020-07-08 12:33:58,200 INFO L280 TraceCheckUtils]: 6: Hoare triple {642985#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;~lk10~0 := 0;~lk11~0 := 0; {642985#true} is VALID [2020-07-08 12:33:58,200 INFO L280 TraceCheckUtils]: 7: Hoare triple {642985#true} assume !(0 != ~p1~0); {642985#true} is VALID [2020-07-08 12:33:58,201 INFO L280 TraceCheckUtils]: 8: Hoare triple {642985#true} assume !(0 != ~p2~0); {642985#true} is VALID [2020-07-08 12:33:58,201 INFO L280 TraceCheckUtils]: 9: Hoare triple {642985#true} assume !(0 != ~p3~0); {642985#true} is VALID [2020-07-08 12:33:58,201 INFO L280 TraceCheckUtils]: 10: Hoare triple {642985#true} assume !(0 != ~p4~0); {642985#true} is VALID [2020-07-08 12:33:58,201 INFO L280 TraceCheckUtils]: 11: Hoare triple {642985#true} assume !(0 != ~p5~0); {642985#true} is VALID [2020-07-08 12:33:58,201 INFO L280 TraceCheckUtils]: 12: Hoare triple {642985#true} assume !(0 != ~p6~0); {642985#true} is VALID [2020-07-08 12:33:58,201 INFO L280 TraceCheckUtils]: 13: Hoare triple {642985#true} assume !(0 != ~p7~0); {642985#true} is VALID [2020-07-08 12:33:58,201 INFO L280 TraceCheckUtils]: 14: Hoare triple {642985#true} assume !(0 != ~p8~0); {642985#true} is VALID [2020-07-08 12:33:58,202 INFO L280 TraceCheckUtils]: 15: Hoare triple {642985#true} assume !(0 != ~p9~0); {642985#true} is VALID [2020-07-08 12:33:58,202 INFO L280 TraceCheckUtils]: 16: Hoare triple {642985#true} assume 0 != ~p10~0;~lk10~0 := 1; {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-08 12:33:58,203 INFO L280 TraceCheckUtils]: 17: Hoare triple {642989#(not (= 0 main_~p10~0))} assume 0 != ~p11~0;~lk11~0 := 1; {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-08 12:33:58,203 INFO L280 TraceCheckUtils]: 18: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p1~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-08 12:33:58,204 INFO L280 TraceCheckUtils]: 19: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p2~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-08 12:33:58,204 INFO L280 TraceCheckUtils]: 20: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p3~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-08 12:33:58,205 INFO L280 TraceCheckUtils]: 21: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p4~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-08 12:33:58,205 INFO L280 TraceCheckUtils]: 22: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p5~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-08 12:33:58,206 INFO L280 TraceCheckUtils]: 23: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p6~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-08 12:33:58,206 INFO L280 TraceCheckUtils]: 24: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p7~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-08 12:33:58,207 INFO L280 TraceCheckUtils]: 25: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p8~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-08 12:33:58,207 INFO L280 TraceCheckUtils]: 26: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p9~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-08 12:33:58,208 INFO L280 TraceCheckUtils]: 27: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p10~0); {642986#false} is VALID [2020-07-08 12:33:58,208 INFO L280 TraceCheckUtils]: 28: Hoare triple {642986#false} assume 0 != ~p11~0; {642986#false} is VALID [2020-07-08 12:33:58,208 INFO L280 TraceCheckUtils]: 29: Hoare triple {642986#false} assume 1 != ~lk11~0; {642986#false} is VALID [2020-07-08 12:33:58,208 INFO L280 TraceCheckUtils]: 30: Hoare triple {642986#false} assume !false; {642986#false} is VALID [2020-07-08 12:33:58,209 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-08 12:33:58,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505579600] [2020-07-08 12:33:58,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:33:58,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:33:58,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662095322] [2020-07-08 12:33:58,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-08 12:33:58,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:33:58,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:33:58,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:33:58,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:33:58,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:33:58,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:33:58,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:33:58,243 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states.