/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:04:06,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:04:06,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:04:06,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:04:06,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:04:06,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:04:06,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:04:06,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:04:06,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:04:06,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:04:06,567 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:04:06,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:04:06,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:04:06,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:04:06,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:04:06,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:04:06,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:04:06,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:04:06,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:04:06,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:04:06,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:04:06,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:04:06,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:04:06,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:04:06,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:04:06,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:04:06,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:04:06,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:04:06,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:04:06,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:04:06,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:04:06,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:04:06,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:04:06,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:04:06,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:04:06,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:04:06,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:04:06,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:04:06,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:04:06,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:04:06,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:04:06,611 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-10 15:04:06,646 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:04:06,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:04:06,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:04:06,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:04:06,650 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:04:06,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:04:06,651 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:04:06,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:04:06,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:04:06,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:04:06,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:04:06,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:04:06,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:04:06,652 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:04:06,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:04:06,653 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:04:06,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:04:06,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:04:06,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:04:06,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:04:06,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:04:06,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:04:06,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:04:06,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:04:06,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:04:06,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:04:06,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:04:06,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:04:06,656 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:04:06,656 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:04:06,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:04:06,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:04:06,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:04:06,952 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:04:06,952 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:04:06,953 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2020-07-10 15:04:07,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06267d177/88eef5675bd745a8ad949b40013fb604/FLAG493e83b6a [2020-07-10 15:04:07,548 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:04:07,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2020-07-10 15:04:07,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06267d177/88eef5675bd745a8ad949b40013fb604/FLAG493e83b6a [2020-07-10 15:04:07,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06267d177/88eef5675bd745a8ad949b40013fb604 [2020-07-10 15:04:07,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:04:07,891 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:04:07,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:04:07,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:04:07,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:04:07,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:04:07" (1/1) ... [2020-07-10 15:04:07,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51541991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:07, skipping insertion in model container [2020-07-10 15:04:07,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:04:07" (1/1) ... [2020-07-10 15:04:07,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:04:07,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:04:08,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:04:08,129 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:04:08,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:04:08,174 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:04:08,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:08 WrapperNode [2020-07-10 15:04:08,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:04:08,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:04:08,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:04:08,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:04:08,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:08" (1/1) ... [2020-07-10 15:04:08,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:08" (1/1) ... [2020-07-10 15:04:08,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:08" (1/1) ... [2020-07-10 15:04:08,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:08" (1/1) ... [2020-07-10 15:04:08,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:08" (1/1) ... [2020-07-10 15:04:08,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:08" (1/1) ... [2020-07-10 15:04:08,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:08" (1/1) ... [2020-07-10 15:04:08,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:04:08,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:04:08,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:04:08,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:04:08,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:08" (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-10 15:04:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:04:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:04:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:04:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:04:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:04:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:04:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:04:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:04:08,893 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:04:08,893 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:04:08,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:04:08 BoogieIcfgContainer [2020-07-10 15:04:08,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:04:08,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:04:08,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:04:08,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:04:08,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:04:07" (1/3) ... [2020-07-10 15:04:08,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a49ead1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:04:08, skipping insertion in model container [2020-07-10 15:04:08,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:08" (2/3) ... [2020-07-10 15:04:08,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a49ead1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:04:08, skipping insertion in model container [2020-07-10 15:04:08,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:04:08" (3/3) ... [2020-07-10 15:04:08,907 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2020-07-10 15:04:08,917 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:04:08,926 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:04:08,941 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:04:08,967 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:04:08,967 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:04:08,967 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:04:08,968 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:04:08,968 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:04:08,968 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:04:08,968 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:04:08,969 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:04:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2020-07-10 15:04:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:04:08,997 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:08,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:08,999 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:09,006 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2020-07-10 15:04:09,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:09,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307771691] [2020-07-10 15:04:09,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:09,240 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-10 15:04:09,241 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {44#true} {44#true} #180#return; {44#true} is VALID [2020-07-10 15:04:09,243 INFO L263 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {44#true} is VALID [2020-07-10 15:04:09,244 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-10 15:04:09,245 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {44#true} {44#true} #180#return; {44#true} is VALID [2020-07-10 15:04:09,245 INFO L263 TraceCheckUtils]: 3: Hoare triple {44#true} call #t~ret10 := main(); {44#true} is VALID [2020-07-10 15:04:09,246 INFO L280 TraceCheckUtils]: 4: Hoare triple {44#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {44#true} is VALID [2020-07-10 15:04:09,247 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {44#true} is VALID [2020-07-10 15:04:09,247 INFO L280 TraceCheckUtils]: 6: Hoare triple {44#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {44#true} is VALID [2020-07-10 15:04:09,249 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#true} assume 0 != ~p1~0;~lk1~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:09,250 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:09,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:09,252 INFO L280 TraceCheckUtils]: 10: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:09,254 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:09,255 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:09,256 INFO L280 TraceCheckUtils]: 13: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:09,257 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {48#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:09,258 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {48#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:09,259 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {48#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:09,260 INFO L280 TraceCheckUtils]: 17: Hoare triple {48#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {45#false} is VALID [2020-07-10 15:04:09,261 INFO L280 TraceCheckUtils]: 18: Hoare triple {45#false} assume !false; {45#false} is VALID [2020-07-10 15:04:09,264 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-10 15:04:09,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307771691] [2020-07-10 15:04:09,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:09,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:09,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797395566] [2020-07-10 15:04:09,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:04:09,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:09,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:09,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:09,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:09,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:09,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:09,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:09,339 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2020-07-10 15:04:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:09,552 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2020-07-10 15:04:09,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:09,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:04:09,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-10 15:04:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-10 15:04:09,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-10 15:04:09,785 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-10 15:04:09,801 INFO L225 Difference]: With dead ends: 81 [2020-07-10 15:04:09,801 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 15:04:09,805 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-10 15:04:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 15:04:09,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2020-07-10 15:04:09,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:09,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 46 states. [2020-07-10 15:04:09,853 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 46 states. [2020-07-10 15:04:09,854 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 46 states. [2020-07-10 15:04:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:09,862 INFO L93 Difference]: Finished difference Result 66 states and 116 transitions. [2020-07-10 15:04:09,862 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 116 transitions. [2020-07-10 15:04:09,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:09,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:09,864 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 66 states. [2020-07-10 15:04:09,864 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 66 states. [2020-07-10 15:04:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:09,872 INFO L93 Difference]: Finished difference Result 66 states and 116 transitions. [2020-07-10 15:04:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 116 transitions. [2020-07-10 15:04:09,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:09,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:09,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:09,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 15:04:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2020-07-10 15:04:09,880 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2020-07-10 15:04:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:09,880 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2020-07-10 15:04:09,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2020-07-10 15:04:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:04:09,882 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:09,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:09,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:04:09,883 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:09,883 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2020-07-10 15:04:09,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:09,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575789999] [2020-07-10 15:04:09,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:09,963 INFO L280 TraceCheckUtils]: 0: Hoare triple {328#true} assume true; {328#true} is VALID [2020-07-10 15:04:09,964 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {328#true} {328#true} #180#return; {328#true} is VALID [2020-07-10 15:04:09,964 INFO L263 TraceCheckUtils]: 0: Hoare triple {328#true} call ULTIMATE.init(); {328#true} is VALID [2020-07-10 15:04:09,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {328#true} assume true; {328#true} is VALID [2020-07-10 15:04:09,965 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {328#true} {328#true} #180#return; {328#true} is VALID [2020-07-10 15:04:09,965 INFO L263 TraceCheckUtils]: 3: Hoare triple {328#true} call #t~ret10 := main(); {328#true} is VALID [2020-07-10 15:04:09,966 INFO L280 TraceCheckUtils]: 4: Hoare triple {328#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {328#true} is VALID [2020-07-10 15:04:09,966 INFO L280 TraceCheckUtils]: 5: Hoare triple {328#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {328#true} is VALID [2020-07-10 15:04:09,966 INFO L280 TraceCheckUtils]: 6: Hoare triple {328#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {328#true} is VALID [2020-07-10 15:04:09,967 INFO L280 TraceCheckUtils]: 7: Hoare triple {328#true} assume !(0 != ~p1~0); {332#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:09,968 INFO L280 TraceCheckUtils]: 8: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:09,969 INFO L280 TraceCheckUtils]: 9: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:09,970 INFO L280 TraceCheckUtils]: 10: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:09,970 INFO L280 TraceCheckUtils]: 11: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:09,971 INFO L280 TraceCheckUtils]: 12: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:09,972 INFO L280 TraceCheckUtils]: 13: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:09,973 INFO L280 TraceCheckUtils]: 14: Hoare triple {332#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {332#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:09,974 INFO L280 TraceCheckUtils]: 15: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {332#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:09,975 INFO L280 TraceCheckUtils]: 16: Hoare triple {332#(= 0 main_~p1~0)} assume 0 != ~p1~0; {329#false} is VALID [2020-07-10 15:04:09,976 INFO L280 TraceCheckUtils]: 17: Hoare triple {329#false} assume 1 != ~lk1~0; {329#false} is VALID [2020-07-10 15:04:09,976 INFO L280 TraceCheckUtils]: 18: Hoare triple {329#false} assume !false; {329#false} is VALID [2020-07-10 15:04:09,977 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-10 15:04:09,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575789999] [2020-07-10 15:04:09,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:09,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:09,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779867076] [2020-07-10 15:04:09,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:04:09,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:09,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:10,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:10,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:10,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:10,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:10,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:10,006 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2020-07-10 15:04:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,152 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2020-07-10 15:04:10,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:10,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:04:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2020-07-10 15:04:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2020-07-10 15:04:10,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2020-07-10 15:04:10,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:10,375 INFO L225 Difference]: With dead ends: 107 [2020-07-10 15:04:10,376 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 15:04:10,377 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-10 15:04:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 15:04:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-07-10 15:04:10,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:10,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2020-07-10 15:04:10,395 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2020-07-10 15:04:10,395 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2020-07-10 15:04:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,404 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2020-07-10 15:04:10,405 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 114 transitions. [2020-07-10 15:04:10,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:10,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:10,409 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2020-07-10 15:04:10,410 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2020-07-10 15:04:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,415 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2020-07-10 15:04:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 114 transitions. [2020-07-10 15:04:10,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:10,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:10,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:10,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-10 15:04:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2020-07-10 15:04:10,426 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2020-07-10 15:04:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:10,427 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2020-07-10 15:04:10,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2020-07-10 15:04:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:04:10,432 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:10,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:10,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:04:10,434 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:10,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:10,435 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2020-07-10 15:04:10,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:10,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640399900] [2020-07-10 15:04:10,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:10,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {655#true} assume true; {655#true} is VALID [2020-07-10 15:04:10,507 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {655#true} {655#true} #180#return; {655#true} is VALID [2020-07-10 15:04:10,507 INFO L263 TraceCheckUtils]: 0: Hoare triple {655#true} call ULTIMATE.init(); {655#true} is VALID [2020-07-10 15:04:10,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {655#true} assume true; {655#true} is VALID [2020-07-10 15:04:10,508 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {655#true} {655#true} #180#return; {655#true} is VALID [2020-07-10 15:04:10,508 INFO L263 TraceCheckUtils]: 3: Hoare triple {655#true} call #t~ret10 := main(); {655#true} is VALID [2020-07-10 15:04:10,509 INFO L280 TraceCheckUtils]: 4: Hoare triple {655#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {655#true} is VALID [2020-07-10 15:04:10,509 INFO L280 TraceCheckUtils]: 5: Hoare triple {655#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {655#true} is VALID [2020-07-10 15:04:10,509 INFO L280 TraceCheckUtils]: 6: Hoare triple {655#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {655#true} is VALID [2020-07-10 15:04:10,511 INFO L280 TraceCheckUtils]: 7: Hoare triple {655#true} assume 0 != ~p1~0;~lk1~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:10,512 INFO L280 TraceCheckUtils]: 8: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:10,513 INFO L280 TraceCheckUtils]: 9: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:10,514 INFO L280 TraceCheckUtils]: 10: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:10,515 INFO L280 TraceCheckUtils]: 11: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:10,516 INFO L280 TraceCheckUtils]: 12: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:10,517 INFO L280 TraceCheckUtils]: 13: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p7~0;~lk7~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:10,518 INFO L280 TraceCheckUtils]: 14: Hoare triple {659#(not (= 0 main_~p1~0))} assume !(0 != ~p8~0); {659#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:10,519 INFO L280 TraceCheckUtils]: 15: Hoare triple {659#(not (= 0 main_~p1~0))} assume 0 != ~p9~0;~lk9~0 := 1; {659#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:10,521 INFO L280 TraceCheckUtils]: 16: Hoare triple {659#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {656#false} is VALID [2020-07-10 15:04:10,521 INFO L280 TraceCheckUtils]: 17: Hoare triple {656#false} assume 0 != ~p2~0; {656#false} is VALID [2020-07-10 15:04:10,521 INFO L280 TraceCheckUtils]: 18: Hoare triple {656#false} assume 1 != ~lk2~0; {656#false} is VALID [2020-07-10 15:04:10,522 INFO L280 TraceCheckUtils]: 19: Hoare triple {656#false} assume !false; {656#false} is VALID [2020-07-10 15:04:10,523 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-10 15:04:10,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640399900] [2020-07-10 15:04:10,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:10,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:10,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215124918] [2020-07-10 15:04:10,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:10,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:10,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:10,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:10,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:10,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:10,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:10,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:10,555 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2020-07-10 15:04:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,693 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2020-07-10 15:04:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:10,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-10 15:04:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-10 15:04:10,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-10 15:04:10,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:10,906 INFO L225 Difference]: With dead ends: 99 [2020-07-10 15:04:10,906 INFO L226 Difference]: Without dead ends: 69 [2020-07-10 15:04:10,907 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-10 15:04:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-10 15:04:10,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2020-07-10 15:04:10,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:10,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2020-07-10 15:04:10,922 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2020-07-10 15:04:10,922 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2020-07-10 15:04:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,926 INFO L93 Difference]: Finished difference Result 69 states and 116 transitions. [2020-07-10 15:04:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 116 transitions. [2020-07-10 15:04:10,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:10,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:10,927 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2020-07-10 15:04:10,927 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2020-07-10 15:04:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,932 INFO L93 Difference]: Finished difference Result 69 states and 116 transitions. [2020-07-10 15:04:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 116 transitions. [2020-07-10 15:04:10,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:10,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:10,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:10,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-10 15:04:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2020-07-10 15:04:10,937 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2020-07-10 15:04:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:10,937 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2020-07-10 15:04:10,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2020-07-10 15:04:10,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:04:10,938 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:10,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] [2020-07-10 15:04:10,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:04:10,939 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:10,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:10,939 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2020-07-10 15:04:10,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:10,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790077051] [2020-07-10 15:04:10,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:10,983 INFO L280 TraceCheckUtils]: 0: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:04:10,984 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {985#true} {985#true} #180#return; {985#true} is VALID [2020-07-10 15:04:10,984 INFO L263 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2020-07-10 15:04:10,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:04:10,985 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {985#true} {985#true} #180#return; {985#true} is VALID [2020-07-10 15:04:10,985 INFO L263 TraceCheckUtils]: 3: Hoare triple {985#true} call #t~ret10 := main(); {985#true} is VALID [2020-07-10 15:04:10,985 INFO L280 TraceCheckUtils]: 4: Hoare triple {985#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {985#true} is VALID [2020-07-10 15:04:10,986 INFO L280 TraceCheckUtils]: 5: Hoare triple {985#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {985#true} is VALID [2020-07-10 15:04:10,986 INFO L280 TraceCheckUtils]: 6: Hoare triple {985#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {985#true} is VALID [2020-07-10 15:04:10,986 INFO L280 TraceCheckUtils]: 7: Hoare triple {985#true} assume !(0 != ~p1~0); {985#true} is VALID [2020-07-10 15:04:10,987 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#true} assume 0 != ~p2~0;~lk2~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:10,988 INFO L280 TraceCheckUtils]: 9: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:10,989 INFO L280 TraceCheckUtils]: 10: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:10,990 INFO L280 TraceCheckUtils]: 11: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:10,990 INFO L280 TraceCheckUtils]: 12: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:10,991 INFO L280 TraceCheckUtils]: 13: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:10,992 INFO L280 TraceCheckUtils]: 14: Hoare triple {989#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {989#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:10,993 INFO L280 TraceCheckUtils]: 15: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {989#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:10,993 INFO L280 TraceCheckUtils]: 16: Hoare triple {989#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {989#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:10,994 INFO L280 TraceCheckUtils]: 17: Hoare triple {989#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {989#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:10,995 INFO L280 TraceCheckUtils]: 18: Hoare triple {989#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {986#false} is VALID [2020-07-10 15:04:10,995 INFO L280 TraceCheckUtils]: 19: Hoare triple {986#false} assume !false; {986#false} is VALID [2020-07-10 15:04:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:10,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790077051] [2020-07-10 15:04:10,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:10,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:10,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263190202] [2020-07-10 15:04:10,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:10,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:10,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:11,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:11,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:11,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:11,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:11,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:11,022 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2020-07-10 15:04:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:11,142 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2020-07-10 15:04:11,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:11,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-10 15:04:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-10 15:04:11,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2020-07-10 15:04:11,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:11,283 INFO L225 Difference]: With dead ends: 124 [2020-07-10 15:04:11,283 INFO L226 Difference]: Without dead ends: 122 [2020-07-10 15:04:11,284 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-10 15:04:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-10 15:04:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2020-07-10 15:04:11,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:11,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 88 states. [2020-07-10 15:04:11,302 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 88 states. [2020-07-10 15:04:11,302 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 88 states. [2020-07-10 15:04:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:11,308 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2020-07-10 15:04:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 213 transitions. [2020-07-10 15:04:11,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:11,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:11,309 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 122 states. [2020-07-10 15:04:11,310 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 122 states. [2020-07-10 15:04:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:11,316 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2020-07-10 15:04:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 213 transitions. [2020-07-10 15:04:11,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:11,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:11,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:11,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-10 15:04:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2020-07-10 15:04:11,322 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2020-07-10 15:04:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:11,322 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2020-07-10 15:04:11,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2020-07-10 15:04:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:04:11,323 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:11,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:11,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:04:11,324 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:11,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2020-07-10 15:04:11,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:11,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504538490] [2020-07-10 15:04:11,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:11,392 INFO L280 TraceCheckUtils]: 0: Hoare triple {1468#true} assume true; {1468#true} is VALID [2020-07-10 15:04:11,393 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1468#true} {1468#true} #180#return; {1468#true} is VALID [2020-07-10 15:04:11,395 INFO L263 TraceCheckUtils]: 0: Hoare triple {1468#true} call ULTIMATE.init(); {1468#true} is VALID [2020-07-10 15:04:11,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {1468#true} assume true; {1468#true} is VALID [2020-07-10 15:04:11,399 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1468#true} {1468#true} #180#return; {1468#true} is VALID [2020-07-10 15:04:11,399 INFO L263 TraceCheckUtils]: 3: Hoare triple {1468#true} call #t~ret10 := main(); {1468#true} is VALID [2020-07-10 15:04:11,399 INFO L280 TraceCheckUtils]: 4: Hoare triple {1468#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {1468#true} is VALID [2020-07-10 15:04:11,400 INFO L280 TraceCheckUtils]: 5: Hoare triple {1468#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {1468#true} is VALID [2020-07-10 15:04:11,400 INFO L280 TraceCheckUtils]: 6: Hoare triple {1468#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {1468#true} is VALID [2020-07-10 15:04:11,400 INFO L280 TraceCheckUtils]: 7: Hoare triple {1468#true} assume !(0 != ~p1~0); {1468#true} is VALID [2020-07-10 15:04:11,404 INFO L280 TraceCheckUtils]: 8: Hoare triple {1468#true} assume !(0 != ~p2~0); {1472#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:11,405 INFO L280 TraceCheckUtils]: 9: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1472#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:11,405 INFO L280 TraceCheckUtils]: 10: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1472#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:11,406 INFO L280 TraceCheckUtils]: 11: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1472#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:11,407 INFO L280 TraceCheckUtils]: 12: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1472#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:11,408 INFO L280 TraceCheckUtils]: 13: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1472#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:11,408 INFO L280 TraceCheckUtils]: 14: Hoare triple {1472#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {1472#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:11,409 INFO L280 TraceCheckUtils]: 15: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1472#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:11,414 INFO L280 TraceCheckUtils]: 16: Hoare triple {1472#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1472#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:11,415 INFO L280 TraceCheckUtils]: 17: Hoare triple {1472#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1469#false} is VALID [2020-07-10 15:04:11,415 INFO L280 TraceCheckUtils]: 18: Hoare triple {1469#false} assume 1 != ~lk2~0; {1469#false} is VALID [2020-07-10 15:04:11,418 INFO L280 TraceCheckUtils]: 19: Hoare triple {1469#false} assume !false; {1469#false} is VALID [2020-07-10 15:04:11,419 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-10 15:04:11,419 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504538490] [2020-07-10 15:04:11,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:11,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:11,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644927497] [2020-07-10 15:04:11,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:11,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:11,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:11,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:11,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:11,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:11,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:11,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:11,441 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2020-07-10 15:04:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:11,581 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2020-07-10 15:04:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:11,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2020-07-10 15:04:11,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2020-07-10 15:04:11,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2020-07-10 15:04:11,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:11,765 INFO L225 Difference]: With dead ends: 204 [2020-07-10 15:04:11,765 INFO L226 Difference]: Without dead ends: 124 [2020-07-10 15:04:11,766 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-10 15:04:11,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-07-10 15:04:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2020-07-10 15:04:11,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:11,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 122 states. [2020-07-10 15:04:11,803 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 122 states. [2020-07-10 15:04:11,804 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 122 states. [2020-07-10 15:04:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:11,809 INFO L93 Difference]: Finished difference Result 124 states and 211 transitions. [2020-07-10 15:04:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 211 transitions. [2020-07-10 15:04:11,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:11,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:11,810 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 124 states. [2020-07-10 15:04:11,810 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 124 states. [2020-07-10 15:04:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:11,815 INFO L93 Difference]: Finished difference Result 124 states and 211 transitions. [2020-07-10 15:04:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 211 transitions. [2020-07-10 15:04:11,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:11,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:11,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:11,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-10 15:04:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2020-07-10 15:04:11,821 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2020-07-10 15:04:11,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:11,822 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2020-07-10 15:04:11,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2020-07-10 15:04:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:04:11,823 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:11,823 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-10 15:04:11,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:04:11,823 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:11,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:11,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2020-07-10 15:04:11,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:11,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709591320] [2020-07-10 15:04:11,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:11,861 INFO L280 TraceCheckUtils]: 0: Hoare triple {2073#true} assume true; {2073#true} is VALID [2020-07-10 15:04:11,861 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2073#true} {2073#true} #180#return; {2073#true} is VALID [2020-07-10 15:04:11,862 INFO L263 TraceCheckUtils]: 0: Hoare triple {2073#true} call ULTIMATE.init(); {2073#true} is VALID [2020-07-10 15:04:11,862 INFO L280 TraceCheckUtils]: 1: Hoare triple {2073#true} assume true; {2073#true} is VALID [2020-07-10 15:04:11,862 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2073#true} {2073#true} #180#return; {2073#true} is VALID [2020-07-10 15:04:11,862 INFO L263 TraceCheckUtils]: 3: Hoare triple {2073#true} call #t~ret10 := main(); {2073#true} is VALID [2020-07-10 15:04:11,863 INFO L280 TraceCheckUtils]: 4: Hoare triple {2073#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {2073#true} is VALID [2020-07-10 15:04:11,863 INFO L280 TraceCheckUtils]: 5: Hoare triple {2073#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2073#true} is VALID [2020-07-10 15:04:11,863 INFO L280 TraceCheckUtils]: 6: Hoare triple {2073#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {2073#true} is VALID [2020-07-10 15:04:11,863 INFO L280 TraceCheckUtils]: 7: Hoare triple {2073#true} assume !(0 != ~p1~0); {2073#true} is VALID [2020-07-10 15:04:11,864 INFO L280 TraceCheckUtils]: 8: Hoare triple {2073#true} assume 0 != ~p2~0;~lk2~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:11,865 INFO L280 TraceCheckUtils]: 9: Hoare triple {2077#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:11,866 INFO L280 TraceCheckUtils]: 10: Hoare triple {2077#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:11,866 INFO L280 TraceCheckUtils]: 11: Hoare triple {2077#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:11,867 INFO L280 TraceCheckUtils]: 12: Hoare triple {2077#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:11,868 INFO L280 TraceCheckUtils]: 13: Hoare triple {2077#(not (= 0 main_~p2~0))} assume 0 != ~p7~0;~lk7~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:11,868 INFO L280 TraceCheckUtils]: 14: Hoare triple {2077#(not (= 0 main_~p2~0))} assume !(0 != ~p8~0); {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:11,869 INFO L280 TraceCheckUtils]: 15: Hoare triple {2077#(not (= 0 main_~p2~0))} assume 0 != ~p9~0;~lk9~0 := 1; {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:11,869 INFO L280 TraceCheckUtils]: 16: Hoare triple {2077#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {2077#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:11,870 INFO L280 TraceCheckUtils]: 17: Hoare triple {2077#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {2074#false} is VALID [2020-07-10 15:04:11,870 INFO L280 TraceCheckUtils]: 18: Hoare triple {2074#false} assume 0 != ~p3~0; {2074#false} is VALID [2020-07-10 15:04:11,871 INFO L280 TraceCheckUtils]: 19: Hoare triple {2074#false} assume 1 != ~lk3~0; {2074#false} is VALID [2020-07-10 15:04:11,871 INFO L280 TraceCheckUtils]: 20: Hoare triple {2074#false} assume !false; {2074#false} is VALID [2020-07-10 15:04:11,872 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-10 15:04:11,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709591320] [2020-07-10 15:04:11,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:11,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:11,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231578628] [2020-07-10 15:04:11,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:11,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:11,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:11,896 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-10 15:04:11,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:11,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:11,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:11,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:11,897 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2020-07-10 15:04:12,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:12,031 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2020-07-10 15:04:12,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:12,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:12,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2020-07-10 15:04:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2020-07-10 15:04:12,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 165 transitions. [2020-07-10 15:04:12,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:12,231 INFO L225 Difference]: With dead ends: 183 [2020-07-10 15:04:12,232 INFO L226 Difference]: Without dead ends: 126 [2020-07-10 15:04:12,234 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-10 15:04:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-07-10 15:04:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2020-07-10 15:04:12,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:12,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 124 states. [2020-07-10 15:04:12,269 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 124 states. [2020-07-10 15:04:12,269 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 124 states. [2020-07-10 15:04:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:12,281 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2020-07-10 15:04:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 211 transitions. [2020-07-10 15:04:12,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:12,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:12,282 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 126 states. [2020-07-10 15:04:12,282 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 126 states. [2020-07-10 15:04:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:12,289 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2020-07-10 15:04:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 211 transitions. [2020-07-10 15:04:12,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:12,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:12,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:12,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-07-10 15:04:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2020-07-10 15:04:12,296 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2020-07-10 15:04:12,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:12,296 INFO L479 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2020-07-10 15:04:12,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2020-07-10 15:04:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:04:12,298 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:12,298 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-10 15:04:12,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:04:12,298 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:12,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:12,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2020-07-10 15:04:12,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:12,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384175722] [2020-07-10 15:04:12,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:12,382 INFO L280 TraceCheckUtils]: 0: Hoare triple {2663#true} assume true; {2663#true} is VALID [2020-07-10 15:04:12,382 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2663#true} {2663#true} #180#return; {2663#true} is VALID [2020-07-10 15:04:12,383 INFO L263 TraceCheckUtils]: 0: Hoare triple {2663#true} call ULTIMATE.init(); {2663#true} is VALID [2020-07-10 15:04:12,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {2663#true} assume true; {2663#true} is VALID [2020-07-10 15:04:12,383 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2663#true} {2663#true} #180#return; {2663#true} is VALID [2020-07-10 15:04:12,383 INFO L263 TraceCheckUtils]: 3: Hoare triple {2663#true} call #t~ret10 := main(); {2663#true} is VALID [2020-07-10 15:04:12,384 INFO L280 TraceCheckUtils]: 4: Hoare triple {2663#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {2663#true} is VALID [2020-07-10 15:04:12,384 INFO L280 TraceCheckUtils]: 5: Hoare triple {2663#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2663#true} is VALID [2020-07-10 15:04:12,384 INFO L280 TraceCheckUtils]: 6: Hoare triple {2663#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {2663#true} is VALID [2020-07-10 15:04:12,384 INFO L280 TraceCheckUtils]: 7: Hoare triple {2663#true} assume !(0 != ~p1~0); {2663#true} is VALID [2020-07-10 15:04:12,384 INFO L280 TraceCheckUtils]: 8: Hoare triple {2663#true} assume !(0 != ~p2~0); {2663#true} is VALID [2020-07-10 15:04:12,386 INFO L280 TraceCheckUtils]: 9: Hoare triple {2663#true} assume 0 != ~p3~0;~lk3~0 := 1; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:12,387 INFO L280 TraceCheckUtils]: 10: Hoare triple {2667#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:12,388 INFO L280 TraceCheckUtils]: 11: Hoare triple {2667#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:12,389 INFO L280 TraceCheckUtils]: 12: Hoare triple {2667#(= 1 main_~lk3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:12,389 INFO L280 TraceCheckUtils]: 13: Hoare triple {2667#(= 1 main_~lk3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:12,391 INFO L280 TraceCheckUtils]: 14: Hoare triple {2667#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {2667#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:12,392 INFO L280 TraceCheckUtils]: 15: Hoare triple {2667#(= 1 main_~lk3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:12,392 INFO L280 TraceCheckUtils]: 16: Hoare triple {2667#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {2667#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:12,393 INFO L280 TraceCheckUtils]: 17: Hoare triple {2667#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {2667#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:12,394 INFO L280 TraceCheckUtils]: 18: Hoare triple {2667#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {2667#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:12,394 INFO L280 TraceCheckUtils]: 19: Hoare triple {2667#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {2664#false} is VALID [2020-07-10 15:04:12,394 INFO L280 TraceCheckUtils]: 20: Hoare triple {2664#false} assume !false; {2664#false} is VALID [2020-07-10 15:04:12,395 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-10 15:04:12,396 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384175722] [2020-07-10 15:04:12,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:12,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:12,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578829148] [2020-07-10 15:04:12,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:12,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:12,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:12,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-10 15:04:12,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:12,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:12,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:12,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:12,426 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2020-07-10 15:04:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:12,543 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2020-07-10 15:04:12,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:12,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-10 15:04:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-10 15:04:12,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-10 15:04:12,668 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-10 15:04:12,674 INFO L225 Difference]: With dead ends: 228 [2020-07-10 15:04:12,675 INFO L226 Difference]: Without dead ends: 226 [2020-07-10 15:04:12,675 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-10 15:04:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-07-10 15:04:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2020-07-10 15:04:12,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:12,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand 168 states. [2020-07-10 15:04:12,694 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 168 states. [2020-07-10 15:04:12,695 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 168 states. [2020-07-10 15:04:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:12,704 INFO L93 Difference]: Finished difference Result 226 states and 387 transitions. [2020-07-10 15:04:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 387 transitions. [2020-07-10 15:04:12,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:12,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:12,706 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 226 states. [2020-07-10 15:04:12,706 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 226 states. [2020-07-10 15:04:12,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:12,716 INFO L93 Difference]: Finished difference Result 226 states and 387 transitions. [2020-07-10 15:04:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 387 transitions. [2020-07-10 15:04:12,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:12,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:12,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:12,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-07-10 15:04:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2020-07-10 15:04:12,724 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2020-07-10 15:04:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:12,725 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2020-07-10 15:04:12,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2020-07-10 15:04:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:04:12,726 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:12,726 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-10 15:04:12,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:04:12,726 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:12,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:12,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2020-07-10 15:04:12,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:12,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766609219] [2020-07-10 15:04:12,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:12,759 INFO L280 TraceCheckUtils]: 0: Hoare triple {3544#true} assume true; {3544#true} is VALID [2020-07-10 15:04:12,760 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3544#true} {3544#true} #180#return; {3544#true} is VALID [2020-07-10 15:04:12,760 INFO L263 TraceCheckUtils]: 0: Hoare triple {3544#true} call ULTIMATE.init(); {3544#true} is VALID [2020-07-10 15:04:12,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {3544#true} assume true; {3544#true} is VALID [2020-07-10 15:04:12,760 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3544#true} {3544#true} #180#return; {3544#true} is VALID [2020-07-10 15:04:12,761 INFO L263 TraceCheckUtils]: 3: Hoare triple {3544#true} call #t~ret10 := main(); {3544#true} is VALID [2020-07-10 15:04:12,761 INFO L280 TraceCheckUtils]: 4: Hoare triple {3544#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {3544#true} is VALID [2020-07-10 15:04:12,761 INFO L280 TraceCheckUtils]: 5: Hoare triple {3544#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {3544#true} is VALID [2020-07-10 15:04:12,761 INFO L280 TraceCheckUtils]: 6: Hoare triple {3544#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {3544#true} is VALID [2020-07-10 15:04:12,762 INFO L280 TraceCheckUtils]: 7: Hoare triple {3544#true} assume !(0 != ~p1~0); {3544#true} is VALID [2020-07-10 15:04:12,762 INFO L280 TraceCheckUtils]: 8: Hoare triple {3544#true} assume !(0 != ~p2~0); {3544#true} is VALID [2020-07-10 15:04:12,763 INFO L280 TraceCheckUtils]: 9: Hoare triple {3544#true} assume !(0 != ~p3~0); {3548#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:12,763 INFO L280 TraceCheckUtils]: 10: Hoare triple {3548#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {3548#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:12,764 INFO L280 TraceCheckUtils]: 11: Hoare triple {3548#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {3548#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:12,765 INFO L280 TraceCheckUtils]: 12: Hoare triple {3548#(= 0 main_~p3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {3548#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:12,765 INFO L280 TraceCheckUtils]: 13: Hoare triple {3548#(= 0 main_~p3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {3548#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:12,766 INFO L280 TraceCheckUtils]: 14: Hoare triple {3548#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {3548#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:12,767 INFO L280 TraceCheckUtils]: 15: Hoare triple {3548#(= 0 main_~p3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {3548#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:12,767 INFO L280 TraceCheckUtils]: 16: Hoare triple {3548#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {3548#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:12,768 INFO L280 TraceCheckUtils]: 17: Hoare triple {3548#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {3548#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:12,769 INFO L280 TraceCheckUtils]: 18: Hoare triple {3548#(= 0 main_~p3~0)} assume 0 != ~p3~0; {3545#false} is VALID [2020-07-10 15:04:12,769 INFO L280 TraceCheckUtils]: 19: Hoare triple {3545#false} assume 1 != ~lk3~0; {3545#false} is VALID [2020-07-10 15:04:12,769 INFO L280 TraceCheckUtils]: 20: Hoare triple {3545#false} assume !false; {3545#false} is VALID [2020-07-10 15:04:12,770 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-10 15:04:12,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766609219] [2020-07-10 15:04:12,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:12,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:12,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714326581] [2020-07-10 15:04:12,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:12,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:12,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:12,798 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-10 15:04:12,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:12,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:12,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:12,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:12,799 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2020-07-10 15:04:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:12,951 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2020-07-10 15:04:12,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:12,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2020-07-10 15:04:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2020-07-10 15:04:12,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2020-07-10 15:04:13,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:13,117 INFO L225 Difference]: With dead ends: 392 [2020-07-10 15:04:13,118 INFO L226 Difference]: Without dead ends: 234 [2020-07-10 15:04:13,119 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-10 15:04:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-07-10 15:04:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2020-07-10 15:04:13,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:13,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 232 states. [2020-07-10 15:04:13,163 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 232 states. [2020-07-10 15:04:13,163 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 232 states. [2020-07-10 15:04:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:13,171 INFO L93 Difference]: Finished difference Result 234 states and 387 transitions. [2020-07-10 15:04:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 387 transitions. [2020-07-10 15:04:13,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:13,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:13,173 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 234 states. [2020-07-10 15:04:13,173 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 234 states. [2020-07-10 15:04:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:13,180 INFO L93 Difference]: Finished difference Result 234 states and 387 transitions. [2020-07-10 15:04:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 387 transitions. [2020-07-10 15:04:13,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:13,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:13,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:13,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-07-10 15:04:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2020-07-10 15:04:13,188 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2020-07-10 15:04:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:13,188 INFO L479 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2020-07-10 15:04:13,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2020-07-10 15:04:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:04:13,189 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:13,189 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-10 15:04:13,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 15:04:13,190 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:13,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:13,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2020-07-10 15:04:13,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:13,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670469156] [2020-07-10 15:04:13,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:13,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {4677#true} assume true; {4677#true} is VALID [2020-07-10 15:04:13,222 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4677#true} {4677#true} #180#return; {4677#true} is VALID [2020-07-10 15:04:13,222 INFO L263 TraceCheckUtils]: 0: Hoare triple {4677#true} call ULTIMATE.init(); {4677#true} is VALID [2020-07-10 15:04:13,222 INFO L280 TraceCheckUtils]: 1: Hoare triple {4677#true} assume true; {4677#true} is VALID [2020-07-10 15:04:13,223 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4677#true} {4677#true} #180#return; {4677#true} is VALID [2020-07-10 15:04:13,223 INFO L263 TraceCheckUtils]: 3: Hoare triple {4677#true} call #t~ret10 := main(); {4677#true} is VALID [2020-07-10 15:04:13,223 INFO L280 TraceCheckUtils]: 4: Hoare triple {4677#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {4677#true} is VALID [2020-07-10 15:04:13,223 INFO L280 TraceCheckUtils]: 5: Hoare triple {4677#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {4677#true} is VALID [2020-07-10 15:04:13,224 INFO L280 TraceCheckUtils]: 6: Hoare triple {4677#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {4677#true} is VALID [2020-07-10 15:04:13,224 INFO L280 TraceCheckUtils]: 7: Hoare triple {4677#true} assume !(0 != ~p1~0); {4677#true} is VALID [2020-07-10 15:04:13,224 INFO L280 TraceCheckUtils]: 8: Hoare triple {4677#true} assume !(0 != ~p2~0); {4677#true} is VALID [2020-07-10 15:04:13,225 INFO L280 TraceCheckUtils]: 9: Hoare triple {4677#true} assume 0 != ~p3~0;~lk3~0 := 1; {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:13,226 INFO L280 TraceCheckUtils]: 10: Hoare triple {4681#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:13,227 INFO L280 TraceCheckUtils]: 11: Hoare triple {4681#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:13,228 INFO L280 TraceCheckUtils]: 12: Hoare triple {4681#(not (= 0 main_~p3~0))} assume 0 != ~p6~0;~lk6~0 := 1; {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:13,228 INFO L280 TraceCheckUtils]: 13: Hoare triple {4681#(not (= 0 main_~p3~0))} assume 0 != ~p7~0;~lk7~0 := 1; {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:13,229 INFO L280 TraceCheckUtils]: 14: Hoare triple {4681#(not (= 0 main_~p3~0))} assume !(0 != ~p8~0); {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:13,230 INFO L280 TraceCheckUtils]: 15: Hoare triple {4681#(not (= 0 main_~p3~0))} assume 0 != ~p9~0;~lk9~0 := 1; {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:13,230 INFO L280 TraceCheckUtils]: 16: Hoare triple {4681#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:13,231 INFO L280 TraceCheckUtils]: 17: Hoare triple {4681#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {4681#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:13,232 INFO L280 TraceCheckUtils]: 18: Hoare triple {4681#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {4678#false} is VALID [2020-07-10 15:04:13,232 INFO L280 TraceCheckUtils]: 19: Hoare triple {4678#false} assume 0 != ~p4~0; {4678#false} is VALID [2020-07-10 15:04:13,232 INFO L280 TraceCheckUtils]: 20: Hoare triple {4678#false} assume 1 != ~lk4~0; {4678#false} is VALID [2020-07-10 15:04:13,233 INFO L280 TraceCheckUtils]: 21: Hoare triple {4678#false} assume !false; {4678#false} is VALID [2020-07-10 15:04:13,234 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-10 15:04:13,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670469156] [2020-07-10 15:04:13,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:13,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:13,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472076699] [2020-07-10 15:04:13,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:04:13,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:13,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:13,264 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-10 15:04:13,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:13,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:13,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:13,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:13,266 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2020-07-10 15:04:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:13,454 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2020-07-10 15:04:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:13,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:04:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-10 15:04:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-10 15:04:13,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2020-07-10 15:04:13,644 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-10 15:04:13,650 INFO L225 Difference]: With dead ends: 348 [2020-07-10 15:04:13,650 INFO L226 Difference]: Without dead ends: 238 [2020-07-10 15:04:13,651 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-10 15:04:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-10 15:04:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2020-07-10 15:04:13,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:13,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand 236 states. [2020-07-10 15:04:13,680 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 236 states. [2020-07-10 15:04:13,680 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 236 states. [2020-07-10 15:04:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:13,687 INFO L93 Difference]: Finished difference Result 238 states and 387 transitions. [2020-07-10 15:04:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 387 transitions. [2020-07-10 15:04:13,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:13,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:13,688 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 238 states. [2020-07-10 15:04:13,689 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 238 states. [2020-07-10 15:04:13,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:13,696 INFO L93 Difference]: Finished difference Result 238 states and 387 transitions. [2020-07-10 15:04:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 387 transitions. [2020-07-10 15:04:13,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:13,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:13,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:13,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-07-10 15:04:13,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2020-07-10 15:04:13,703 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2020-07-10 15:04:13,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:13,704 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2020-07-10 15:04:13,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2020-07-10 15:04:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:04:13,705 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:13,705 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-10 15:04:13,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 15:04:13,705 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:13,706 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2020-07-10 15:04:13,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:13,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686625546] [2020-07-10 15:04:13,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:13,734 INFO L280 TraceCheckUtils]: 0: Hoare triple {5778#true} assume true; {5778#true} is VALID [2020-07-10 15:04:13,735 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5778#true} {5778#true} #180#return; {5778#true} is VALID [2020-07-10 15:04:13,735 INFO L263 TraceCheckUtils]: 0: Hoare triple {5778#true} call ULTIMATE.init(); {5778#true} is VALID [2020-07-10 15:04:13,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {5778#true} assume true; {5778#true} is VALID [2020-07-10 15:04:13,736 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5778#true} {5778#true} #180#return; {5778#true} is VALID [2020-07-10 15:04:13,736 INFO L263 TraceCheckUtils]: 3: Hoare triple {5778#true} call #t~ret10 := main(); {5778#true} is VALID [2020-07-10 15:04:13,736 INFO L280 TraceCheckUtils]: 4: Hoare triple {5778#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {5778#true} is VALID [2020-07-10 15:04:13,736 INFO L280 TraceCheckUtils]: 5: Hoare triple {5778#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {5778#true} is VALID [2020-07-10 15:04:13,737 INFO L280 TraceCheckUtils]: 6: Hoare triple {5778#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {5778#true} is VALID [2020-07-10 15:04:13,737 INFO L280 TraceCheckUtils]: 7: Hoare triple {5778#true} assume !(0 != ~p1~0); {5778#true} is VALID [2020-07-10 15:04:13,737 INFO L280 TraceCheckUtils]: 8: Hoare triple {5778#true} assume !(0 != ~p2~0); {5778#true} is VALID [2020-07-10 15:04:13,737 INFO L280 TraceCheckUtils]: 9: Hoare triple {5778#true} assume !(0 != ~p3~0); {5778#true} is VALID [2020-07-10 15:04:13,738 INFO L280 TraceCheckUtils]: 10: Hoare triple {5778#true} assume 0 != ~p4~0;~lk4~0 := 1; {5782#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:13,739 INFO L280 TraceCheckUtils]: 11: Hoare triple {5782#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {5782#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:13,739 INFO L280 TraceCheckUtils]: 12: Hoare triple {5782#(= 1 main_~lk4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {5782#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:13,740 INFO L280 TraceCheckUtils]: 13: Hoare triple {5782#(= 1 main_~lk4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {5782#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:13,741 INFO L280 TraceCheckUtils]: 14: Hoare triple {5782#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {5782#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:13,741 INFO L280 TraceCheckUtils]: 15: Hoare triple {5782#(= 1 main_~lk4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {5782#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:13,742 INFO L280 TraceCheckUtils]: 16: Hoare triple {5782#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {5782#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:13,742 INFO L280 TraceCheckUtils]: 17: Hoare triple {5782#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {5782#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:13,743 INFO L280 TraceCheckUtils]: 18: Hoare triple {5782#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {5782#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:13,744 INFO L280 TraceCheckUtils]: 19: Hoare triple {5782#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {5782#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:13,744 INFO L280 TraceCheckUtils]: 20: Hoare triple {5782#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {5779#false} is VALID [2020-07-10 15:04:13,745 INFO L280 TraceCheckUtils]: 21: Hoare triple {5779#false} assume !false; {5779#false} is VALID [2020-07-10 15:04:13,745 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-10 15:04:13,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686625546] [2020-07-10 15:04:13,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:13,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:13,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135126826] [2020-07-10 15:04:13,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:04:13,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:13,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:13,767 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-10 15:04:13,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:13,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:13,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:13,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:13,768 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2020-07-10 15:04:13,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:13,921 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2020-07-10 15:04:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:13,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:04:13,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:13,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-10 15:04:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:13,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-10 15:04:13,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2020-07-10 15:04:14,028 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-10 15:04:14,043 INFO L225 Difference]: With dead ends: 428 [2020-07-10 15:04:14,043 INFO L226 Difference]: Without dead ends: 426 [2020-07-10 15:04:14,044 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-10 15:04:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-07-10 15:04:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2020-07-10 15:04:14,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:14,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 426 states. Second operand 328 states. [2020-07-10 15:04:14,078 INFO L74 IsIncluded]: Start isIncluded. First operand 426 states. Second operand 328 states. [2020-07-10 15:04:14,078 INFO L87 Difference]: Start difference. First operand 426 states. Second operand 328 states. [2020-07-10 15:04:14,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:14,093 INFO L93 Difference]: Finished difference Result 426 states and 703 transitions. [2020-07-10 15:04:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 703 transitions. [2020-07-10 15:04:14,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:14,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:14,094 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand 426 states. [2020-07-10 15:04:14,095 INFO L87 Difference]: Start difference. First operand 328 states. Second operand 426 states. [2020-07-10 15:04:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:14,111 INFO L93 Difference]: Finished difference Result 426 states and 703 transitions. [2020-07-10 15:04:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 703 transitions. [2020-07-10 15:04:14,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:14,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:14,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:14,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-07-10 15:04:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2020-07-10 15:04:14,123 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2020-07-10 15:04:14,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:14,124 INFO L479 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2020-07-10 15:04:14,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2020-07-10 15:04:14,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:04:14,125 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:14,125 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-10 15:04:14,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 15:04:14,125 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:14,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2020-07-10 15:04:14,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:14,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905731274] [2020-07-10 15:04:14,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:14,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {7431#true} assume true; {7431#true} is VALID [2020-07-10 15:04:14,153 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7431#true} {7431#true} #180#return; {7431#true} is VALID [2020-07-10 15:04:14,153 INFO L263 TraceCheckUtils]: 0: Hoare triple {7431#true} call ULTIMATE.init(); {7431#true} is VALID [2020-07-10 15:04:14,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {7431#true} assume true; {7431#true} is VALID [2020-07-10 15:04:14,154 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7431#true} {7431#true} #180#return; {7431#true} is VALID [2020-07-10 15:04:14,154 INFO L263 TraceCheckUtils]: 3: Hoare triple {7431#true} call #t~ret10 := main(); {7431#true} is VALID [2020-07-10 15:04:14,154 INFO L280 TraceCheckUtils]: 4: Hoare triple {7431#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {7431#true} is VALID [2020-07-10 15:04:14,154 INFO L280 TraceCheckUtils]: 5: Hoare triple {7431#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {7431#true} is VALID [2020-07-10 15:04:14,154 INFO L280 TraceCheckUtils]: 6: Hoare triple {7431#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {7431#true} is VALID [2020-07-10 15:04:14,155 INFO L280 TraceCheckUtils]: 7: Hoare triple {7431#true} assume !(0 != ~p1~0); {7431#true} is VALID [2020-07-10 15:04:14,155 INFO L280 TraceCheckUtils]: 8: Hoare triple {7431#true} assume !(0 != ~p2~0); {7431#true} is VALID [2020-07-10 15:04:14,155 INFO L280 TraceCheckUtils]: 9: Hoare triple {7431#true} assume !(0 != ~p3~0); {7431#true} is VALID [2020-07-10 15:04:14,156 INFO L280 TraceCheckUtils]: 10: Hoare triple {7431#true} assume !(0 != ~p4~0); {7435#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:14,157 INFO L280 TraceCheckUtils]: 11: Hoare triple {7435#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {7435#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:14,157 INFO L280 TraceCheckUtils]: 12: Hoare triple {7435#(= 0 main_~p4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {7435#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:14,158 INFO L280 TraceCheckUtils]: 13: Hoare triple {7435#(= 0 main_~p4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {7435#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:14,158 INFO L280 TraceCheckUtils]: 14: Hoare triple {7435#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {7435#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:14,159 INFO L280 TraceCheckUtils]: 15: Hoare triple {7435#(= 0 main_~p4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {7435#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:14,160 INFO L280 TraceCheckUtils]: 16: Hoare triple {7435#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {7435#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:14,160 INFO L280 TraceCheckUtils]: 17: Hoare triple {7435#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {7435#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:14,161 INFO L280 TraceCheckUtils]: 18: Hoare triple {7435#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {7435#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:14,161 INFO L280 TraceCheckUtils]: 19: Hoare triple {7435#(= 0 main_~p4~0)} assume 0 != ~p4~0; {7432#false} is VALID [2020-07-10 15:04:14,162 INFO L280 TraceCheckUtils]: 20: Hoare triple {7432#false} assume 1 != ~lk4~0; {7432#false} is VALID [2020-07-10 15:04:14,162 INFO L280 TraceCheckUtils]: 21: Hoare triple {7432#false} assume !false; {7432#false} is VALID [2020-07-10 15:04:14,163 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-10 15:04:14,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905731274] [2020-07-10 15:04:14,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:14,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:14,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475570203] [2020-07-10 15:04:14,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:04:14,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:14,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:14,189 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-10 15:04:14,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:14,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:14,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:14,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:14,190 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2020-07-10 15:04:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:14,416 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2020-07-10 15:04:14,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:14,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:04:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-10 15:04:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-10 15:04:14,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2020-07-10 15:04:14,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:14,595 INFO L225 Difference]: With dead ends: 764 [2020-07-10 15:04:14,596 INFO L226 Difference]: Without dead ends: 450 [2020-07-10 15:04:14,597 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-10 15:04:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-07-10 15:04:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2020-07-10 15:04:14,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:14,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 450 states. Second operand 448 states. [2020-07-10 15:04:14,668 INFO L74 IsIncluded]: Start isIncluded. First operand 450 states. Second operand 448 states. [2020-07-10 15:04:14,668 INFO L87 Difference]: Start difference. First operand 450 states. Second operand 448 states. [2020-07-10 15:04:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:14,688 INFO L93 Difference]: Finished difference Result 450 states and 711 transitions. [2020-07-10 15:04:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 711 transitions. [2020-07-10 15:04:14,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:14,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:14,690 INFO L74 IsIncluded]: Start isIncluded. First operand 448 states. Second operand 450 states. [2020-07-10 15:04:14,690 INFO L87 Difference]: Start difference. First operand 448 states. Second operand 450 states. [2020-07-10 15:04:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:14,707 INFO L93 Difference]: Finished difference Result 450 states and 711 transitions. [2020-07-10 15:04:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 711 transitions. [2020-07-10 15:04:14,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:14,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:14,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:14,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-07-10 15:04:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2020-07-10 15:04:14,726 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2020-07-10 15:04:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:14,726 INFO L479 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2020-07-10 15:04:14,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2020-07-10 15:04:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:04:14,727 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:14,727 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-10 15:04:14,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 15:04:14,728 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:14,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2020-07-10 15:04:14,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:14,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729391373] [2020-07-10 15:04:14,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:14,786 INFO L280 TraceCheckUtils]: 0: Hoare triple {9604#true} assume true; {9604#true} is VALID [2020-07-10 15:04:14,786 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9604#true} {9604#true} #180#return; {9604#true} is VALID [2020-07-10 15:04:14,786 INFO L263 TraceCheckUtils]: 0: Hoare triple {9604#true} call ULTIMATE.init(); {9604#true} is VALID [2020-07-10 15:04:14,787 INFO L280 TraceCheckUtils]: 1: Hoare triple {9604#true} assume true; {9604#true} is VALID [2020-07-10 15:04:14,787 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9604#true} {9604#true} #180#return; {9604#true} is VALID [2020-07-10 15:04:14,787 INFO L263 TraceCheckUtils]: 3: Hoare triple {9604#true} call #t~ret10 := main(); {9604#true} is VALID [2020-07-10 15:04:14,787 INFO L280 TraceCheckUtils]: 4: Hoare triple {9604#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {9604#true} is VALID [2020-07-10 15:04:14,787 INFO L280 TraceCheckUtils]: 5: Hoare triple {9604#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {9604#true} is VALID [2020-07-10 15:04:14,788 INFO L280 TraceCheckUtils]: 6: Hoare triple {9604#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {9604#true} is VALID [2020-07-10 15:04:14,788 INFO L280 TraceCheckUtils]: 7: Hoare triple {9604#true} assume !(0 != ~p1~0); {9604#true} is VALID [2020-07-10 15:04:14,788 INFO L280 TraceCheckUtils]: 8: Hoare triple {9604#true} assume !(0 != ~p2~0); {9604#true} is VALID [2020-07-10 15:04:14,792 INFO L280 TraceCheckUtils]: 9: Hoare triple {9604#true} assume !(0 != ~p3~0); {9604#true} is VALID [2020-07-10 15:04:14,795 INFO L280 TraceCheckUtils]: 10: Hoare triple {9604#true} assume 0 != ~p4~0;~lk4~0 := 1; {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:14,796 INFO L280 TraceCheckUtils]: 11: Hoare triple {9608#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:14,797 INFO L280 TraceCheckUtils]: 12: Hoare triple {9608#(not (= 0 main_~p4~0))} assume 0 != ~p6~0;~lk6~0 := 1; {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:14,797 INFO L280 TraceCheckUtils]: 13: Hoare triple {9608#(not (= 0 main_~p4~0))} assume 0 != ~p7~0;~lk7~0 := 1; {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:14,798 INFO L280 TraceCheckUtils]: 14: Hoare triple {9608#(not (= 0 main_~p4~0))} assume !(0 != ~p8~0); {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:14,799 INFO L280 TraceCheckUtils]: 15: Hoare triple {9608#(not (= 0 main_~p4~0))} assume 0 != ~p9~0;~lk9~0 := 1; {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:14,799 INFO L280 TraceCheckUtils]: 16: Hoare triple {9608#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:14,800 INFO L280 TraceCheckUtils]: 17: Hoare triple {9608#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:14,800 INFO L280 TraceCheckUtils]: 18: Hoare triple {9608#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {9608#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:14,801 INFO L280 TraceCheckUtils]: 19: Hoare triple {9608#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {9605#false} is VALID [2020-07-10 15:04:14,801 INFO L280 TraceCheckUtils]: 20: Hoare triple {9605#false} assume 0 != ~p5~0; {9605#false} is VALID [2020-07-10 15:04:14,802 INFO L280 TraceCheckUtils]: 21: Hoare triple {9605#false} assume 1 != ~lk5~0; {9605#false} is VALID [2020-07-10 15:04:14,802 INFO L280 TraceCheckUtils]: 22: Hoare triple {9605#false} assume !false; {9605#false} is VALID [2020-07-10 15:04:14,803 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-10 15:04:14,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729391373] [2020-07-10 15:04:14,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:14,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:14,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962305325] [2020-07-10 15:04:14,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:04:14,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:14,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:14,828 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-10 15:04:14,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:14,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:14,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:14,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:14,829 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2020-07-10 15:04:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:15,033 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2020-07-10 15:04:15,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:15,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:04:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-07-10 15:04:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-07-10 15:04:15,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 159 transitions. [2020-07-10 15:04:15,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:15,203 INFO L225 Difference]: With dead ends: 672 [2020-07-10 15:04:15,204 INFO L226 Difference]: Without dead ends: 458 [2020-07-10 15:04:15,205 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-10 15:04:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-07-10 15:04:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2020-07-10 15:04:15,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:15,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 458 states. Second operand 456 states. [2020-07-10 15:04:15,274 INFO L74 IsIncluded]: Start isIncluded. First operand 458 states. Second operand 456 states. [2020-07-10 15:04:15,274 INFO L87 Difference]: Start difference. First operand 458 states. Second operand 456 states. [2020-07-10 15:04:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:15,293 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2020-07-10 15:04:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 711 transitions. [2020-07-10 15:04:15,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:15,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:15,294 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand 458 states. [2020-07-10 15:04:15,295 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 458 states. [2020-07-10 15:04:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:15,313 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2020-07-10 15:04:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 711 transitions. [2020-07-10 15:04:15,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:15,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:15,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:15,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-07-10 15:04:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2020-07-10 15:04:15,335 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2020-07-10 15:04:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:15,335 INFO L479 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2020-07-10 15:04:15,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2020-07-10 15:04:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:04:15,342 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:15,343 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-10 15:04:15,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 15:04:15,343 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:15,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:15,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2020-07-10 15:04:15,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:15,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177967336] [2020-07-10 15:04:15,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:15,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {11709#true} assume true; {11709#true} is VALID [2020-07-10 15:04:15,400 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {11709#true} {11709#true} #180#return; {11709#true} is VALID [2020-07-10 15:04:15,401 INFO L263 TraceCheckUtils]: 0: Hoare triple {11709#true} call ULTIMATE.init(); {11709#true} is VALID [2020-07-10 15:04:15,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {11709#true} assume true; {11709#true} is VALID [2020-07-10 15:04:15,401 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11709#true} {11709#true} #180#return; {11709#true} is VALID [2020-07-10 15:04:15,402 INFO L263 TraceCheckUtils]: 3: Hoare triple {11709#true} call #t~ret10 := main(); {11709#true} is VALID [2020-07-10 15:04:15,402 INFO L280 TraceCheckUtils]: 4: Hoare triple {11709#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {11709#true} is VALID [2020-07-10 15:04:15,402 INFO L280 TraceCheckUtils]: 5: Hoare triple {11709#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {11709#true} is VALID [2020-07-10 15:04:15,403 INFO L280 TraceCheckUtils]: 6: Hoare triple {11709#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {11709#true} is VALID [2020-07-10 15:04:15,403 INFO L280 TraceCheckUtils]: 7: Hoare triple {11709#true} assume !(0 != ~p1~0); {11709#true} is VALID [2020-07-10 15:04:15,403 INFO L280 TraceCheckUtils]: 8: Hoare triple {11709#true} assume !(0 != ~p2~0); {11709#true} is VALID [2020-07-10 15:04:15,403 INFO L280 TraceCheckUtils]: 9: Hoare triple {11709#true} assume !(0 != ~p3~0); {11709#true} is VALID [2020-07-10 15:04:15,404 INFO L280 TraceCheckUtils]: 10: Hoare triple {11709#true} assume !(0 != ~p4~0); {11709#true} is VALID [2020-07-10 15:04:15,405 INFO L280 TraceCheckUtils]: 11: Hoare triple {11709#true} assume 0 != ~p5~0;~lk5~0 := 1; {11713#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:15,405 INFO L280 TraceCheckUtils]: 12: Hoare triple {11713#(= 1 main_~lk5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {11713#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:15,406 INFO L280 TraceCheckUtils]: 13: Hoare triple {11713#(= 1 main_~lk5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {11713#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:15,407 INFO L280 TraceCheckUtils]: 14: Hoare triple {11713#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {11713#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:15,408 INFO L280 TraceCheckUtils]: 15: Hoare triple {11713#(= 1 main_~lk5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {11713#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:15,409 INFO L280 TraceCheckUtils]: 16: Hoare triple {11713#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {11713#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:15,409 INFO L280 TraceCheckUtils]: 17: Hoare triple {11713#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {11713#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:15,410 INFO L280 TraceCheckUtils]: 18: Hoare triple {11713#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {11713#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:15,411 INFO L280 TraceCheckUtils]: 19: Hoare triple {11713#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {11713#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:15,412 INFO L280 TraceCheckUtils]: 20: Hoare triple {11713#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {11713#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:15,413 INFO L280 TraceCheckUtils]: 21: Hoare triple {11713#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {11710#false} is VALID [2020-07-10 15:04:15,413 INFO L280 TraceCheckUtils]: 22: Hoare triple {11710#false} assume !false; {11710#false} is VALID [2020-07-10 15:04:15,415 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-10 15:04:15,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177967336] [2020-07-10 15:04:15,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:15,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:15,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053966783] [2020-07-10 15:04:15,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:04:15,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:15,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:15,444 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-10 15:04:15,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:15,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:15,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:15,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:15,446 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2020-07-10 15:04:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:15,726 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2020-07-10 15:04:15,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:15,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:04:15,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-10 15:04:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-10 15:04:15,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2020-07-10 15:04:15,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:15,877 INFO L225 Difference]: With dead ends: 812 [2020-07-10 15:04:15,877 INFO L226 Difference]: Without dead ends: 810 [2020-07-10 15:04:15,878 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-10 15:04:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2020-07-10 15:04:15,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2020-07-10 15:04:15,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:15,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 810 states. Second operand 648 states. [2020-07-10 15:04:15,957 INFO L74 IsIncluded]: Start isIncluded. First operand 810 states. Second operand 648 states. [2020-07-10 15:04:15,957 INFO L87 Difference]: Start difference. First operand 810 states. Second operand 648 states. [2020-07-10 15:04:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:15,997 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2020-07-10 15:04:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1271 transitions. [2020-07-10 15:04:15,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:15,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:15,999 INFO L74 IsIncluded]: Start isIncluded. First operand 648 states. Second operand 810 states. [2020-07-10 15:04:15,999 INFO L87 Difference]: Start difference. First operand 648 states. Second operand 810 states. [2020-07-10 15:04:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:16,037 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2020-07-10 15:04:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1271 transitions. [2020-07-10 15:04:16,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:16,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:16,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:16,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2020-07-10 15:04:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2020-07-10 15:04:16,066 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2020-07-10 15:04:16,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:16,066 INFO L479 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2020-07-10 15:04:16,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2020-07-10 15:04:16,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:04:16,068 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:16,068 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-10 15:04:16,068 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 15:04:16,068 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:16,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:16,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2020-07-10 15:04:16,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:16,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88801650] [2020-07-10 15:04:16,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:16,116 INFO L280 TraceCheckUtils]: 0: Hoare triple {14858#true} assume true; {14858#true} is VALID [2020-07-10 15:04:16,117 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14858#true} {14858#true} #180#return; {14858#true} is VALID [2020-07-10 15:04:16,117 INFO L263 TraceCheckUtils]: 0: Hoare triple {14858#true} call ULTIMATE.init(); {14858#true} is VALID [2020-07-10 15:04:16,117 INFO L280 TraceCheckUtils]: 1: Hoare triple {14858#true} assume true; {14858#true} is VALID [2020-07-10 15:04:16,117 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14858#true} {14858#true} #180#return; {14858#true} is VALID [2020-07-10 15:04:16,118 INFO L263 TraceCheckUtils]: 3: Hoare triple {14858#true} call #t~ret10 := main(); {14858#true} is VALID [2020-07-10 15:04:16,118 INFO L280 TraceCheckUtils]: 4: Hoare triple {14858#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {14858#true} is VALID [2020-07-10 15:04:16,118 INFO L280 TraceCheckUtils]: 5: Hoare triple {14858#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {14858#true} is VALID [2020-07-10 15:04:16,118 INFO L280 TraceCheckUtils]: 6: Hoare triple {14858#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {14858#true} is VALID [2020-07-10 15:04:16,119 INFO L280 TraceCheckUtils]: 7: Hoare triple {14858#true} assume !(0 != ~p1~0); {14858#true} is VALID [2020-07-10 15:04:16,119 INFO L280 TraceCheckUtils]: 8: Hoare triple {14858#true} assume !(0 != ~p2~0); {14858#true} is VALID [2020-07-10 15:04:16,119 INFO L280 TraceCheckUtils]: 9: Hoare triple {14858#true} assume !(0 != ~p3~0); {14858#true} is VALID [2020-07-10 15:04:16,119 INFO L280 TraceCheckUtils]: 10: Hoare triple {14858#true} assume !(0 != ~p4~0); {14858#true} is VALID [2020-07-10 15:04:16,121 INFO L280 TraceCheckUtils]: 11: Hoare triple {14858#true} assume !(0 != ~p5~0); {14862#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:16,122 INFO L280 TraceCheckUtils]: 12: Hoare triple {14862#(= 0 main_~p5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {14862#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:16,123 INFO L280 TraceCheckUtils]: 13: Hoare triple {14862#(= 0 main_~p5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {14862#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:16,123 INFO L280 TraceCheckUtils]: 14: Hoare triple {14862#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {14862#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:16,124 INFO L280 TraceCheckUtils]: 15: Hoare triple {14862#(= 0 main_~p5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {14862#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:16,124 INFO L280 TraceCheckUtils]: 16: Hoare triple {14862#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {14862#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:16,125 INFO L280 TraceCheckUtils]: 17: Hoare triple {14862#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {14862#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:16,125 INFO L280 TraceCheckUtils]: 18: Hoare triple {14862#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {14862#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:16,126 INFO L280 TraceCheckUtils]: 19: Hoare triple {14862#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {14862#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:16,126 INFO L280 TraceCheckUtils]: 20: Hoare triple {14862#(= 0 main_~p5~0)} assume 0 != ~p5~0; {14859#false} is VALID [2020-07-10 15:04:16,127 INFO L280 TraceCheckUtils]: 21: Hoare triple {14859#false} assume 1 != ~lk5~0; {14859#false} is VALID [2020-07-10 15:04:16,127 INFO L280 TraceCheckUtils]: 22: Hoare triple {14859#false} assume !false; {14859#false} is VALID [2020-07-10 15:04:16,127 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-10 15:04:16,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88801650] [2020-07-10 15:04:16,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:16,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:16,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978465797] [2020-07-10 15:04:16,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:04:16,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:16,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:16,152 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-10 15:04:16,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:16,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:16,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:16,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:16,153 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2020-07-10 15:04:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:16,505 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2020-07-10 15:04:16,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:16,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:04:16,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-10 15:04:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-10 15:04:16,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2020-07-10 15:04:16,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:16,744 INFO L225 Difference]: With dead ends: 1500 [2020-07-10 15:04:16,744 INFO L226 Difference]: Without dead ends: 874 [2020-07-10 15:04:16,746 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-10 15:04:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2020-07-10 15:04:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2020-07-10 15:04:16,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:16,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 874 states. Second operand 872 states. [2020-07-10 15:04:16,907 INFO L74 IsIncluded]: Start isIncluded. First operand 874 states. Second operand 872 states. [2020-07-10 15:04:16,907 INFO L87 Difference]: Start difference. First operand 874 states. Second operand 872 states. [2020-07-10 15:04:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:16,949 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2020-07-10 15:04:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1303 transitions. [2020-07-10 15:04:16,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:16,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:16,951 INFO L74 IsIncluded]: Start isIncluded. First operand 872 states. Second operand 874 states. [2020-07-10 15:04:16,952 INFO L87 Difference]: Start difference. First operand 872 states. Second operand 874 states. [2020-07-10 15:04:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:16,993 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2020-07-10 15:04:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1303 transitions. [2020-07-10 15:04:16,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:16,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:16,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:16,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2020-07-10 15:04:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2020-07-10 15:04:17,038 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2020-07-10 15:04:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:17,039 INFO L479 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2020-07-10 15:04:17,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2020-07-10 15:04:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:04:17,040 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:17,040 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-10 15:04:17,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 15:04:17,041 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:17,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:17,041 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2020-07-10 15:04:17,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:17,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177601323] [2020-07-10 15:04:17,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:17,067 INFO L280 TraceCheckUtils]: 0: Hoare triple {19079#true} assume true; {19079#true} is VALID [2020-07-10 15:04:17,067 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19079#true} {19079#true} #180#return; {19079#true} is VALID [2020-07-10 15:04:17,067 INFO L263 TraceCheckUtils]: 0: Hoare triple {19079#true} call ULTIMATE.init(); {19079#true} is VALID [2020-07-10 15:04:17,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {19079#true} assume true; {19079#true} is VALID [2020-07-10 15:04:17,068 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19079#true} {19079#true} #180#return; {19079#true} is VALID [2020-07-10 15:04:17,068 INFO L263 TraceCheckUtils]: 3: Hoare triple {19079#true} call #t~ret10 := main(); {19079#true} is VALID [2020-07-10 15:04:17,068 INFO L280 TraceCheckUtils]: 4: Hoare triple {19079#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {19079#true} is VALID [2020-07-10 15:04:17,068 INFO L280 TraceCheckUtils]: 5: Hoare triple {19079#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {19079#true} is VALID [2020-07-10 15:04:17,069 INFO L280 TraceCheckUtils]: 6: Hoare triple {19079#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {19079#true} is VALID [2020-07-10 15:04:17,069 INFO L280 TraceCheckUtils]: 7: Hoare triple {19079#true} assume !(0 != ~p1~0); {19079#true} is VALID [2020-07-10 15:04:17,069 INFO L280 TraceCheckUtils]: 8: Hoare triple {19079#true} assume !(0 != ~p2~0); {19079#true} is VALID [2020-07-10 15:04:17,069 INFO L280 TraceCheckUtils]: 9: Hoare triple {19079#true} assume !(0 != ~p3~0); {19079#true} is VALID [2020-07-10 15:04:17,069 INFO L280 TraceCheckUtils]: 10: Hoare triple {19079#true} assume !(0 != ~p4~0); {19079#true} is VALID [2020-07-10 15:04:17,070 INFO L280 TraceCheckUtils]: 11: Hoare triple {19079#true} assume 0 != ~p5~0;~lk5~0 := 1; {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:17,071 INFO L280 TraceCheckUtils]: 12: Hoare triple {19083#(not (= 0 main_~p5~0))} assume 0 != ~p6~0;~lk6~0 := 1; {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:17,071 INFO L280 TraceCheckUtils]: 13: Hoare triple {19083#(not (= 0 main_~p5~0))} assume 0 != ~p7~0;~lk7~0 := 1; {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:17,072 INFO L280 TraceCheckUtils]: 14: Hoare triple {19083#(not (= 0 main_~p5~0))} assume !(0 != ~p8~0); {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:17,072 INFO L280 TraceCheckUtils]: 15: Hoare triple {19083#(not (= 0 main_~p5~0))} assume 0 != ~p9~0;~lk9~0 := 1; {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:17,073 INFO L280 TraceCheckUtils]: 16: Hoare triple {19083#(not (= 0 main_~p5~0))} assume !(0 != ~p1~0); {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:17,073 INFO L280 TraceCheckUtils]: 17: Hoare triple {19083#(not (= 0 main_~p5~0))} assume !(0 != ~p2~0); {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:17,074 INFO L280 TraceCheckUtils]: 18: Hoare triple {19083#(not (= 0 main_~p5~0))} assume !(0 != ~p3~0); {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:17,075 INFO L280 TraceCheckUtils]: 19: Hoare triple {19083#(not (= 0 main_~p5~0))} assume !(0 != ~p4~0); {19083#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:17,075 INFO L280 TraceCheckUtils]: 20: Hoare triple {19083#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {19080#false} is VALID [2020-07-10 15:04:17,076 INFO L280 TraceCheckUtils]: 21: Hoare triple {19080#false} assume 0 != ~p6~0; {19080#false} is VALID [2020-07-10 15:04:17,076 INFO L280 TraceCheckUtils]: 22: Hoare triple {19080#false} assume 1 != ~lk6~0; {19080#false} is VALID [2020-07-10 15:04:17,076 INFO L280 TraceCheckUtils]: 23: Hoare triple {19080#false} assume !false; {19080#false} is VALID [2020-07-10 15:04:17,077 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-10 15:04:17,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177601323] [2020-07-10 15:04:17,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:17,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:17,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565987692] [2020-07-10 15:04:17,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:04:17,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:17,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:17,102 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-10 15:04:17,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:17,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:17,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:17,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:17,103 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2020-07-10 15:04:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:17,435 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2020-07-10 15:04:17,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:17,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:04:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-10 15:04:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-10 15:04:17,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2020-07-10 15:04:17,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:17,623 INFO L225 Difference]: With dead ends: 1308 [2020-07-10 15:04:17,623 INFO L226 Difference]: Without dead ends: 890 [2020-07-10 15:04:17,624 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-10 15:04:17,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2020-07-10 15:04:17,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2020-07-10 15:04:17,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:17,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 890 states. Second operand 888 states. [2020-07-10 15:04:17,819 INFO L74 IsIncluded]: Start isIncluded. First operand 890 states. Second operand 888 states. [2020-07-10 15:04:17,820 INFO L87 Difference]: Start difference. First operand 890 states. Second operand 888 states. [2020-07-10 15:04:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:17,867 INFO L93 Difference]: Finished difference Result 890 states and 1303 transitions. [2020-07-10 15:04:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1303 transitions. [2020-07-10 15:04:17,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:17,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:17,870 INFO L74 IsIncluded]: Start isIncluded. First operand 888 states. Second operand 890 states. [2020-07-10 15:04:17,870 INFO L87 Difference]: Start difference. First operand 888 states. Second operand 890 states. [2020-07-10 15:04:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:17,914 INFO L93 Difference]: Finished difference Result 890 states and 1303 transitions. [2020-07-10 15:04:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1303 transitions. [2020-07-10 15:04:17,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:17,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:17,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:17,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2020-07-10 15:04:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2020-07-10 15:04:17,961 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2020-07-10 15:04:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:17,961 INFO L479 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2020-07-10 15:04:17,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2020-07-10 15:04:17,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:04:17,965 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:17,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:17,966 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-10 15:04:17,966 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:17,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:17,966 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2020-07-10 15:04:17,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:17,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551755766] [2020-07-10 15:04:17,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:17,994 INFO L280 TraceCheckUtils]: 0: Hoare triple {23156#true} assume true; {23156#true} is VALID [2020-07-10 15:04:17,995 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23156#true} {23156#true} #180#return; {23156#true} is VALID [2020-07-10 15:04:17,995 INFO L263 TraceCheckUtils]: 0: Hoare triple {23156#true} call ULTIMATE.init(); {23156#true} is VALID [2020-07-10 15:04:17,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {23156#true} assume true; {23156#true} is VALID [2020-07-10 15:04:17,996 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23156#true} {23156#true} #180#return; {23156#true} is VALID [2020-07-10 15:04:17,996 INFO L263 TraceCheckUtils]: 3: Hoare triple {23156#true} call #t~ret10 := main(); {23156#true} is VALID [2020-07-10 15:04:17,996 INFO L280 TraceCheckUtils]: 4: Hoare triple {23156#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {23156#true} is VALID [2020-07-10 15:04:17,996 INFO L280 TraceCheckUtils]: 5: Hoare triple {23156#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {23156#true} is VALID [2020-07-10 15:04:17,997 INFO L280 TraceCheckUtils]: 6: Hoare triple {23156#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {23156#true} is VALID [2020-07-10 15:04:17,997 INFO L280 TraceCheckUtils]: 7: Hoare triple {23156#true} assume !(0 != ~p1~0); {23156#true} is VALID [2020-07-10 15:04:17,997 INFO L280 TraceCheckUtils]: 8: Hoare triple {23156#true} assume !(0 != ~p2~0); {23156#true} is VALID [2020-07-10 15:04:18,011 INFO L280 TraceCheckUtils]: 9: Hoare triple {23156#true} assume !(0 != ~p3~0); {23156#true} is VALID [2020-07-10 15:04:18,011 INFO L280 TraceCheckUtils]: 10: Hoare triple {23156#true} assume !(0 != ~p4~0); {23156#true} is VALID [2020-07-10 15:04:18,011 INFO L280 TraceCheckUtils]: 11: Hoare triple {23156#true} assume !(0 != ~p5~0); {23156#true} is VALID [2020-07-10 15:04:18,012 INFO L280 TraceCheckUtils]: 12: Hoare triple {23156#true} assume 0 != ~p6~0;~lk6~0 := 1; {23160#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:18,013 INFO L280 TraceCheckUtils]: 13: Hoare triple {23160#(= 1 main_~lk6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {23160#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:18,013 INFO L280 TraceCheckUtils]: 14: Hoare triple {23160#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {23160#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:18,014 INFO L280 TraceCheckUtils]: 15: Hoare triple {23160#(= 1 main_~lk6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {23160#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:18,014 INFO L280 TraceCheckUtils]: 16: Hoare triple {23160#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {23160#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:18,015 INFO L280 TraceCheckUtils]: 17: Hoare triple {23160#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {23160#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:18,015 INFO L280 TraceCheckUtils]: 18: Hoare triple {23160#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {23160#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:18,016 INFO L280 TraceCheckUtils]: 19: Hoare triple {23160#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {23160#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:18,016 INFO L280 TraceCheckUtils]: 20: Hoare triple {23160#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {23160#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:18,017 INFO L280 TraceCheckUtils]: 21: Hoare triple {23160#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {23160#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:18,017 INFO L280 TraceCheckUtils]: 22: Hoare triple {23160#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {23157#false} is VALID [2020-07-10 15:04:18,017 INFO L280 TraceCheckUtils]: 23: Hoare triple {23157#false} assume !false; {23157#false} is VALID [2020-07-10 15:04:18,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-10 15:04:18,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551755766] [2020-07-10 15:04:18,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:18,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:18,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756840633] [2020-07-10 15:04:18,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:04:18,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:18,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:18,043 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-10 15:04:18,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:18,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:18,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:18,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:18,044 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2020-07-10 15:04:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:18,463 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2020-07-10 15:04:18,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:18,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:04:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-10 15:04:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-10 15:04:18,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2020-07-10 15:04:18,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:18,656 INFO L225 Difference]: With dead ends: 1548 [2020-07-10 15:04:18,656 INFO L226 Difference]: Without dead ends: 1546 [2020-07-10 15:04:18,657 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-10 15:04:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2020-07-10 15:04:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2020-07-10 15:04:18,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:18,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1546 states. Second operand 1288 states. [2020-07-10 15:04:18,835 INFO L74 IsIncluded]: Start isIncluded. First operand 1546 states. Second operand 1288 states. [2020-07-10 15:04:18,835 INFO L87 Difference]: Start difference. First operand 1546 states. Second operand 1288 states. [2020-07-10 15:04:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:19,021 INFO L93 Difference]: Finished difference Result 1546 states and 2279 transitions. [2020-07-10 15:04:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2279 transitions. [2020-07-10 15:04:19,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:19,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:19,024 INFO L74 IsIncluded]: Start isIncluded. First operand 1288 states. Second operand 1546 states. [2020-07-10 15:04:19,024 INFO L87 Difference]: Start difference. First operand 1288 states. Second operand 1546 states. [2020-07-10 15:04:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:19,158 INFO L93 Difference]: Finished difference Result 1546 states and 2279 transitions. [2020-07-10 15:04:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2279 transitions. [2020-07-10 15:04:19,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:19,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:19,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:19,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2020-07-10 15:04:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2020-07-10 15:04:19,241 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2020-07-10 15:04:19,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:19,241 INFO L479 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2020-07-10 15:04:19,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2020-07-10 15:04:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:04:19,243 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:19,243 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-10 15:04:19,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-10 15:04:19,244 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:19,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:19,244 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2020-07-10 15:04:19,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:19,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773028046] [2020-07-10 15:04:19,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:19,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {29201#true} assume true; {29201#true} is VALID [2020-07-10 15:04:19,276 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29201#true} {29201#true} #180#return; {29201#true} is VALID [2020-07-10 15:04:19,276 INFO L263 TraceCheckUtils]: 0: Hoare triple {29201#true} call ULTIMATE.init(); {29201#true} is VALID [2020-07-10 15:04:19,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {29201#true} assume true; {29201#true} is VALID [2020-07-10 15:04:19,277 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29201#true} {29201#true} #180#return; {29201#true} is VALID [2020-07-10 15:04:19,277 INFO L263 TraceCheckUtils]: 3: Hoare triple {29201#true} call #t~ret10 := main(); {29201#true} is VALID [2020-07-10 15:04:19,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {29201#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {29201#true} is VALID [2020-07-10 15:04:19,278 INFO L280 TraceCheckUtils]: 5: Hoare triple {29201#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {29201#true} is VALID [2020-07-10 15:04:19,278 INFO L280 TraceCheckUtils]: 6: Hoare triple {29201#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {29201#true} is VALID [2020-07-10 15:04:19,278 INFO L280 TraceCheckUtils]: 7: Hoare triple {29201#true} assume !(0 != ~p1~0); {29201#true} is VALID [2020-07-10 15:04:19,278 INFO L280 TraceCheckUtils]: 8: Hoare triple {29201#true} assume !(0 != ~p2~0); {29201#true} is VALID [2020-07-10 15:04:19,279 INFO L280 TraceCheckUtils]: 9: Hoare triple {29201#true} assume !(0 != ~p3~0); {29201#true} is VALID [2020-07-10 15:04:19,279 INFO L280 TraceCheckUtils]: 10: Hoare triple {29201#true} assume !(0 != ~p4~0); {29201#true} is VALID [2020-07-10 15:04:19,279 INFO L280 TraceCheckUtils]: 11: Hoare triple {29201#true} assume !(0 != ~p5~0); {29201#true} is VALID [2020-07-10 15:04:19,280 INFO L280 TraceCheckUtils]: 12: Hoare triple {29201#true} assume !(0 != ~p6~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:19,280 INFO L280 TraceCheckUtils]: 13: Hoare triple {29205#(= 0 main_~p6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {29205#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:19,281 INFO L280 TraceCheckUtils]: 14: Hoare triple {29205#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:19,281 INFO L280 TraceCheckUtils]: 15: Hoare triple {29205#(= 0 main_~p6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {29205#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:19,282 INFO L280 TraceCheckUtils]: 16: Hoare triple {29205#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:19,283 INFO L280 TraceCheckUtils]: 17: Hoare triple {29205#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:19,283 INFO L280 TraceCheckUtils]: 18: Hoare triple {29205#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:19,284 INFO L280 TraceCheckUtils]: 19: Hoare triple {29205#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:19,284 INFO L280 TraceCheckUtils]: 20: Hoare triple {29205#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {29205#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:19,285 INFO L280 TraceCheckUtils]: 21: Hoare triple {29205#(= 0 main_~p6~0)} assume 0 != ~p6~0; {29202#false} is VALID [2020-07-10 15:04:19,285 INFO L280 TraceCheckUtils]: 22: Hoare triple {29202#false} assume 1 != ~lk6~0; {29202#false} is VALID [2020-07-10 15:04:19,285 INFO L280 TraceCheckUtils]: 23: Hoare triple {29202#false} assume !false; {29202#false} is VALID [2020-07-10 15:04:19,286 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-10 15:04:19,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773028046] [2020-07-10 15:04:19,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:19,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:19,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911074254] [2020-07-10 15:04:19,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:04:19,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:19,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:19,311 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-10 15:04:19,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:19,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:19,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:19,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:19,313 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2020-07-10 15:04:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:20,010 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2020-07-10 15:04:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:20,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:04:20,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2020-07-10 15:04:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2020-07-10 15:04:20,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2020-07-10 15:04:20,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:20,273 INFO L225 Difference]: With dead ends: 2956 [2020-07-10 15:04:20,273 INFO L226 Difference]: Without dead ends: 1706 [2020-07-10 15:04:20,275 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-10 15:04:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2020-07-10 15:04:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2020-07-10 15:04:20,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:20,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1706 states. Second operand 1704 states. [2020-07-10 15:04:20,635 INFO L74 IsIncluded]: Start isIncluded. First operand 1706 states. Second operand 1704 states. [2020-07-10 15:04:20,635 INFO L87 Difference]: Start difference. First operand 1706 states. Second operand 1704 states. [2020-07-10 15:04:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:20,759 INFO L93 Difference]: Finished difference Result 1706 states and 2375 transitions. [2020-07-10 15:04:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2375 transitions. [2020-07-10 15:04:20,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:20,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:20,762 INFO L74 IsIncluded]: Start isIncluded. First operand 1704 states. Second operand 1706 states. [2020-07-10 15:04:20,762 INFO L87 Difference]: Start difference. First operand 1704 states. Second operand 1706 states. [2020-07-10 15:04:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:20,852 INFO L93 Difference]: Finished difference Result 1706 states and 2375 transitions. [2020-07-10 15:04:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2375 transitions. [2020-07-10 15:04:20,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:20,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:20,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:20,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2020-07-10 15:04:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2020-07-10 15:04:20,951 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2020-07-10 15:04:20,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:20,951 INFO L479 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2020-07-10 15:04:20,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2020-07-10 15:04:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:04:20,953 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:20,953 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-10 15:04:20,953 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-10 15:04:20,953 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:20,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:20,954 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2020-07-10 15:04:20,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:20,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157662837] [2020-07-10 15:04:20,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:20,983 INFO L280 TraceCheckUtils]: 0: Hoare triple {37454#true} assume true; {37454#true} is VALID [2020-07-10 15:04:20,984 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37454#true} {37454#true} #180#return; {37454#true} is VALID [2020-07-10 15:04:20,984 INFO L263 TraceCheckUtils]: 0: Hoare triple {37454#true} call ULTIMATE.init(); {37454#true} is VALID [2020-07-10 15:04:20,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {37454#true} assume true; {37454#true} is VALID [2020-07-10 15:04:20,985 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37454#true} {37454#true} #180#return; {37454#true} is VALID [2020-07-10 15:04:20,985 INFO L263 TraceCheckUtils]: 3: Hoare triple {37454#true} call #t~ret10 := main(); {37454#true} is VALID [2020-07-10 15:04:20,985 INFO L280 TraceCheckUtils]: 4: Hoare triple {37454#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {37454#true} is VALID [2020-07-10 15:04:20,986 INFO L280 TraceCheckUtils]: 5: Hoare triple {37454#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {37454#true} is VALID [2020-07-10 15:04:20,986 INFO L280 TraceCheckUtils]: 6: Hoare triple {37454#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {37454#true} is VALID [2020-07-10 15:04:20,986 INFO L280 TraceCheckUtils]: 7: Hoare triple {37454#true} assume !(0 != ~p1~0); {37454#true} is VALID [2020-07-10 15:04:20,986 INFO L280 TraceCheckUtils]: 8: Hoare triple {37454#true} assume !(0 != ~p2~0); {37454#true} is VALID [2020-07-10 15:04:20,987 INFO L280 TraceCheckUtils]: 9: Hoare triple {37454#true} assume !(0 != ~p3~0); {37454#true} is VALID [2020-07-10 15:04:20,987 INFO L280 TraceCheckUtils]: 10: Hoare triple {37454#true} assume !(0 != ~p4~0); {37454#true} is VALID [2020-07-10 15:04:20,987 INFO L280 TraceCheckUtils]: 11: Hoare triple {37454#true} assume !(0 != ~p5~0); {37454#true} is VALID [2020-07-10 15:04:20,990 INFO L280 TraceCheckUtils]: 12: Hoare triple {37454#true} assume 0 != ~p6~0;~lk6~0 := 1; {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:20,991 INFO L280 TraceCheckUtils]: 13: Hoare triple {37458#(not (= 0 main_~p6~0))} assume 0 != ~p7~0;~lk7~0 := 1; {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:20,992 INFO L280 TraceCheckUtils]: 14: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p8~0); {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:20,992 INFO L280 TraceCheckUtils]: 15: Hoare triple {37458#(not (= 0 main_~p6~0))} assume 0 != ~p9~0;~lk9~0 := 1; {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:20,993 INFO L280 TraceCheckUtils]: 16: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p1~0); {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:20,993 INFO L280 TraceCheckUtils]: 17: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p2~0); {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:20,994 INFO L280 TraceCheckUtils]: 18: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p3~0); {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:20,995 INFO L280 TraceCheckUtils]: 19: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p4~0); {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:20,995 INFO L280 TraceCheckUtils]: 20: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p5~0); {37458#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:20,996 INFO L280 TraceCheckUtils]: 21: Hoare triple {37458#(not (= 0 main_~p6~0))} assume !(0 != ~p6~0); {37455#false} is VALID [2020-07-10 15:04:20,996 INFO L280 TraceCheckUtils]: 22: Hoare triple {37455#false} assume 0 != ~p7~0; {37455#false} is VALID [2020-07-10 15:04:20,996 INFO L280 TraceCheckUtils]: 23: Hoare triple {37455#false} assume 1 != ~lk7~0; {37455#false} is VALID [2020-07-10 15:04:20,997 INFO L280 TraceCheckUtils]: 24: Hoare triple {37455#false} assume !false; {37455#false} is VALID [2020-07-10 15:04:20,998 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-10 15:04:20,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157662837] [2020-07-10 15:04:20,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:20,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:20,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649614540] [2020-07-10 15:04:21,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:04:21,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:21,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:21,032 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-10 15:04:21,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:21,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:21,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:21,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:21,033 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2020-07-10 15:04:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:21,897 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2020-07-10 15:04:21,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:21,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:04:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-10 15:04:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-10 15:04:21,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2020-07-10 15:04:22,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:22,157 INFO L225 Difference]: With dead ends: 2556 [2020-07-10 15:04:22,157 INFO L226 Difference]: Without dead ends: 1738 [2020-07-10 15:04:22,158 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-10 15:04:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-07-10 15:04:22,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2020-07-10 15:04:22,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:22,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1738 states. Second operand 1736 states. [2020-07-10 15:04:22,509 INFO L74 IsIncluded]: Start isIncluded. First operand 1738 states. Second operand 1736 states. [2020-07-10 15:04:22,509 INFO L87 Difference]: Start difference. First operand 1738 states. Second operand 1736 states. [2020-07-10 15:04:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:22,604 INFO L93 Difference]: Finished difference Result 1738 states and 2375 transitions. [2020-07-10 15:04:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2375 transitions. [2020-07-10 15:04:22,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:22,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:22,607 INFO L74 IsIncluded]: Start isIncluded. First operand 1736 states. Second operand 1738 states. [2020-07-10 15:04:22,608 INFO L87 Difference]: Start difference. First operand 1736 states. Second operand 1738 states. [2020-07-10 15:04:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:22,699 INFO L93 Difference]: Finished difference Result 1738 states and 2375 transitions. [2020-07-10 15:04:22,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2375 transitions. [2020-07-10 15:04:22,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:22,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:22,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:22,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2020-07-10 15:04:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2020-07-10 15:04:22,811 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2020-07-10 15:04:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:22,812 INFO L479 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2020-07-10 15:04:22,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2020-07-10 15:04:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:04:22,814 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:22,814 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-10 15:04:22,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-10 15:04:22,814 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:22,815 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2020-07-10 15:04:22,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:22,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174780381] [2020-07-10 15:04:22,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:22,837 INFO L280 TraceCheckUtils]: 0: Hoare triple {45403#true} assume true; {45403#true} is VALID [2020-07-10 15:04:22,838 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45403#true} {45403#true} #180#return; {45403#true} is VALID [2020-07-10 15:04:22,838 INFO L263 TraceCheckUtils]: 0: Hoare triple {45403#true} call ULTIMATE.init(); {45403#true} is VALID [2020-07-10 15:04:22,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {45403#true} assume true; {45403#true} is VALID [2020-07-10 15:04:22,838 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45403#true} {45403#true} #180#return; {45403#true} is VALID [2020-07-10 15:04:22,838 INFO L263 TraceCheckUtils]: 3: Hoare triple {45403#true} call #t~ret10 := main(); {45403#true} is VALID [2020-07-10 15:04:22,839 INFO L280 TraceCheckUtils]: 4: Hoare triple {45403#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {45403#true} is VALID [2020-07-10 15:04:22,839 INFO L280 TraceCheckUtils]: 5: Hoare triple {45403#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {45403#true} is VALID [2020-07-10 15:04:22,839 INFO L280 TraceCheckUtils]: 6: Hoare triple {45403#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {45403#true} is VALID [2020-07-10 15:04:22,839 INFO L280 TraceCheckUtils]: 7: Hoare triple {45403#true} assume !(0 != ~p1~0); {45403#true} is VALID [2020-07-10 15:04:22,839 INFO L280 TraceCheckUtils]: 8: Hoare triple {45403#true} assume !(0 != ~p2~0); {45403#true} is VALID [2020-07-10 15:04:22,840 INFO L280 TraceCheckUtils]: 9: Hoare triple {45403#true} assume !(0 != ~p3~0); {45403#true} is VALID [2020-07-10 15:04:22,840 INFO L280 TraceCheckUtils]: 10: Hoare triple {45403#true} assume !(0 != ~p4~0); {45403#true} is VALID [2020-07-10 15:04:22,840 INFO L280 TraceCheckUtils]: 11: Hoare triple {45403#true} assume !(0 != ~p5~0); {45403#true} is VALID [2020-07-10 15:04:22,840 INFO L280 TraceCheckUtils]: 12: Hoare triple {45403#true} assume !(0 != ~p6~0); {45403#true} is VALID [2020-07-10 15:04:22,841 INFO L280 TraceCheckUtils]: 13: Hoare triple {45403#true} assume 0 != ~p7~0;~lk7~0 := 1; {45407#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:22,842 INFO L280 TraceCheckUtils]: 14: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:22,843 INFO L280 TraceCheckUtils]: 15: Hoare triple {45407#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {45407#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:22,843 INFO L280 TraceCheckUtils]: 16: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:22,843 INFO L280 TraceCheckUtils]: 17: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:22,844 INFO L280 TraceCheckUtils]: 18: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:22,844 INFO L280 TraceCheckUtils]: 19: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:22,845 INFO L280 TraceCheckUtils]: 20: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:22,845 INFO L280 TraceCheckUtils]: 21: Hoare triple {45407#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {45407#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:22,846 INFO L280 TraceCheckUtils]: 22: Hoare triple {45407#(= main_~lk7~0 1)} assume 0 != ~p7~0; {45407#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:22,846 INFO L280 TraceCheckUtils]: 23: Hoare triple {45407#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {45404#false} is VALID [2020-07-10 15:04:22,846 INFO L280 TraceCheckUtils]: 24: Hoare triple {45404#false} assume !false; {45404#false} is VALID [2020-07-10 15:04:22,847 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-10 15:04:22,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174780381] [2020-07-10 15:04:22,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:22,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:22,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220084599] [2020-07-10 15:04:22,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:04:22,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:22,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:22,885 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-10 15:04:22,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:22,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:22,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:22,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:22,886 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2020-07-10 15:04:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:23,880 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2020-07-10 15:04:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:23,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:04:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-10 15:04:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-10 15:04:23,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2020-07-10 15:04:23,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:24,267 INFO L225 Difference]: With dead ends: 2956 [2020-07-10 15:04:24,267 INFO L226 Difference]: Without dead ends: 2954 [2020-07-10 15:04:24,268 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-10 15:04:24,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-07-10 15:04:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2020-07-10 15:04:24,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:24,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2954 states. Second operand 2568 states. [2020-07-10 15:04:24,705 INFO L74 IsIncluded]: Start isIncluded. First operand 2954 states. Second operand 2568 states. [2020-07-10 15:04:24,705 INFO L87 Difference]: Start difference. First operand 2954 states. Second operand 2568 states. [2020-07-10 15:04:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:24,950 INFO L93 Difference]: Finished difference Result 2954 states and 4039 transitions. [2020-07-10 15:04:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4039 transitions. [2020-07-10 15:04:24,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:24,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:24,954 INFO L74 IsIncluded]: Start isIncluded. First operand 2568 states. Second operand 2954 states. [2020-07-10 15:04:24,954 INFO L87 Difference]: Start difference. First operand 2568 states. Second operand 2954 states. [2020-07-10 15:04:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:25,198 INFO L93 Difference]: Finished difference Result 2954 states and 4039 transitions. [2020-07-10 15:04:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4039 transitions. [2020-07-10 15:04:25,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:25,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:25,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:25,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2020-07-10 15:04:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2020-07-10 15:04:25,402 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2020-07-10 15:04:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:25,402 INFO L479 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2020-07-10 15:04:25,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2020-07-10 15:04:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:04:25,404 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:25,404 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-10 15:04:25,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-10 15:04:25,405 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:25,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:25,405 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2020-07-10 15:04:25,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:25,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604485673] [2020-07-10 15:04:25,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:25,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {57048#true} assume true; {57048#true} is VALID [2020-07-10 15:04:25,452 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {57048#true} {57048#true} #180#return; {57048#true} is VALID [2020-07-10 15:04:25,452 INFO L263 TraceCheckUtils]: 0: Hoare triple {57048#true} call ULTIMATE.init(); {57048#true} is VALID [2020-07-10 15:04:25,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {57048#true} assume true; {57048#true} is VALID [2020-07-10 15:04:25,452 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {57048#true} {57048#true} #180#return; {57048#true} is VALID [2020-07-10 15:04:25,452 INFO L263 TraceCheckUtils]: 3: Hoare triple {57048#true} call #t~ret10 := main(); {57048#true} is VALID [2020-07-10 15:04:25,453 INFO L280 TraceCheckUtils]: 4: Hoare triple {57048#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {57048#true} is VALID [2020-07-10 15:04:25,453 INFO L280 TraceCheckUtils]: 5: Hoare triple {57048#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {57048#true} is VALID [2020-07-10 15:04:25,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {57048#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {57048#true} is VALID [2020-07-10 15:04:25,453 INFO L280 TraceCheckUtils]: 7: Hoare triple {57048#true} assume !(0 != ~p1~0); {57048#true} is VALID [2020-07-10 15:04:25,453 INFO L280 TraceCheckUtils]: 8: Hoare triple {57048#true} assume !(0 != ~p2~0); {57048#true} is VALID [2020-07-10 15:04:25,453 INFO L280 TraceCheckUtils]: 9: Hoare triple {57048#true} assume !(0 != ~p3~0); {57048#true} is VALID [2020-07-10 15:04:25,454 INFO L280 TraceCheckUtils]: 10: Hoare triple {57048#true} assume !(0 != ~p4~0); {57048#true} is VALID [2020-07-10 15:04:25,454 INFO L280 TraceCheckUtils]: 11: Hoare triple {57048#true} assume !(0 != ~p5~0); {57048#true} is VALID [2020-07-10 15:04:25,454 INFO L280 TraceCheckUtils]: 12: Hoare triple {57048#true} assume !(0 != ~p6~0); {57048#true} is VALID [2020-07-10 15:04:25,455 INFO L280 TraceCheckUtils]: 13: Hoare triple {57048#true} assume !(0 != ~p7~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:25,455 INFO L280 TraceCheckUtils]: 14: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:25,455 INFO L280 TraceCheckUtils]: 15: Hoare triple {57052#(= 0 main_~p7~0)} assume 0 != ~p9~0;~lk9~0 := 1; {57052#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:25,456 INFO L280 TraceCheckUtils]: 16: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:25,456 INFO L280 TraceCheckUtils]: 17: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:25,457 INFO L280 TraceCheckUtils]: 18: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:25,457 INFO L280 TraceCheckUtils]: 19: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:25,458 INFO L280 TraceCheckUtils]: 20: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:25,458 INFO L280 TraceCheckUtils]: 21: Hoare triple {57052#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {57052#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:25,459 INFO L280 TraceCheckUtils]: 22: Hoare triple {57052#(= 0 main_~p7~0)} assume 0 != ~p7~0; {57049#false} is VALID [2020-07-10 15:04:25,459 INFO L280 TraceCheckUtils]: 23: Hoare triple {57049#false} assume 1 != ~lk7~0; {57049#false} is VALID [2020-07-10 15:04:25,459 INFO L280 TraceCheckUtils]: 24: Hoare triple {57049#false} assume !false; {57049#false} is VALID [2020-07-10 15:04:25,460 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-10 15:04:25,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604485673] [2020-07-10 15:04:25,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:25,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:25,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415219129] [2020-07-10 15:04:25,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:04:25,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:25,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:25,489 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-10 15:04:25,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:25,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:25,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:25,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:25,490 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2020-07-10 15:04:27,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:27,275 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2020-07-10 15:04:27,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:27,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:04:27,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-10 15:04:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-10 15:04:27,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2020-07-10 15:04:27,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:27,819 INFO L225 Difference]: With dead ends: 5836 [2020-07-10 15:04:27,819 INFO L226 Difference]: Without dead ends: 3338 [2020-07-10 15:04:27,823 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-10 15:04:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2020-07-10 15:04:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2020-07-10 15:04:28,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:28,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3338 states. Second operand 3336 states. [2020-07-10 15:04:28,532 INFO L74 IsIncluded]: Start isIncluded. First operand 3338 states. Second operand 3336 states. [2020-07-10 15:04:28,532 INFO L87 Difference]: Start difference. First operand 3338 states. Second operand 3336 states. [2020-07-10 15:04:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:28,867 INFO L93 Difference]: Finished difference Result 3338 states and 4295 transitions. [2020-07-10 15:04:28,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4295 transitions. [2020-07-10 15:04:28,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:28,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:28,871 INFO L74 IsIncluded]: Start isIncluded. First operand 3336 states. Second operand 3338 states. [2020-07-10 15:04:28,871 INFO L87 Difference]: Start difference. First operand 3336 states. Second operand 3338 states. [2020-07-10 15:04:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:29,219 INFO L93 Difference]: Finished difference Result 3338 states and 4295 transitions. [2020-07-10 15:04:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4295 transitions. [2020-07-10 15:04:29,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:29,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:29,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:29,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2020-07-10 15:04:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2020-07-10 15:04:29,595 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2020-07-10 15:04:29,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:29,596 INFO L479 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2020-07-10 15:04:29,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:29,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2020-07-10 15:04:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:04:29,598 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:29,599 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:29,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-10 15:04:29,599 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:29,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:29,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2020-07-10 15:04:29,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:29,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899760900] [2020-07-10 15:04:29,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:29,633 INFO L280 TraceCheckUtils]: 0: Hoare triple {73237#true} assume true; {73237#true} is VALID [2020-07-10 15:04:29,633 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {73237#true} {73237#true} #180#return; {73237#true} is VALID [2020-07-10 15:04:29,633 INFO L263 TraceCheckUtils]: 0: Hoare triple {73237#true} call ULTIMATE.init(); {73237#true} is VALID [2020-07-10 15:04:29,633 INFO L280 TraceCheckUtils]: 1: Hoare triple {73237#true} assume true; {73237#true} is VALID [2020-07-10 15:04:29,634 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {73237#true} {73237#true} #180#return; {73237#true} is VALID [2020-07-10 15:04:29,634 INFO L263 TraceCheckUtils]: 3: Hoare triple {73237#true} call #t~ret10 := main(); {73237#true} is VALID [2020-07-10 15:04:29,634 INFO L280 TraceCheckUtils]: 4: Hoare triple {73237#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {73237#true} is VALID [2020-07-10 15:04:29,634 INFO L280 TraceCheckUtils]: 5: Hoare triple {73237#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {73237#true} is VALID [2020-07-10 15:04:29,634 INFO L280 TraceCheckUtils]: 6: Hoare triple {73237#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {73237#true} is VALID [2020-07-10 15:04:29,635 INFO L280 TraceCheckUtils]: 7: Hoare triple {73237#true} assume !(0 != ~p1~0); {73237#true} is VALID [2020-07-10 15:04:29,635 INFO L280 TraceCheckUtils]: 8: Hoare triple {73237#true} assume !(0 != ~p2~0); {73237#true} is VALID [2020-07-10 15:04:29,635 INFO L280 TraceCheckUtils]: 9: Hoare triple {73237#true} assume !(0 != ~p3~0); {73237#true} is VALID [2020-07-10 15:04:29,635 INFO L280 TraceCheckUtils]: 10: Hoare triple {73237#true} assume !(0 != ~p4~0); {73237#true} is VALID [2020-07-10 15:04:29,635 INFO L280 TraceCheckUtils]: 11: Hoare triple {73237#true} assume !(0 != ~p5~0); {73237#true} is VALID [2020-07-10 15:04:29,636 INFO L280 TraceCheckUtils]: 12: Hoare triple {73237#true} assume !(0 != ~p6~0); {73237#true} is VALID [2020-07-10 15:04:29,636 INFO L280 TraceCheckUtils]: 13: Hoare triple {73237#true} assume 0 != ~p7~0;~lk7~0 := 1; {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:29,637 INFO L280 TraceCheckUtils]: 14: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p8~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:29,637 INFO L280 TraceCheckUtils]: 15: Hoare triple {73241#(not (= 0 main_~p7~0))} assume 0 != ~p9~0;~lk9~0 := 1; {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:29,638 INFO L280 TraceCheckUtils]: 16: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p1~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:29,638 INFO L280 TraceCheckUtils]: 17: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p2~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:29,638 INFO L280 TraceCheckUtils]: 18: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p3~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:29,639 INFO L280 TraceCheckUtils]: 19: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p4~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:29,639 INFO L280 TraceCheckUtils]: 20: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p5~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:29,640 INFO L280 TraceCheckUtils]: 21: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p6~0); {73241#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:29,640 INFO L280 TraceCheckUtils]: 22: Hoare triple {73241#(not (= 0 main_~p7~0))} assume !(0 != ~p7~0); {73238#false} is VALID [2020-07-10 15:04:29,641 INFO L280 TraceCheckUtils]: 23: Hoare triple {73238#false} assume 0 != ~p8~0; {73238#false} is VALID [2020-07-10 15:04:29,641 INFO L280 TraceCheckUtils]: 24: Hoare triple {73238#false} assume 1 != ~lk8~0; {73238#false} is VALID [2020-07-10 15:04:29,641 INFO L280 TraceCheckUtils]: 25: Hoare triple {73238#false} assume !false; {73238#false} is VALID [2020-07-10 15:04:29,642 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-10 15:04:29,642 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899760900] [2020-07-10 15:04:29,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:29,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:29,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232467749] [2020-07-10 15:04:29,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:04:29,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:29,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:29,675 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-10 15:04:29,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:29,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:29,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:29,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:29,677 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2020-07-10 15:04:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:31,389 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2020-07-10 15:04:31,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:31,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:04:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-10 15:04:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-10 15:04:31,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2020-07-10 15:04:31,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:31,963 INFO L225 Difference]: With dead ends: 5004 [2020-07-10 15:04:31,963 INFO L226 Difference]: Without dead ends: 3402 [2020-07-10 15:04:31,965 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-10 15:04:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2020-07-10 15:04:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2020-07-10 15:04:32,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:32,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3402 states. Second operand 3400 states. [2020-07-10 15:04:32,732 INFO L74 IsIncluded]: Start isIncluded. First operand 3402 states. Second operand 3400 states. [2020-07-10 15:04:32,732 INFO L87 Difference]: Start difference. First operand 3402 states. Second operand 3400 states. [2020-07-10 15:04:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:33,084 INFO L93 Difference]: Finished difference Result 3402 states and 4295 transitions. [2020-07-10 15:04:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4295 transitions. [2020-07-10 15:04:33,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:33,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:33,088 INFO L74 IsIncluded]: Start isIncluded. First operand 3400 states. Second operand 3402 states. [2020-07-10 15:04:33,088 INFO L87 Difference]: Start difference. First operand 3400 states. Second operand 3402 states. [2020-07-10 15:04:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:33,444 INFO L93 Difference]: Finished difference Result 3402 states and 4295 transitions. [2020-07-10 15:04:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4295 transitions. [2020-07-10 15:04:33,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:33,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:33,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:33,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2020-07-10 15:04:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2020-07-10 15:04:33,855 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2020-07-10 15:04:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:33,855 INFO L479 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2020-07-10 15:04:33,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2020-07-10 15:04:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:04:33,858 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:33,858 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-10 15:04:33,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-10 15:04:33,858 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:33,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:33,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2020-07-10 15:04:33,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:33,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215289504] [2020-07-10 15:04:33,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:33,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {88786#true} assume true; {88786#true} is VALID [2020-07-10 15:04:33,896 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {88786#true} {88786#true} #180#return; {88786#true} is VALID [2020-07-10 15:04:33,897 INFO L263 TraceCheckUtils]: 0: Hoare triple {88786#true} call ULTIMATE.init(); {88786#true} is VALID [2020-07-10 15:04:33,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {88786#true} assume true; {88786#true} is VALID [2020-07-10 15:04:33,897 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {88786#true} {88786#true} #180#return; {88786#true} is VALID [2020-07-10 15:04:33,897 INFO L263 TraceCheckUtils]: 3: Hoare triple {88786#true} call #t~ret10 := main(); {88786#true} is VALID [2020-07-10 15:04:33,897 INFO L280 TraceCheckUtils]: 4: Hoare triple {88786#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {88786#true} is VALID [2020-07-10 15:04:33,898 INFO L280 TraceCheckUtils]: 5: Hoare triple {88786#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {88786#true} is VALID [2020-07-10 15:04:33,898 INFO L280 TraceCheckUtils]: 6: Hoare triple {88786#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {88786#true} is VALID [2020-07-10 15:04:33,898 INFO L280 TraceCheckUtils]: 7: Hoare triple {88786#true} assume !(0 != ~p1~0); {88786#true} is VALID [2020-07-10 15:04:33,898 INFO L280 TraceCheckUtils]: 8: Hoare triple {88786#true} assume !(0 != ~p2~0); {88786#true} is VALID [2020-07-10 15:04:33,898 INFO L280 TraceCheckUtils]: 9: Hoare triple {88786#true} assume !(0 != ~p3~0); {88786#true} is VALID [2020-07-10 15:04:33,899 INFO L280 TraceCheckUtils]: 10: Hoare triple {88786#true} assume !(0 != ~p4~0); {88786#true} is VALID [2020-07-10 15:04:33,899 INFO L280 TraceCheckUtils]: 11: Hoare triple {88786#true} assume !(0 != ~p5~0); {88786#true} is VALID [2020-07-10 15:04:33,899 INFO L280 TraceCheckUtils]: 12: Hoare triple {88786#true} assume !(0 != ~p6~0); {88786#true} is VALID [2020-07-10 15:04:33,904 INFO L280 TraceCheckUtils]: 13: Hoare triple {88786#true} assume !(0 != ~p7~0); {88786#true} is VALID [2020-07-10 15:04:33,906 INFO L280 TraceCheckUtils]: 14: Hoare triple {88786#true} assume !(0 != ~p8~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:33,906 INFO L280 TraceCheckUtils]: 15: Hoare triple {88790#(= 0 main_~p8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {88790#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:33,907 INFO L280 TraceCheckUtils]: 16: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:33,907 INFO L280 TraceCheckUtils]: 17: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:33,907 INFO L280 TraceCheckUtils]: 18: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:33,908 INFO L280 TraceCheckUtils]: 19: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:33,908 INFO L280 TraceCheckUtils]: 20: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:33,908 INFO L280 TraceCheckUtils]: 21: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:33,909 INFO L280 TraceCheckUtils]: 22: Hoare triple {88790#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {88790#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:33,909 INFO L280 TraceCheckUtils]: 23: Hoare triple {88790#(= 0 main_~p8~0)} assume 0 != ~p8~0; {88787#false} is VALID [2020-07-10 15:04:33,909 INFO L280 TraceCheckUtils]: 24: Hoare triple {88787#false} assume 1 != ~lk8~0; {88787#false} is VALID [2020-07-10 15:04:33,910 INFO L280 TraceCheckUtils]: 25: Hoare triple {88787#false} assume !false; {88787#false} is VALID [2020-07-10 15:04:33,910 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-10 15:04:33,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215289504] [2020-07-10 15:04:33,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:33,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:33,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053775690] [2020-07-10 15:04:33,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:04:33,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:33,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:33,936 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-10 15:04:33,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:33,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:33,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:33,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:33,937 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2020-07-10 15:04:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:38,390 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2020-07-10 15:04:38,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:38,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:04:38,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-10 15:04:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-10 15:04:38,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2020-07-10 15:04:38,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:40,117 INFO L225 Difference]: With dead ends: 9804 [2020-07-10 15:04:40,117 INFO L226 Difference]: Without dead ends: 6538 [2020-07-10 15:04:40,122 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-10 15:04:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2020-07-10 15:04:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2020-07-10 15:04:41,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:41,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6538 states. Second operand 6536 states. [2020-07-10 15:04:41,805 INFO L74 IsIncluded]: Start isIncluded. First operand 6538 states. Second operand 6536 states. [2020-07-10 15:04:41,806 INFO L87 Difference]: Start difference. First operand 6538 states. Second operand 6536 states. [2020-07-10 15:04:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:43,196 INFO L93 Difference]: Finished difference Result 6538 states and 7815 transitions. [2020-07-10 15:04:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 6538 states and 7815 transitions. [2020-07-10 15:04:43,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:43,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:43,203 INFO L74 IsIncluded]: Start isIncluded. First operand 6536 states. Second operand 6538 states. [2020-07-10 15:04:43,203 INFO L87 Difference]: Start difference. First operand 6536 states. Second operand 6538 states. [2020-07-10 15:04:44,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:44,619 INFO L93 Difference]: Finished difference Result 6538 states and 7815 transitions. [2020-07-10 15:04:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 6538 states and 7815 transitions. [2020-07-10 15:04:44,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:44,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:44,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:44,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2020-07-10 15:04:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2020-07-10 15:04:46,075 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2020-07-10 15:04:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:46,076 INFO L479 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2020-07-10 15:04:46,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2020-07-10 15:04:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:04:46,079 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:46,079 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-10 15:04:46,079 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-10 15:04:46,080 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:46,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2020-07-10 15:04:46,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:46,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932826798] [2020-07-10 15:04:46,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:46,130 INFO L280 TraceCheckUtils]: 0: Hoare triple {118863#true} assume true; {118863#true} is VALID [2020-07-10 15:04:46,131 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {118863#true} {118863#true} #180#return; {118863#true} is VALID [2020-07-10 15:04:46,131 INFO L263 TraceCheckUtils]: 0: Hoare triple {118863#true} call ULTIMATE.init(); {118863#true} is VALID [2020-07-10 15:04:46,131 INFO L280 TraceCheckUtils]: 1: Hoare triple {118863#true} assume true; {118863#true} is VALID [2020-07-10 15:04:46,132 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {118863#true} {118863#true} #180#return; {118863#true} is VALID [2020-07-10 15:04:46,132 INFO L263 TraceCheckUtils]: 3: Hoare triple {118863#true} call #t~ret10 := main(); {118863#true} is VALID [2020-07-10 15:04:46,133 INFO L280 TraceCheckUtils]: 4: Hoare triple {118863#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {118863#true} is VALID [2020-07-10 15:04:46,133 INFO L280 TraceCheckUtils]: 5: Hoare triple {118863#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {118863#true} is VALID [2020-07-10 15:04:46,133 INFO L280 TraceCheckUtils]: 6: Hoare triple {118863#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {118863#true} is VALID [2020-07-10 15:04:46,134 INFO L280 TraceCheckUtils]: 7: Hoare triple {118863#true} assume !(0 != ~p1~0); {118863#true} is VALID [2020-07-10 15:04:46,134 INFO L280 TraceCheckUtils]: 8: Hoare triple {118863#true} assume !(0 != ~p2~0); {118863#true} is VALID [2020-07-10 15:04:46,134 INFO L280 TraceCheckUtils]: 9: Hoare triple {118863#true} assume !(0 != ~p3~0); {118863#true} is VALID [2020-07-10 15:04:46,134 INFO L280 TraceCheckUtils]: 10: Hoare triple {118863#true} assume !(0 != ~p4~0); {118863#true} is VALID [2020-07-10 15:04:46,134 INFO L280 TraceCheckUtils]: 11: Hoare triple {118863#true} assume !(0 != ~p5~0); {118863#true} is VALID [2020-07-10 15:04:46,134 INFO L280 TraceCheckUtils]: 12: Hoare triple {118863#true} assume !(0 != ~p6~0); {118863#true} is VALID [2020-07-10 15:04:46,135 INFO L280 TraceCheckUtils]: 13: Hoare triple {118863#true} assume !(0 != ~p7~0); {118863#true} is VALID [2020-07-10 15:04:46,138 INFO L280 TraceCheckUtils]: 14: Hoare triple {118863#true} assume 0 != ~p8~0;~lk8~0 := 1; {118867#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:46,138 INFO L280 TraceCheckUtils]: 15: Hoare triple {118867#(= 1 main_~lk8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {118867#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:46,138 INFO L280 TraceCheckUtils]: 16: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:46,139 INFO L280 TraceCheckUtils]: 17: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:46,139 INFO L280 TraceCheckUtils]: 18: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:46,140 INFO L280 TraceCheckUtils]: 19: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:46,140 INFO L280 TraceCheckUtils]: 20: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:46,140 INFO L280 TraceCheckUtils]: 21: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:46,141 INFO L280 TraceCheckUtils]: 22: Hoare triple {118867#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {118867#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:46,141 INFO L280 TraceCheckUtils]: 23: Hoare triple {118867#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {118867#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:46,142 INFO L280 TraceCheckUtils]: 24: Hoare triple {118867#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {118864#false} is VALID [2020-07-10 15:04:46,142 INFO L280 TraceCheckUtils]: 25: Hoare triple {118864#false} assume !false; {118864#false} is VALID [2020-07-10 15:04:46,142 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-10 15:04:46,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932826798] [2020-07-10 15:04:46,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:46,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:46,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573494869] [2020-07-10 15:04:46,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:04:46,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:46,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:46,173 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-10 15:04:46,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:46,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:46,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:46,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:46,174 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2020-07-10 15:04:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:50,145 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2020-07-10 15:04:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:50,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:04:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-10 15:04:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-10 15:04:50,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2020-07-10 15:04:50,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:51,982 INFO L225 Difference]: With dead ends: 7052 [2020-07-10 15:04:51,983 INFO L226 Difference]: Without dead ends: 7050 [2020-07-10 15:04:51,984 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-10 15:04:51,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2020-07-10 15:04:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2020-07-10 15:04:53,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:53,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7050 states. Second operand 6536 states. [2020-07-10 15:04:53,645 INFO L74 IsIncluded]: Start isIncluded. First operand 7050 states. Second operand 6536 states. [2020-07-10 15:04:53,646 INFO L87 Difference]: Start difference. First operand 7050 states. Second operand 6536 states. [2020-07-10 15:04:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:55,214 INFO L93 Difference]: Finished difference Result 7050 states and 8455 transitions. [2020-07-10 15:04:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 8455 transitions. [2020-07-10 15:04:55,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:55,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:55,219 INFO L74 IsIncluded]: Start isIncluded. First operand 6536 states. Second operand 7050 states. [2020-07-10 15:04:55,219 INFO L87 Difference]: Start difference. First operand 6536 states. Second operand 7050 states. [2020-07-10 15:04:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:56,807 INFO L93 Difference]: Finished difference Result 7050 states and 8455 transitions. [2020-07-10 15:04:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 8455 transitions. [2020-07-10 15:04:56,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:56,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:56,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:56,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2020-07-10 15:04:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2020-07-10 15:04:58,199 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2020-07-10 15:04:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:58,199 INFO L479 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2020-07-10 15:04:58,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2020-07-10 15:04:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:04:58,202 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:58,202 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-10 15:04:58,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-10 15:04:58,203 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:58,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:58,203 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2020-07-10 15:04:58,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:58,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912384253] [2020-07-10 15:04:58,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:58,223 INFO L280 TraceCheckUtils]: 0: Hoare triple {147212#true} assume true; {147212#true} is VALID [2020-07-10 15:04:58,223 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {147212#true} {147212#true} #180#return; {147212#true} is VALID [2020-07-10 15:04:58,224 INFO L263 TraceCheckUtils]: 0: Hoare triple {147212#true} call ULTIMATE.init(); {147212#true} is VALID [2020-07-10 15:04:58,224 INFO L280 TraceCheckUtils]: 1: Hoare triple {147212#true} assume true; {147212#true} is VALID [2020-07-10 15:04:58,224 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {147212#true} {147212#true} #180#return; {147212#true} is VALID [2020-07-10 15:04:58,224 INFO L263 TraceCheckUtils]: 3: Hoare triple {147212#true} call #t~ret10 := main(); {147212#true} is VALID [2020-07-10 15:04:58,224 INFO L280 TraceCheckUtils]: 4: Hoare triple {147212#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {147212#true} is VALID [2020-07-10 15:04:58,224 INFO L280 TraceCheckUtils]: 5: Hoare triple {147212#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {147212#true} is VALID [2020-07-10 15:04:58,225 INFO L280 TraceCheckUtils]: 6: Hoare triple {147212#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {147212#true} is VALID [2020-07-10 15:04:58,225 INFO L280 TraceCheckUtils]: 7: Hoare triple {147212#true} assume !(0 != ~p1~0); {147212#true} is VALID [2020-07-10 15:04:58,225 INFO L280 TraceCheckUtils]: 8: Hoare triple {147212#true} assume !(0 != ~p2~0); {147212#true} is VALID [2020-07-10 15:04:58,225 INFO L280 TraceCheckUtils]: 9: Hoare triple {147212#true} assume !(0 != ~p3~0); {147212#true} is VALID [2020-07-10 15:04:58,225 INFO L280 TraceCheckUtils]: 10: Hoare triple {147212#true} assume !(0 != ~p4~0); {147212#true} is VALID [2020-07-10 15:04:58,225 INFO L280 TraceCheckUtils]: 11: Hoare triple {147212#true} assume !(0 != ~p5~0); {147212#true} is VALID [2020-07-10 15:04:58,225 INFO L280 TraceCheckUtils]: 12: Hoare triple {147212#true} assume !(0 != ~p6~0); {147212#true} is VALID [2020-07-10 15:04:58,225 INFO L280 TraceCheckUtils]: 13: Hoare triple {147212#true} assume !(0 != ~p7~0); {147212#true} is VALID [2020-07-10 15:04:58,226 INFO L280 TraceCheckUtils]: 14: Hoare triple {147212#true} assume !(0 != ~p8~0); {147212#true} is VALID [2020-07-10 15:04:58,226 INFO L280 TraceCheckUtils]: 15: Hoare triple {147212#true} assume 0 != ~p9~0;~lk9~0 := 1; {147216#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:58,226 INFO L280 TraceCheckUtils]: 16: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p1~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:58,227 INFO L280 TraceCheckUtils]: 17: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p2~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:58,227 INFO L280 TraceCheckUtils]: 18: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p3~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:58,227 INFO L280 TraceCheckUtils]: 19: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p4~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:58,228 INFO L280 TraceCheckUtils]: 20: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p5~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:58,228 INFO L280 TraceCheckUtils]: 21: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p6~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:58,229 INFO L280 TraceCheckUtils]: 22: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p7~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:58,229 INFO L280 TraceCheckUtils]: 23: Hoare triple {147216#(= 1 main_~lk9~0)} assume !(0 != ~p8~0); {147216#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:58,229 INFO L280 TraceCheckUtils]: 24: Hoare triple {147216#(= 1 main_~lk9~0)} assume 0 != ~p9~0; {147216#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:58,230 INFO L280 TraceCheckUtils]: 25: Hoare triple {147216#(= 1 main_~lk9~0)} assume 1 != ~lk9~0; {147213#false} is VALID [2020-07-10 15:04:58,230 INFO L280 TraceCheckUtils]: 26: Hoare triple {147213#false} assume !false; {147213#false} is VALID [2020-07-10 15:04:58,230 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-10 15:04:58,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912384253] [2020-07-10 15:04:58,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:58,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:58,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404750102] [2020-07-10 15:04:58,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:04:58,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:58,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:58,263 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-10 15:04:58,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:58,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:58,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:58,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:58,264 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2020-07-10 15:05:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:04,961 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2020-07-10 15:05:04,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:05:04,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:05:04,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:05:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2020-07-10 15:05:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:05:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2020-07-10 15:05:04,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2020-07-10 15:05:05,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:08,985 INFO L225 Difference]: With dead ends: 10634 [2020-07-10 15:05:08,985 INFO L226 Difference]: Without dead ends: 10632 [2020-07-10 15:05:08,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:05:08,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2020-07-10 15:05:10,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2020-07-10 15:05:10,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:10,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10632 states. Second operand 10120 states. [2020-07-10 15:05:10,764 INFO L74 IsIncluded]: Start isIncluded. First operand 10632 states. Second operand 10120 states. [2020-07-10 15:05:10,764 INFO L87 Difference]: Start difference. First operand 10632 states. Second operand 10120 states. [2020-07-10 15:05:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:14,235 INFO L93 Difference]: Finished difference Result 10632 states and 12166 transitions. [2020-07-10 15:05:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 12166 transitions. [2020-07-10 15:05:14,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:14,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:14,242 INFO L74 IsIncluded]: Start isIncluded. First operand 10120 states. Second operand 10632 states. [2020-07-10 15:05:14,242 INFO L87 Difference]: Start difference. First operand 10120 states. Second operand 10632 states. [2020-07-10 15:05:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:17,653 INFO L93 Difference]: Finished difference Result 10632 states and 12166 transitions. [2020-07-10 15:05:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 12166 transitions. [2020-07-10 15:05:17,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:17,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:17,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:17,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2020-07-10 15:05:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2020-07-10 15:05:21,207 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2020-07-10 15:05:21,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:21,208 INFO L479 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2020-07-10 15:05:21,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:05:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2020-07-10 15:05:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:05:21,216 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:21,216 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-10 15:05:21,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-10 15:05:21,216 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:21,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:21,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2020-07-10 15:05:21,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:21,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882055920] [2020-07-10 15:05:21,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:21,245 INFO L280 TraceCheckUtils]: 0: Hoare triple {190018#true} assume true; {190018#true} is VALID [2020-07-10 15:05:21,245 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {190018#true} {190018#true} #180#return; {190018#true} is VALID [2020-07-10 15:05:21,245 INFO L263 TraceCheckUtils]: 0: Hoare triple {190018#true} call ULTIMATE.init(); {190018#true} is VALID [2020-07-10 15:05:21,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {190018#true} assume true; {190018#true} is VALID [2020-07-10 15:05:21,246 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {190018#true} {190018#true} #180#return; {190018#true} is VALID [2020-07-10 15:05:21,246 INFO L263 TraceCheckUtils]: 3: Hoare triple {190018#true} call #t~ret10 := main(); {190018#true} is VALID [2020-07-10 15:05:21,246 INFO L280 TraceCheckUtils]: 4: Hoare triple {190018#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {190018#true} is VALID [2020-07-10 15:05:21,246 INFO L280 TraceCheckUtils]: 5: Hoare triple {190018#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {190018#true} is VALID [2020-07-10 15:05:21,247 INFO L280 TraceCheckUtils]: 6: Hoare triple {190018#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {190018#true} is VALID [2020-07-10 15:05:21,247 INFO L280 TraceCheckUtils]: 7: Hoare triple {190018#true} assume !(0 != ~p1~0); {190018#true} is VALID [2020-07-10 15:05:21,247 INFO L280 TraceCheckUtils]: 8: Hoare triple {190018#true} assume !(0 != ~p2~0); {190018#true} is VALID [2020-07-10 15:05:21,247 INFO L280 TraceCheckUtils]: 9: Hoare triple {190018#true} assume !(0 != ~p3~0); {190018#true} is VALID [2020-07-10 15:05:21,247 INFO L280 TraceCheckUtils]: 10: Hoare triple {190018#true} assume !(0 != ~p4~0); {190018#true} is VALID [2020-07-10 15:05:21,247 INFO L280 TraceCheckUtils]: 11: Hoare triple {190018#true} assume !(0 != ~p5~0); {190018#true} is VALID [2020-07-10 15:05:21,248 INFO L280 TraceCheckUtils]: 12: Hoare triple {190018#true} assume !(0 != ~p6~0); {190018#true} is VALID [2020-07-10 15:05:21,248 INFO L280 TraceCheckUtils]: 13: Hoare triple {190018#true} assume !(0 != ~p7~0); {190018#true} is VALID [2020-07-10 15:05:21,248 INFO L280 TraceCheckUtils]: 14: Hoare triple {190018#true} assume !(0 != ~p8~0); {190018#true} is VALID [2020-07-10 15:05:21,249 INFO L280 TraceCheckUtils]: 15: Hoare triple {190018#true} assume !(0 != ~p9~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:21,249 INFO L280 TraceCheckUtils]: 16: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p1~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:21,257 INFO L280 TraceCheckUtils]: 17: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p2~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:21,257 INFO L280 TraceCheckUtils]: 18: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p3~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:21,265 INFO L280 TraceCheckUtils]: 19: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p4~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:21,266 INFO L280 TraceCheckUtils]: 20: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p5~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:21,266 INFO L280 TraceCheckUtils]: 21: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p6~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:21,266 INFO L280 TraceCheckUtils]: 22: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p7~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:21,267 INFO L280 TraceCheckUtils]: 23: Hoare triple {190022#(= 0 main_~p9~0)} assume !(0 != ~p8~0); {190022#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:21,267 INFO L280 TraceCheckUtils]: 24: Hoare triple {190022#(= 0 main_~p9~0)} assume 0 != ~p9~0; {190019#false} is VALID [2020-07-10 15:05:21,267 INFO L280 TraceCheckUtils]: 25: Hoare triple {190019#false} assume 1 != ~lk9~0; {190019#false} is VALID [2020-07-10 15:05:21,268 INFO L280 TraceCheckUtils]: 26: Hoare triple {190019#false} assume !false; {190019#false} is VALID [2020-07-10 15:05:21,268 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-10 15:05:21,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882055920] [2020-07-10 15:05:21,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:21,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:05:21,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779684326] [2020-07-10 15:05:21,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:05:21,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:21,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:05:21,294 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-10 15:05:21,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:05:21,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:21,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:05:21,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:05:21,296 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2020-07-10 15:05:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:44,593 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2020-07-10 15:05:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:05:44,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:05:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:05:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-10 15:05:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:05:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-10 15:05:44,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2020-07-10 15:05:44,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:44,741 INFO L225 Difference]: With dead ends: 22664 [2020-07-10 15:05:44,741 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:05:44,768 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-10 15:05:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:05:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:05:44,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:44,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:44,769 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:44,769 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:44,770 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:05:44,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:05:44,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:44,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:44,770 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:44,771 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:44,771 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:05:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:05:44,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:44,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:44,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:44,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:05:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:05:44,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2020-07-10 15:05:44,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:44,772 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:05:44,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:05:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:05:44,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:44,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-10 15:05:44,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:05:44,815 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:05:44,815 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:05:44,816 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:05:44,816 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:05:44,816 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:05:44,816 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:05:44,816 INFO L268 CegarLoopResult]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,816 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2020-07-10 15:05:44,816 INFO L268 CegarLoopResult]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,816 INFO L268 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-07-10 15:05:44,817 INFO L268 CegarLoopResult]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,817 INFO L268 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2020-07-10 15:05:44,817 INFO L268 CegarLoopResult]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,817 INFO L268 CegarLoopResult]: For program point L61(lines 61 63) no Hoare annotation was computed. [2020-07-10 15:05:44,817 INFO L268 CegarLoopResult]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,817 INFO L268 CegarLoopResult]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,817 INFO L268 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2020-07-10 15:05:44,817 INFO L271 CegarLoopResult]: At program point L145(lines 5 149) the Hoare annotation is: true [2020-07-10 15:05:44,818 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2020-07-10 15:05:44,818 INFO L268 CegarLoopResult]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,818 INFO L268 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2020-07-10 15:05:44,818 INFO L268 CegarLoopResult]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,818 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2020-07-10 15:05:44,818 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2020-07-10 15:05:44,818 INFO L268 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2020-07-10 15:05:44,818 INFO L268 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2020-07-10 15:05:44,819 INFO L268 CegarLoopResult]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,819 INFO L268 CegarLoopResult]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,819 INFO L268 CegarLoopResult]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,819 INFO L271 CegarLoopResult]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2020-07-10 15:05:44,819 INFO L268 CegarLoopResult]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,819 INFO L268 CegarLoopResult]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,819 INFO L268 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2020-07-10 15:05:44,819 INFO L268 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-07-10 15:05:44,820 INFO L264 CegarLoopResult]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2020-07-10 15:05:44,820 INFO L268 CegarLoopResult]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,820 INFO L268 CegarLoopResult]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,820 INFO L268 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2020-07-10 15:05:44,820 INFO L268 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-07-10 15:05:44,820 INFO L268 CegarLoopResult]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,820 INFO L268 CegarLoopResult]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2020-07-10 15:05:44,825 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:05:44,826 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:05:44,826 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:05:44,826 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 15:05:44,826 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:05:44,826 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:05:44,826 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 15:05:44,826 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 15:05:44,827 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:05:44,827 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-10 15:05:44,827 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-10 15:05:44,827 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:05:44,827 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2020-07-10 15:05:44,827 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2020-07-10 15:05:44,827 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-10 15:05:44,827 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-10 15:05:44,827 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2020-07-10 15:05:44,827 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2020-07-10 15:05:44,828 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2020-07-10 15:05:44,828 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2020-07-10 15:05:44,828 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-10 15:05:44,828 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-10 15:05:44,828 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2020-07-10 15:05:44,828 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2020-07-10 15:05:44,828 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2020-07-10 15:05:44,828 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2020-07-10 15:05:44,828 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2020-07-10 15:05:44,828 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2020-07-10 15:05:44,829 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2020-07-10 15:05:44,829 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2020-07-10 15:05:44,829 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2020-07-10 15:05:44,829 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2020-07-10 15:05:44,829 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2020-07-10 15:05:44,829 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2020-07-10 15:05:44,829 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:05:44,829 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:05:44,830 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2020-07-10 15:05:44,830 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2020-07-10 15:05:44,830 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2020-07-10 15:05:44,830 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2020-07-10 15:05:44,830 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2020-07-10 15:05:44,830 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2020-07-10 15:05:44,830 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2020-07-10 15:05:44,830 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2020-07-10 15:05:44,831 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2020-07-10 15:05:44,831 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2020-07-10 15:05:44,831 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2020-07-10 15:05:44,831 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2020-07-10 15:05:44,831 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2020-07-10 15:05:44,831 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2020-07-10 15:05:44,831 WARN L170 areAnnotationChecker]: L119-1 has no Hoare annotation [2020-07-10 15:05:44,831 WARN L170 areAnnotationChecker]: L119-1 has no Hoare annotation [2020-07-10 15:05:44,831 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2020-07-10 15:05:44,832 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2020-07-10 15:05:44,832 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2020-07-10 15:05:44,832 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2020-07-10 15:05:44,832 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2020-07-10 15:05:44,832 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2020-07-10 15:05:44,832 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2020-07-10 15:05:44,832 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2020-07-10 15:05:44,832 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2020-07-10 15:05:44,833 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2020-07-10 15:05:44,833 WARN L170 areAnnotationChecker]: L134-1 has no Hoare annotation [2020-07-10 15:05:44,833 WARN L170 areAnnotationChecker]: L134-1 has no Hoare annotation [2020-07-10 15:05:44,833 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2020-07-10 15:05:44,833 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2020-07-10 15:05:44,833 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:05:44,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:05:44 BoogieIcfgContainer [2020-07-10 15:05:44,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:05:44,845 INFO L168 Benchmark]: Toolchain (without parser) took 96953.88 ms. Allocated memory was 138.4 MB in the beginning and 628.1 MB in the end (delta: 489.7 MB). Free memory was 102.2 MB in the beginning and 122.2 MB in the end (delta: -19.9 MB). Peak memory consumption was 469.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:44,846 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 138.4 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:05:44,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.92 ms. Allocated memory is still 138.4 MB. Free memory was 102.0 MB in the beginning and 91.1 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:44,847 INFO L168 Benchmark]: Boogie Preprocessor took 125.62 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 91.1 MB in the beginning and 181.5 MB in the end (delta: -90.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:44,847 INFO L168 Benchmark]: RCFGBuilder took 596.60 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 152.5 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:44,848 INFO L168 Benchmark]: TraceAbstraction took 95942.94 ms. Allocated memory was 202.4 MB in the beginning and 628.1 MB in the end (delta: 425.7 MB). Free memory was 151.9 MB in the beginning and 122.2 MB in the end (delta: 29.7 MB). Peak memory consumption was 455.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:44,849 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 138.4 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 282.92 ms. Allocated memory is still 138.4 MB. Free memory was 102.0 MB in the beginning and 91.1 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.62 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 91.1 MB in the beginning and 181.5 MB in the end (delta: -90.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 596.60 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 152.5 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95942.94 ms. Allocated memory was 202.4 MB in the beginning and 628.1 MB in the end (delta: 425.7 MB). Free memory was 151.9 MB in the beginning and 122.2 MB in the end (delta: 29.7 MB). Peak memory consumption was 455.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 95.8s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 60.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 32.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...