/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:26:14,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:26:14,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:26:14,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:26:14,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:26:14,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:26:14,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:26:14,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:26:14,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:26:14,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:26:14,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:26:14,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:26:14,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:26:14,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:26:14,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:26:14,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:26:14,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:26:14,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:26:14,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:26:14,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:26:14,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:26:14,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:26:14,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:26:14,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:26:14,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:26:14,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:26:14,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:26:14,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:26:14,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:26:14,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:26:14,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:26:14,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:26:14,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:26:14,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:26:14,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:26:14,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:26:14,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:26:14,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:26:14,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:26:14,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:26:14,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:26:14,883 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:26:14,897 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:26:14,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:26:14,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:26:14,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:26:14,899 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:26:14,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:26:14,900 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:26:14,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:26:14,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:26:14,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:26:14,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:26:14,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:26:14,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:26:14,901 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:26:14,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:26:14,901 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:26:14,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:26:14,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:26:14,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:26:14,902 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:26:14,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:26:14,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:26:14,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:26:14,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:26:14,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:26:14,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:26:14,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:26:14,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:26:14,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:26:14,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:26:15,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:26:15,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:26:15,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:26:15,218 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:26:15,218 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:26:15,219 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-07-17 22:26:15,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a50971724/1834e742c5fb48b99d7e82182b593fea/FLAG27b4f3c38 [2020-07-17 22:26:15,777 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:26:15,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-07-17 22:26:15,786 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a50971724/1834e742c5fb48b99d7e82182b593fea/FLAG27b4f3c38 [2020-07-17 22:26:16,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a50971724/1834e742c5fb48b99d7e82182b593fea [2020-07-17 22:26:16,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:26:16,282 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:26:16,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:16,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:26:16,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:26:16,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:16" (1/1) ... [2020-07-17 22:26:16,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42dc37eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:16, skipping insertion in model container [2020-07-17 22:26:16,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:16" (1/1) ... [2020-07-17 22:26:16,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:26:16,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:26:16,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:16,505 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:26:16,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:16,543 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:26:16,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:16 WrapperNode [2020-07-17 22:26:16,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:16,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:26:16,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:26:16,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:26:16,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:16" (1/1) ... [2020-07-17 22:26:16,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:16" (1/1) ... [2020-07-17 22:26:16,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:16" (1/1) ... [2020-07-17 22:26:16,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:16" (1/1) ... [2020-07-17 22:26:16,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:16" (1/1) ... [2020-07-17 22:26:16,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:16" (1/1) ... [2020-07-17 22:26:16,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:16" (1/1) ... [2020-07-17 22:26:16,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:26:16,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:26:16,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:26:16,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:26:16,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:26:16,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:26:16,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:26:16,751 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:26:16,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:26:16,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:26:16,752 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:26:16,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:26:16,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:26:17,093 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:26:17,093 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:26:17,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:17 BoogieIcfgContainer [2020-07-17 22:26:17,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:26:17,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:26:17,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:26:17,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:26:17,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:26:16" (1/3) ... [2020-07-17 22:26:17,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6c7ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:17, skipping insertion in model container [2020-07-17 22:26:17,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:16" (2/3) ... [2020-07-17 22:26:17,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6c7ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:17, skipping insertion in model container [2020-07-17 22:26:17,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:17" (3/3) ... [2020-07-17 22:26:17,112 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-07-17 22:26:17,127 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:26:17,137 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:26:17,158 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:26:17,194 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:26:17,194 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:26:17,195 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:26:17,195 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:26:17,195 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:26:17,195 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:26:17,195 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:26:17,196 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:26:17,238 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-17 22:26:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:26:17,247 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:17,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:17,249 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:17,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:17,256 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2020-07-17 22:26:17,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:17,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81946697] [2020-07-17 22:26:17,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:17,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-17 22:26:17,491 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35#true} {35#true} #129#return; {35#true} is VALID [2020-07-17 22:26:17,493 INFO L263 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2020-07-17 22:26:17,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-17 22:26:17,494 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #129#return; {35#true} is VALID [2020-07-17 22:26:17,495 INFO L263 TraceCheckUtils]: 3: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2020-07-17 22:26:17,496 INFO L280 TraceCheckUtils]: 4: Hoare triple {35#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;havoc ~cond~0; {35#true} is VALID [2020-07-17 22:26:17,496 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {35#true} is VALID [2020-07-17 22:26:17,497 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {35#true} is VALID [2020-07-17 22:26:17,498 INFO L280 TraceCheckUtils]: 7: Hoare triple {35#true} assume 0 != ~p1~0;~lk1~0 := 1; {39#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:17,500 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {39#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:17,502 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {39#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:17,505 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {39#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:17,506 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {39#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:17,508 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {39#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:17,510 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {39#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:17,511 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {36#false} is VALID [2020-07-17 22:26:17,511 INFO L280 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-17 22:26:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:17,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81946697] [2020-07-17 22:26:17,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:17,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:17,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430163558] [2020-07-17 22:26:17,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:26:17,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:17,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:17,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:17,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:17,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:17,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:17,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:17,582 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-07-17 22:26:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:17,781 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2020-07-17 22:26:17,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:17,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:26:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-17 22:26:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-17 22:26:17,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2020-07-17 22:26:18,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:18,040 INFO L225 Difference]: With dead ends: 63 [2020-07-17 22:26:18,040 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:26:18,050 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:26:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2020-07-17 22:26:18,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:18,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 34 states. [2020-07-17 22:26:18,102 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 34 states. [2020-07-17 22:26:18,102 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 34 states. [2020-07-17 22:26:18,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,110 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2020-07-17 22:26:18,110 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2020-07-17 22:26:18,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:18,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:18,112 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 48 states. [2020-07-17 22:26:18,112 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 48 states. [2020-07-17 22:26:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,119 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2020-07-17 22:26:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2020-07-17 22:26:18,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:18,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:18,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:18,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-17 22:26:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2020-07-17 22:26:18,127 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2020-07-17 22:26:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:18,127 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2020-07-17 22:26:18,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2020-07-17 22:26:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:26:18,129 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:18,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:18,130 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:26:18,130 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:18,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2020-07-17 22:26:18,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:18,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102354574] [2020-07-17 22:26:18,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,224 INFO L280 TraceCheckUtils]: 0: Hoare triple {253#true} assume true; {253#true} is VALID [2020-07-17 22:26:18,225 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {253#true} {253#true} #129#return; {253#true} is VALID [2020-07-17 22:26:18,225 INFO L263 TraceCheckUtils]: 0: Hoare triple {253#true} call ULTIMATE.init(); {253#true} is VALID [2020-07-17 22:26:18,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {253#true} assume true; {253#true} is VALID [2020-07-17 22:26:18,226 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {253#true} {253#true} #129#return; {253#true} is VALID [2020-07-17 22:26:18,226 INFO L263 TraceCheckUtils]: 3: Hoare triple {253#true} call #t~ret7 := main(); {253#true} is VALID [2020-07-17 22:26:18,226 INFO L280 TraceCheckUtils]: 4: Hoare triple {253#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;havoc ~cond~0; {253#true} is VALID [2020-07-17 22:26:18,227 INFO L280 TraceCheckUtils]: 5: Hoare triple {253#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {253#true} is VALID [2020-07-17 22:26:18,227 INFO L280 TraceCheckUtils]: 6: Hoare triple {253#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {253#true} is VALID [2020-07-17 22:26:18,228 INFO L280 TraceCheckUtils]: 7: Hoare triple {253#true} assume !(0 != ~p1~0); {257#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:18,235 INFO L280 TraceCheckUtils]: 8: Hoare triple {257#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {257#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:18,236 INFO L280 TraceCheckUtils]: 9: Hoare triple {257#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {257#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:18,238 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {257#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:18,238 INFO L280 TraceCheckUtils]: 11: Hoare triple {257#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {257#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:18,242 INFO L280 TraceCheckUtils]: 12: Hoare triple {257#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {257#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:18,242 INFO L280 TraceCheckUtils]: 13: Hoare triple {257#(= 0 main_~p1~0)} assume 0 != ~p1~0; {254#false} is VALID [2020-07-17 22:26:18,243 INFO L280 TraceCheckUtils]: 14: Hoare triple {254#false} assume 1 != ~lk1~0; {254#false} is VALID [2020-07-17 22:26:18,243 INFO L280 TraceCheckUtils]: 15: Hoare triple {254#false} assume !false; {254#false} is VALID [2020-07-17 22:26:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:18,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102354574] [2020-07-17 22:26:18,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:18,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:18,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010133319] [2020-07-17 22:26:18,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:26:18,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:18,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:18,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:18,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:18,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:18,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:18,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:18,274 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2020-07-17 22:26:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,432 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2020-07-17 22:26:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:18,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:26:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2020-07-17 22:26:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2020-07-17 22:26:18,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 119 transitions. [2020-07-17 22:26:18,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:18,600 INFO L225 Difference]: With dead ends: 77 [2020-07-17 22:26:18,600 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:26:18,604 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:26:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-07-17 22:26:18,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:18,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2020-07-17 22:26:18,618 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2020-07-17 22:26:18,619 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2020-07-17 22:26:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,624 INFO L93 Difference]: Finished difference Result 48 states and 78 transitions. [2020-07-17 22:26:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 78 transitions. [2020-07-17 22:26:18,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:18,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:18,630 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2020-07-17 22:26:18,630 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2020-07-17 22:26:18,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,637 INFO L93 Difference]: Finished difference Result 48 states and 78 transitions. [2020-07-17 22:26:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 78 transitions. [2020-07-17 22:26:18,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:18,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:18,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:18,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-17 22:26:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2020-07-17 22:26:18,644 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2020-07-17 22:26:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:18,644 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2020-07-17 22:26:18,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2020-07-17 22:26:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:26:18,650 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:18,650 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:18,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:26:18,650 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:18,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:18,651 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2020-07-17 22:26:18,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:18,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714949264] [2020-07-17 22:26:18,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,723 INFO L280 TraceCheckUtils]: 0: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-17 22:26:18,723 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {496#true} {496#true} #129#return; {496#true} is VALID [2020-07-17 22:26:18,724 INFO L263 TraceCheckUtils]: 0: Hoare triple {496#true} call ULTIMATE.init(); {496#true} is VALID [2020-07-17 22:26:18,724 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-17 22:26:18,724 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {496#true} {496#true} #129#return; {496#true} is VALID [2020-07-17 22:26:18,725 INFO L263 TraceCheckUtils]: 3: Hoare triple {496#true} call #t~ret7 := main(); {496#true} is VALID [2020-07-17 22:26:18,725 INFO L280 TraceCheckUtils]: 4: Hoare triple {496#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;havoc ~cond~0; {496#true} is VALID [2020-07-17 22:26:18,725 INFO L280 TraceCheckUtils]: 5: Hoare triple {496#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {496#true} is VALID [2020-07-17 22:26:18,725 INFO L280 TraceCheckUtils]: 6: Hoare triple {496#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {496#true} is VALID [2020-07-17 22:26:18,727 INFO L280 TraceCheckUtils]: 7: Hoare triple {496#true} assume 0 != ~p1~0;~lk1~0 := 1; {500#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:18,727 INFO L280 TraceCheckUtils]: 8: Hoare triple {500#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {500#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:18,728 INFO L280 TraceCheckUtils]: 9: Hoare triple {500#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {500#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:18,729 INFO L280 TraceCheckUtils]: 10: Hoare triple {500#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {500#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:18,729 INFO L280 TraceCheckUtils]: 11: Hoare triple {500#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {500#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:18,730 INFO L280 TraceCheckUtils]: 12: Hoare triple {500#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {500#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:18,731 INFO L280 TraceCheckUtils]: 13: Hoare triple {500#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {497#false} is VALID [2020-07-17 22:26:18,731 INFO L280 TraceCheckUtils]: 14: Hoare triple {497#false} assume 0 != ~p2~0; {497#false} is VALID [2020-07-17 22:26:18,732 INFO L280 TraceCheckUtils]: 15: Hoare triple {497#false} assume 1 != ~lk2~0; {497#false} is VALID [2020-07-17 22:26:18,732 INFO L280 TraceCheckUtils]: 16: Hoare triple {497#false} assume !false; {497#false} is VALID [2020-07-17 22:26:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:18,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714949264] [2020-07-17 22:26:18,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:18,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:18,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515881123] [2020-07-17 22:26:18,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:18,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:18,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:18,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:18,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:18,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:18,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:18,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:18,756 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2020-07-17 22:26:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,854 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2020-07-17 22:26:18,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:18,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-17 22:26:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-17 22:26:18,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2020-07-17 22:26:18,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:18,992 INFO L225 Difference]: With dead ends: 72 [2020-07-17 22:26:18,992 INFO L226 Difference]: Without dead ends: 51 [2020-07-17 22:26:18,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-17 22:26:19,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2020-07-17 22:26:19,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:19,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2020-07-17 22:26:19,010 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2020-07-17 22:26:19,010 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2020-07-17 22:26:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,014 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2020-07-17 22:26:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 80 transitions. [2020-07-17 22:26:19,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,015 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2020-07-17 22:26:19,015 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2020-07-17 22:26:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,019 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2020-07-17 22:26:19,019 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 80 transitions. [2020-07-17 22:26:19,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:19,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-17 22:26:19,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2020-07-17 22:26:19,024 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2020-07-17 22:26:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:19,024 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2020-07-17 22:26:19,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2020-07-17 22:26:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:26:19,026 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:19,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:19,026 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:26:19,026 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2020-07-17 22:26:19,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:19,030 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158111553] [2020-07-17 22:26:19,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,073 INFO L280 TraceCheckUtils]: 0: Hoare triple {745#true} assume true; {745#true} is VALID [2020-07-17 22:26:19,073 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {745#true} {745#true} #129#return; {745#true} is VALID [2020-07-17 22:26:19,074 INFO L263 TraceCheckUtils]: 0: Hoare triple {745#true} call ULTIMATE.init(); {745#true} is VALID [2020-07-17 22:26:19,074 INFO L280 TraceCheckUtils]: 1: Hoare triple {745#true} assume true; {745#true} is VALID [2020-07-17 22:26:19,074 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {745#true} {745#true} #129#return; {745#true} is VALID [2020-07-17 22:26:19,075 INFO L263 TraceCheckUtils]: 3: Hoare triple {745#true} call #t~ret7 := main(); {745#true} is VALID [2020-07-17 22:26:19,075 INFO L280 TraceCheckUtils]: 4: Hoare triple {745#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;havoc ~cond~0; {745#true} is VALID [2020-07-17 22:26:19,076 INFO L280 TraceCheckUtils]: 5: Hoare triple {745#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {745#true} is VALID [2020-07-17 22:26:19,076 INFO L280 TraceCheckUtils]: 6: Hoare triple {745#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {745#true} is VALID [2020-07-17 22:26:19,076 INFO L280 TraceCheckUtils]: 7: Hoare triple {745#true} assume !(0 != ~p1~0); {745#true} is VALID [2020-07-17 22:26:19,077 INFO L280 TraceCheckUtils]: 8: Hoare triple {745#true} assume 0 != ~p2~0;~lk2~0 := 1; {749#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:19,078 INFO L280 TraceCheckUtils]: 9: Hoare triple {749#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {749#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:19,079 INFO L280 TraceCheckUtils]: 10: Hoare triple {749#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {749#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:19,079 INFO L280 TraceCheckUtils]: 11: Hoare triple {749#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {749#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:19,080 INFO L280 TraceCheckUtils]: 12: Hoare triple {749#(= 1 main_~lk2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {749#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:19,081 INFO L280 TraceCheckUtils]: 13: Hoare triple {749#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {749#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:19,082 INFO L280 TraceCheckUtils]: 14: Hoare triple {749#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {749#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:19,083 INFO L280 TraceCheckUtils]: 15: Hoare triple {749#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {746#false} is VALID [2020-07-17 22:26:19,083 INFO L280 TraceCheckUtils]: 16: Hoare triple {746#false} assume !false; {746#false} is VALID [2020-07-17 22:26:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:19,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158111553] [2020-07-17 22:26:19,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:19,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:19,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132705727] [2020-07-17 22:26:19,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:19,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:19,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:19,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:19,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:19,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:19,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,110 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2020-07-17 22:26:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,210 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2020-07-17 22:26:19,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:19,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:19,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2020-07-17 22:26:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2020-07-17 22:26:19,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2020-07-17 22:26:19,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,304 INFO L225 Difference]: With dead ends: 88 [2020-07-17 22:26:19,304 INFO L226 Difference]: Without dead ends: 86 [2020-07-17 22:26:19,305 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-17 22:26:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2020-07-17 22:26:19,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:19,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 64 states. [2020-07-17 22:26:19,317 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 64 states. [2020-07-17 22:26:19,317 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 64 states. [2020-07-17 22:26:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,321 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2020-07-17 22:26:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 141 transitions. [2020-07-17 22:26:19,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,323 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 86 states. [2020-07-17 22:26:19,323 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 86 states. [2020-07-17 22:26:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,328 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2020-07-17 22:26:19,328 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 141 transitions. [2020-07-17 22:26:19,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:19,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-17 22:26:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2020-07-17 22:26:19,333 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2020-07-17 22:26:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:19,333 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2020-07-17 22:26:19,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2020-07-17 22:26:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:26:19,334 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:19,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:19,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:26:19,335 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:19,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:19,335 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2020-07-17 22:26:19,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:19,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203271278] [2020-07-17 22:26:19,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {1096#true} assume true; {1096#true} is VALID [2020-07-17 22:26:19,373 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1096#true} {1096#true} #129#return; {1096#true} is VALID [2020-07-17 22:26:19,373 INFO L263 TraceCheckUtils]: 0: Hoare triple {1096#true} call ULTIMATE.init(); {1096#true} is VALID [2020-07-17 22:26:19,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {1096#true} assume true; {1096#true} is VALID [2020-07-17 22:26:19,374 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1096#true} {1096#true} #129#return; {1096#true} is VALID [2020-07-17 22:26:19,374 INFO L263 TraceCheckUtils]: 3: Hoare triple {1096#true} call #t~ret7 := main(); {1096#true} is VALID [2020-07-17 22:26:19,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {1096#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;havoc ~cond~0; {1096#true} is VALID [2020-07-17 22:26:19,374 INFO L280 TraceCheckUtils]: 5: Hoare triple {1096#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {1096#true} is VALID [2020-07-17 22:26:19,375 INFO L280 TraceCheckUtils]: 6: Hoare triple {1096#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1096#true} is VALID [2020-07-17 22:26:19,375 INFO L280 TraceCheckUtils]: 7: Hoare triple {1096#true} assume !(0 != ~p1~0); {1096#true} is VALID [2020-07-17 22:26:19,376 INFO L280 TraceCheckUtils]: 8: Hoare triple {1096#true} assume !(0 != ~p2~0); {1100#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:19,381 INFO L280 TraceCheckUtils]: 9: Hoare triple {1100#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1100#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:19,382 INFO L280 TraceCheckUtils]: 10: Hoare triple {1100#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1100#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:19,382 INFO L280 TraceCheckUtils]: 11: Hoare triple {1100#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1100#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:19,383 INFO L280 TraceCheckUtils]: 12: Hoare triple {1100#(= 0 main_~p2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1100#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:19,384 INFO L280 TraceCheckUtils]: 13: Hoare triple {1100#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1100#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:19,384 INFO L280 TraceCheckUtils]: 14: Hoare triple {1100#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1097#false} is VALID [2020-07-17 22:26:19,385 INFO L280 TraceCheckUtils]: 15: Hoare triple {1097#false} assume 1 != ~lk2~0; {1097#false} is VALID [2020-07-17 22:26:19,385 INFO L280 TraceCheckUtils]: 16: Hoare triple {1097#false} assume !false; {1097#false} is VALID [2020-07-17 22:26:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:19,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203271278] [2020-07-17 22:26:19,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:19,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:19,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000284253] [2020-07-17 22:26:19,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:19,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:19,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:19,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:19,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:19,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:19,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,406 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2020-07-17 22:26:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,497 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2020-07-17 22:26:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:19,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:19,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-17 22:26:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-17 22:26:19,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2020-07-17 22:26:19,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,626 INFO L225 Difference]: With dead ends: 144 [2020-07-17 22:26:19,626 INFO L226 Difference]: Without dead ends: 88 [2020-07-17 22:26:19,627 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-17 22:26:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2020-07-17 22:26:19,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:19,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 86 states. [2020-07-17 22:26:19,652 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 86 states. [2020-07-17 22:26:19,652 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 86 states. [2020-07-17 22:26:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,658 INFO L93 Difference]: Finished difference Result 88 states and 139 transitions. [2020-07-17 22:26:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 139 transitions. [2020-07-17 22:26:19,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,660 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 88 states. [2020-07-17 22:26:19,660 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 88 states. [2020-07-17 22:26:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,666 INFO L93 Difference]: Finished difference Result 88 states and 139 transitions. [2020-07-17 22:26:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 139 transitions. [2020-07-17 22:26:19,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:19,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-17 22:26:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2020-07-17 22:26:19,672 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2020-07-17 22:26:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:19,672 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2020-07-17 22:26:19,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2020-07-17 22:26:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:26:19,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:19,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:19,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:26:19,674 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:19,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:19,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2020-07-17 22:26:19,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:19,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287194120] [2020-07-17 22:26:19,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {1533#true} assume true; {1533#true} is VALID [2020-07-17 22:26:19,748 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1533#true} {1533#true} #129#return; {1533#true} is VALID [2020-07-17 22:26:19,749 INFO L263 TraceCheckUtils]: 0: Hoare triple {1533#true} call ULTIMATE.init(); {1533#true} is VALID [2020-07-17 22:26:19,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {1533#true} assume true; {1533#true} is VALID [2020-07-17 22:26:19,750 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1533#true} {1533#true} #129#return; {1533#true} is VALID [2020-07-17 22:26:19,750 INFO L263 TraceCheckUtils]: 3: Hoare triple {1533#true} call #t~ret7 := main(); {1533#true} is VALID [2020-07-17 22:26:19,750 INFO L280 TraceCheckUtils]: 4: Hoare triple {1533#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;havoc ~cond~0; {1533#true} is VALID [2020-07-17 22:26:19,750 INFO L280 TraceCheckUtils]: 5: Hoare triple {1533#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {1533#true} is VALID [2020-07-17 22:26:19,751 INFO L280 TraceCheckUtils]: 6: Hoare triple {1533#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1533#true} is VALID [2020-07-17 22:26:19,751 INFO L280 TraceCheckUtils]: 7: Hoare triple {1533#true} assume !(0 != ~p1~0); {1533#true} is VALID [2020-07-17 22:26:19,753 INFO L280 TraceCheckUtils]: 8: Hoare triple {1533#true} assume 0 != ~p2~0;~lk2~0 := 1; {1537#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:19,759 INFO L280 TraceCheckUtils]: 9: Hoare triple {1537#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {1537#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:19,760 INFO L280 TraceCheckUtils]: 10: Hoare triple {1537#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {1537#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:19,761 INFO L280 TraceCheckUtils]: 11: Hoare triple {1537#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {1537#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:19,762 INFO L280 TraceCheckUtils]: 12: Hoare triple {1537#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {1537#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:19,762 INFO L280 TraceCheckUtils]: 13: Hoare triple {1537#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {1537#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:19,763 INFO L280 TraceCheckUtils]: 14: Hoare triple {1537#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {1534#false} is VALID [2020-07-17 22:26:19,764 INFO L280 TraceCheckUtils]: 15: Hoare triple {1534#false} assume 0 != ~p3~0; {1534#false} is VALID [2020-07-17 22:26:19,764 INFO L280 TraceCheckUtils]: 16: Hoare triple {1534#false} assume 1 != ~lk3~0; {1534#false} is VALID [2020-07-17 22:26:19,764 INFO L280 TraceCheckUtils]: 17: Hoare triple {1534#false} assume !false; {1534#false} is VALID [2020-07-17 22:26:19,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:19,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287194120] [2020-07-17 22:26:19,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:19,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:19,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840143517] [2020-07-17 22:26:19,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:19,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:19,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:19,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:19,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:19,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:19,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,788 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2020-07-17 22:26:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,882 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2020-07-17 22:26:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:19,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2020-07-17 22:26:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2020-07-17 22:26:19,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2020-07-17 22:26:19,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,994 INFO L225 Difference]: With dead ends: 129 [2020-07-17 22:26:19,994 INFO L226 Difference]: Without dead ends: 90 [2020-07-17 22:26:19,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-17 22:26:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2020-07-17 22:26:20,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:20,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2020-07-17 22:26:20,030 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2020-07-17 22:26:20,030 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2020-07-17 22:26:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,036 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2020-07-17 22:26:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2020-07-17 22:26:20,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,037 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2020-07-17 22:26:20,037 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2020-07-17 22:26:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,041 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2020-07-17 22:26:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2020-07-17 22:26:20,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:20,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-17 22:26:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2020-07-17 22:26:20,047 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2020-07-17 22:26:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:20,048 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2020-07-17 22:26:20,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2020-07-17 22:26:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:26:20,048 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:20,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:20,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:26:20,049 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:20,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:20,049 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2020-07-17 22:26:20,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:20,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063842493] [2020-07-17 22:26:20,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:20,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {1961#true} assume true; {1961#true} is VALID [2020-07-17 22:26:20,104 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1961#true} {1961#true} #129#return; {1961#true} is VALID [2020-07-17 22:26:20,104 INFO L263 TraceCheckUtils]: 0: Hoare triple {1961#true} call ULTIMATE.init(); {1961#true} is VALID [2020-07-17 22:26:20,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {1961#true} assume true; {1961#true} is VALID [2020-07-17 22:26:20,105 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1961#true} {1961#true} #129#return; {1961#true} is VALID [2020-07-17 22:26:20,105 INFO L263 TraceCheckUtils]: 3: Hoare triple {1961#true} call #t~ret7 := main(); {1961#true} is VALID [2020-07-17 22:26:20,105 INFO L280 TraceCheckUtils]: 4: Hoare triple {1961#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;havoc ~cond~0; {1961#true} is VALID [2020-07-17 22:26:20,105 INFO L280 TraceCheckUtils]: 5: Hoare triple {1961#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {1961#true} is VALID [2020-07-17 22:26:20,106 INFO L280 TraceCheckUtils]: 6: Hoare triple {1961#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1961#true} is VALID [2020-07-17 22:26:20,106 INFO L280 TraceCheckUtils]: 7: Hoare triple {1961#true} assume !(0 != ~p1~0); {1961#true} is VALID [2020-07-17 22:26:20,106 INFO L280 TraceCheckUtils]: 8: Hoare triple {1961#true} assume !(0 != ~p2~0); {1961#true} is VALID [2020-07-17 22:26:20,107 INFO L280 TraceCheckUtils]: 9: Hoare triple {1961#true} assume 0 != ~p3~0;~lk3~0 := 1; {1965#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:20,108 INFO L280 TraceCheckUtils]: 10: Hoare triple {1965#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1965#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:20,108 INFO L280 TraceCheckUtils]: 11: Hoare triple {1965#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1965#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:20,109 INFO L280 TraceCheckUtils]: 12: Hoare triple {1965#(= 1 main_~lk3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1965#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:20,109 INFO L280 TraceCheckUtils]: 13: Hoare triple {1965#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {1965#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:20,110 INFO L280 TraceCheckUtils]: 14: Hoare triple {1965#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {1965#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:20,110 INFO L280 TraceCheckUtils]: 15: Hoare triple {1965#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {1965#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:20,111 INFO L280 TraceCheckUtils]: 16: Hoare triple {1965#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {1962#false} is VALID [2020-07-17 22:26:20,111 INFO L280 TraceCheckUtils]: 17: Hoare triple {1962#false} assume !false; {1962#false} is VALID [2020-07-17 22:26:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:20,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063842493] [2020-07-17 22:26:20,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:20,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:20,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691706913] [2020-07-17 22:26:20,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:20,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:20,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:20,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:20,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:20,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:20,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:20,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:20,131 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2020-07-17 22:26:20,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,233 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2020-07-17 22:26:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:20,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:20,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-17 22:26:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-17 22:26:20,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2020-07-17 22:26:20,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:20,323 INFO L225 Difference]: With dead ends: 156 [2020-07-17 22:26:20,323 INFO L226 Difference]: Without dead ends: 154 [2020-07-17 22:26:20,324 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:20,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-07-17 22:26:20,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2020-07-17 22:26:20,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:20,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 120 states. [2020-07-17 22:26:20,360 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 120 states. [2020-07-17 22:26:20,360 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 120 states. [2020-07-17 22:26:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,367 INFO L93 Difference]: Finished difference Result 154 states and 243 transitions. [2020-07-17 22:26:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 243 transitions. [2020-07-17 22:26:20,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,368 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 154 states. [2020-07-17 22:26:20,368 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 154 states. [2020-07-17 22:26:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,374 INFO L93 Difference]: Finished difference Result 154 states and 243 transitions. [2020-07-17 22:26:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 243 transitions. [2020-07-17 22:26:20,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:20,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-17 22:26:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2020-07-17 22:26:20,379 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2020-07-17 22:26:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:20,380 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2020-07-17 22:26:20,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2020-07-17 22:26:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:26:20,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:20,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:20,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:26:20,381 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:20,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:20,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2020-07-17 22:26:20,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:20,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494402985] [2020-07-17 22:26:20,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:20,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {2578#true} assume true; {2578#true} is VALID [2020-07-17 22:26:20,414 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2578#true} {2578#true} #129#return; {2578#true} is VALID [2020-07-17 22:26:20,414 INFO L263 TraceCheckUtils]: 0: Hoare triple {2578#true} call ULTIMATE.init(); {2578#true} is VALID [2020-07-17 22:26:20,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {2578#true} assume true; {2578#true} is VALID [2020-07-17 22:26:20,415 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2578#true} {2578#true} #129#return; {2578#true} is VALID [2020-07-17 22:26:20,415 INFO L263 TraceCheckUtils]: 3: Hoare triple {2578#true} call #t~ret7 := main(); {2578#true} is VALID [2020-07-17 22:26:20,415 INFO L280 TraceCheckUtils]: 4: Hoare triple {2578#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;havoc ~cond~0; {2578#true} is VALID [2020-07-17 22:26:20,415 INFO L280 TraceCheckUtils]: 5: Hoare triple {2578#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {2578#true} is VALID [2020-07-17 22:26:20,415 INFO L280 TraceCheckUtils]: 6: Hoare triple {2578#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {2578#true} is VALID [2020-07-17 22:26:20,416 INFO L280 TraceCheckUtils]: 7: Hoare triple {2578#true} assume !(0 != ~p1~0); {2578#true} is VALID [2020-07-17 22:26:20,416 INFO L280 TraceCheckUtils]: 8: Hoare triple {2578#true} assume !(0 != ~p2~0); {2578#true} is VALID [2020-07-17 22:26:20,417 INFO L280 TraceCheckUtils]: 9: Hoare triple {2578#true} assume !(0 != ~p3~0); {2582#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:20,417 INFO L280 TraceCheckUtils]: 10: Hoare triple {2582#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {2582#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:20,417 INFO L280 TraceCheckUtils]: 11: Hoare triple {2582#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {2582#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:20,418 INFO L280 TraceCheckUtils]: 12: Hoare triple {2582#(= 0 main_~p3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {2582#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:20,418 INFO L280 TraceCheckUtils]: 13: Hoare triple {2582#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {2582#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:20,419 INFO L280 TraceCheckUtils]: 14: Hoare triple {2582#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {2582#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:20,419 INFO L280 TraceCheckUtils]: 15: Hoare triple {2582#(= 0 main_~p3~0)} assume 0 != ~p3~0; {2579#false} is VALID [2020-07-17 22:26:20,419 INFO L280 TraceCheckUtils]: 16: Hoare triple {2579#false} assume 1 != ~lk3~0; {2579#false} is VALID [2020-07-17 22:26:20,419 INFO L280 TraceCheckUtils]: 17: Hoare triple {2579#false} assume !false; {2579#false} is VALID [2020-07-17 22:26:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:20,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494402985] [2020-07-17 22:26:20,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:20,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:20,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515789287] [2020-07-17 22:26:20,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:20,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:20,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:20,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:20,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:20,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:20,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:20,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:20,448 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2020-07-17 22:26:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,573 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2020-07-17 22:26:20,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:20,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-17 22:26:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-17 22:26:20,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2020-07-17 22:26:20,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:20,693 INFO L225 Difference]: With dead ends: 272 [2020-07-17 22:26:20,693 INFO L226 Difference]: Without dead ends: 162 [2020-07-17 22:26:20,694 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:20,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-07-17 22:26:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2020-07-17 22:26:20,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:20,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 160 states. [2020-07-17 22:26:20,739 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 160 states. [2020-07-17 22:26:20,739 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 160 states. [2020-07-17 22:26:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,745 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2020-07-17 22:26:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 243 transitions. [2020-07-17 22:26:20,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,746 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 162 states. [2020-07-17 22:26:20,746 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 162 states. [2020-07-17 22:26:20,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,752 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2020-07-17 22:26:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 243 transitions. [2020-07-17 22:26:20,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:20,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-17 22:26:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2020-07-17 22:26:20,759 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2020-07-17 22:26:20,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:20,760 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2020-07-17 22:26:20,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2020-07-17 22:26:20,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:20,760 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:20,761 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:20,761 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:26:20,761 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:20,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:20,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2020-07-17 22:26:20,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:20,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341716635] [2020-07-17 22:26:20,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:20,790 INFO L280 TraceCheckUtils]: 0: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-17 22:26:20,790 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3375#true} {3375#true} #129#return; {3375#true} is VALID [2020-07-17 22:26:20,791 INFO L263 TraceCheckUtils]: 0: Hoare triple {3375#true} call ULTIMATE.init(); {3375#true} is VALID [2020-07-17 22:26:20,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-17 22:26:20,791 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3375#true} {3375#true} #129#return; {3375#true} is VALID [2020-07-17 22:26:20,791 INFO L263 TraceCheckUtils]: 3: Hoare triple {3375#true} call #t~ret7 := main(); {3375#true} is VALID [2020-07-17 22:26:20,792 INFO L280 TraceCheckUtils]: 4: Hoare triple {3375#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;havoc ~cond~0; {3375#true} is VALID [2020-07-17 22:26:20,792 INFO L280 TraceCheckUtils]: 5: Hoare triple {3375#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {3375#true} is VALID [2020-07-17 22:26:20,792 INFO L280 TraceCheckUtils]: 6: Hoare triple {3375#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {3375#true} is VALID [2020-07-17 22:26:20,792 INFO L280 TraceCheckUtils]: 7: Hoare triple {3375#true} assume !(0 != ~p1~0); {3375#true} is VALID [2020-07-17 22:26:20,793 INFO L280 TraceCheckUtils]: 8: Hoare triple {3375#true} assume !(0 != ~p2~0); {3375#true} is VALID [2020-07-17 22:26:20,793 INFO L280 TraceCheckUtils]: 9: Hoare triple {3375#true} assume 0 != ~p3~0;~lk3~0 := 1; {3379#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:20,794 INFO L280 TraceCheckUtils]: 10: Hoare triple {3379#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {3379#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:20,795 INFO L280 TraceCheckUtils]: 11: Hoare triple {3379#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {3379#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:20,795 INFO L280 TraceCheckUtils]: 12: Hoare triple {3379#(not (= 0 main_~p3~0))} assume 0 != ~p6~0;~lk6~0 := 1; {3379#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:20,796 INFO L280 TraceCheckUtils]: 13: Hoare triple {3379#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {3379#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:20,796 INFO L280 TraceCheckUtils]: 14: Hoare triple {3379#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {3379#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:20,797 INFO L280 TraceCheckUtils]: 15: Hoare triple {3379#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {3376#false} is VALID [2020-07-17 22:26:20,797 INFO L280 TraceCheckUtils]: 16: Hoare triple {3376#false} assume 0 != ~p4~0; {3376#false} is VALID [2020-07-17 22:26:20,798 INFO L280 TraceCheckUtils]: 17: Hoare triple {3376#false} assume 1 != ~lk4~0; {3376#false} is VALID [2020-07-17 22:26:20,798 INFO L280 TraceCheckUtils]: 18: Hoare triple {3376#false} assume !false; {3376#false} is VALID [2020-07-17 22:26:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:20,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341716635] [2020-07-17 22:26:20,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:20,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:20,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893267839] [2020-07-17 22:26:20,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:20,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:20,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:20,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:20,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:20,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:20,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:20,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:20,819 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2020-07-17 22:26:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,940 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2020-07-17 22:26:20,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:20,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:20,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2020-07-17 22:26:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2020-07-17 22:26:20,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 108 transitions. [2020-07-17 22:26:21,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:21,055 INFO L225 Difference]: With dead ends: 240 [2020-07-17 22:26:21,055 INFO L226 Difference]: Without dead ends: 166 [2020-07-17 22:26:21,056 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-17 22:26:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2020-07-17 22:26:21,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:21,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 164 states. [2020-07-17 22:26:21,084 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 164 states. [2020-07-17 22:26:21,084 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 164 states. [2020-07-17 22:26:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,091 INFO L93 Difference]: Finished difference Result 166 states and 243 transitions. [2020-07-17 22:26:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 243 transitions. [2020-07-17 22:26:21,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:21,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:21,092 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 166 states. [2020-07-17 22:26:21,092 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 166 states. [2020-07-17 22:26:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,098 INFO L93 Difference]: Finished difference Result 166 states and 243 transitions. [2020-07-17 22:26:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 243 transitions. [2020-07-17 22:26:21,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:21,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:21,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:21,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-07-17 22:26:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2020-07-17 22:26:21,103 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2020-07-17 22:26:21,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:21,103 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2020-07-17 22:26:21,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2020-07-17 22:26:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:21,104 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:21,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:21,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 22:26:21,105 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:21,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2020-07-17 22:26:21,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:21,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611386205] [2020-07-17 22:26:21,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:21,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {4152#true} assume true; {4152#true} is VALID [2020-07-17 22:26:21,132 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4152#true} {4152#true} #129#return; {4152#true} is VALID [2020-07-17 22:26:21,132 INFO L263 TraceCheckUtils]: 0: Hoare triple {4152#true} call ULTIMATE.init(); {4152#true} is VALID [2020-07-17 22:26:21,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {4152#true} assume true; {4152#true} is VALID [2020-07-17 22:26:21,133 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4152#true} {4152#true} #129#return; {4152#true} is VALID [2020-07-17 22:26:21,133 INFO L263 TraceCheckUtils]: 3: Hoare triple {4152#true} call #t~ret7 := main(); {4152#true} is VALID [2020-07-17 22:26:21,133 INFO L280 TraceCheckUtils]: 4: Hoare triple {4152#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;havoc ~cond~0; {4152#true} is VALID [2020-07-17 22:26:21,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {4152#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {4152#true} is VALID [2020-07-17 22:26:21,134 INFO L280 TraceCheckUtils]: 6: Hoare triple {4152#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {4152#true} is VALID [2020-07-17 22:26:21,134 INFO L280 TraceCheckUtils]: 7: Hoare triple {4152#true} assume !(0 != ~p1~0); {4152#true} is VALID [2020-07-17 22:26:21,134 INFO L280 TraceCheckUtils]: 8: Hoare triple {4152#true} assume !(0 != ~p2~0); {4152#true} is VALID [2020-07-17 22:26:21,134 INFO L280 TraceCheckUtils]: 9: Hoare triple {4152#true} assume !(0 != ~p3~0); {4152#true} is VALID [2020-07-17 22:26:21,135 INFO L280 TraceCheckUtils]: 10: Hoare triple {4152#true} assume 0 != ~p4~0;~lk4~0 := 1; {4156#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:21,136 INFO L280 TraceCheckUtils]: 11: Hoare triple {4156#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {4156#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:21,136 INFO L280 TraceCheckUtils]: 12: Hoare triple {4156#(= 1 main_~lk4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {4156#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:21,137 INFO L280 TraceCheckUtils]: 13: Hoare triple {4156#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {4156#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:21,138 INFO L280 TraceCheckUtils]: 14: Hoare triple {4156#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {4156#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:21,138 INFO L280 TraceCheckUtils]: 15: Hoare triple {4156#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {4156#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:21,139 INFO L280 TraceCheckUtils]: 16: Hoare triple {4156#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {4156#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:21,139 INFO L280 TraceCheckUtils]: 17: Hoare triple {4156#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {4153#false} is VALID [2020-07-17 22:26:21,139 INFO L280 TraceCheckUtils]: 18: Hoare triple {4153#false} assume !false; {4153#false} is VALID [2020-07-17 22:26:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:21,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611386205] [2020-07-17 22:26:21,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:21,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:21,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920056432] [2020-07-17 22:26:21,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:21,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:21,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:21,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:21,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:21,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:21,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:21,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:21,165 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2020-07-17 22:26:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,314 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2020-07-17 22:26:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:21,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:21,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-17 22:26:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-17 22:26:21,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2020-07-17 22:26:21,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:21,385 INFO L225 Difference]: With dead ends: 284 [2020-07-17 22:26:21,385 INFO L226 Difference]: Without dead ends: 282 [2020-07-17 22:26:21,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-07-17 22:26:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2020-07-17 22:26:21,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:21,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 232 states. [2020-07-17 22:26:21,424 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 232 states. [2020-07-17 22:26:21,424 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 232 states. [2020-07-17 22:26:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,433 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2020-07-17 22:26:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2020-07-17 22:26:21,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:21,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:21,434 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 282 states. [2020-07-17 22:26:21,434 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 282 states. [2020-07-17 22:26:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,442 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2020-07-17 22:26:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2020-07-17 22:26:21,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:21,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:21,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:21,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:21,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-07-17 22:26:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2020-07-17 22:26:21,450 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2020-07-17 22:26:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:21,450 INFO L479 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2020-07-17 22:26:21,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2020-07-17 22:26:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:21,451 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:21,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:21,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 22:26:21,452 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:21,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:21,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2020-07-17 22:26:21,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:21,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192584293] [2020-07-17 22:26:21,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:21,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {5277#true} assume true; {5277#true} is VALID [2020-07-17 22:26:21,476 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5277#true} {5277#true} #129#return; {5277#true} is VALID [2020-07-17 22:26:21,476 INFO L263 TraceCheckUtils]: 0: Hoare triple {5277#true} call ULTIMATE.init(); {5277#true} is VALID [2020-07-17 22:26:21,476 INFO L280 TraceCheckUtils]: 1: Hoare triple {5277#true} assume true; {5277#true} is VALID [2020-07-17 22:26:21,477 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5277#true} {5277#true} #129#return; {5277#true} is VALID [2020-07-17 22:26:21,477 INFO L263 TraceCheckUtils]: 3: Hoare triple {5277#true} call #t~ret7 := main(); {5277#true} is VALID [2020-07-17 22:26:21,477 INFO L280 TraceCheckUtils]: 4: Hoare triple {5277#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;havoc ~cond~0; {5277#true} is VALID [2020-07-17 22:26:21,477 INFO L280 TraceCheckUtils]: 5: Hoare triple {5277#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {5277#true} is VALID [2020-07-17 22:26:21,478 INFO L280 TraceCheckUtils]: 6: Hoare triple {5277#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {5277#true} is VALID [2020-07-17 22:26:21,478 INFO L280 TraceCheckUtils]: 7: Hoare triple {5277#true} assume !(0 != ~p1~0); {5277#true} is VALID [2020-07-17 22:26:21,478 INFO L280 TraceCheckUtils]: 8: Hoare triple {5277#true} assume !(0 != ~p2~0); {5277#true} is VALID [2020-07-17 22:26:21,478 INFO L280 TraceCheckUtils]: 9: Hoare triple {5277#true} assume !(0 != ~p3~0); {5277#true} is VALID [2020-07-17 22:26:21,479 INFO L280 TraceCheckUtils]: 10: Hoare triple {5277#true} assume !(0 != ~p4~0); {5281#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:21,479 INFO L280 TraceCheckUtils]: 11: Hoare triple {5281#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {5281#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:21,480 INFO L280 TraceCheckUtils]: 12: Hoare triple {5281#(= 0 main_~p4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {5281#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:21,480 INFO L280 TraceCheckUtils]: 13: Hoare triple {5281#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {5281#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:21,481 INFO L280 TraceCheckUtils]: 14: Hoare triple {5281#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {5281#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:21,482 INFO L280 TraceCheckUtils]: 15: Hoare triple {5281#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {5281#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:21,482 INFO L280 TraceCheckUtils]: 16: Hoare triple {5281#(= 0 main_~p4~0)} assume 0 != ~p4~0; {5278#false} is VALID [2020-07-17 22:26:21,482 INFO L280 TraceCheckUtils]: 17: Hoare triple {5278#false} assume 1 != ~lk4~0; {5278#false} is VALID [2020-07-17 22:26:21,482 INFO L280 TraceCheckUtils]: 18: Hoare triple {5278#false} assume !false; {5278#false} is VALID [2020-07-17 22:26:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:21,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192584293] [2020-07-17 22:26:21,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:21,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:21,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185125913] [2020-07-17 22:26:21,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:21,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:21,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:21,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:21,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:21,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:21,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:21,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:21,511 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2020-07-17 22:26:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,676 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2020-07-17 22:26:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:21,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-17 22:26:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-17 22:26:21,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-17 22:26:21,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:21,810 INFO L225 Difference]: With dead ends: 524 [2020-07-17 22:26:21,810 INFO L226 Difference]: Without dead ends: 306 [2020-07-17 22:26:21,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-07-17 22:26:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2020-07-17 22:26:21,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:21,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand 304 states. [2020-07-17 22:26:21,891 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 304 states. [2020-07-17 22:26:21,891 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 304 states. [2020-07-17 22:26:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,915 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2020-07-17 22:26:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 423 transitions. [2020-07-17 22:26:21,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:21,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:21,916 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand 306 states. [2020-07-17 22:26:21,916 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 306 states. [2020-07-17 22:26:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,926 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2020-07-17 22:26:21,926 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 423 transitions. [2020-07-17 22:26:21,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:21,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:21,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:21,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-07-17 22:26:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2020-07-17 22:26:21,936 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2020-07-17 22:26:21,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:21,936 INFO L479 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2020-07-17 22:26:21,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2020-07-17 22:26:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:21,938 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:21,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-17 22:26:21,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 22:26:21,938 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:21,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2020-07-17 22:26:21,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:21,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516241907] [2020-07-17 22:26:21,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:21,990 INFO L280 TraceCheckUtils]: 0: Hoare triple {6778#true} assume true; {6778#true} is VALID [2020-07-17 22:26:21,990 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6778#true} {6778#true} #129#return; {6778#true} is VALID [2020-07-17 22:26:21,991 INFO L263 TraceCheckUtils]: 0: Hoare triple {6778#true} call ULTIMATE.init(); {6778#true} is VALID [2020-07-17 22:26:21,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {6778#true} assume true; {6778#true} is VALID [2020-07-17 22:26:21,991 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6778#true} {6778#true} #129#return; {6778#true} is VALID [2020-07-17 22:26:21,991 INFO L263 TraceCheckUtils]: 3: Hoare triple {6778#true} call #t~ret7 := main(); {6778#true} is VALID [2020-07-17 22:26:21,992 INFO L280 TraceCheckUtils]: 4: Hoare triple {6778#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;havoc ~cond~0; {6778#true} is VALID [2020-07-17 22:26:21,992 INFO L280 TraceCheckUtils]: 5: Hoare triple {6778#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {6778#true} is VALID [2020-07-17 22:26:21,992 INFO L280 TraceCheckUtils]: 6: Hoare triple {6778#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {6778#true} is VALID [2020-07-17 22:26:21,992 INFO L280 TraceCheckUtils]: 7: Hoare triple {6778#true} assume !(0 != ~p1~0); {6778#true} is VALID [2020-07-17 22:26:21,992 INFO L280 TraceCheckUtils]: 8: Hoare triple {6778#true} assume !(0 != ~p2~0); {6778#true} is VALID [2020-07-17 22:26:21,993 INFO L280 TraceCheckUtils]: 9: Hoare triple {6778#true} assume !(0 != ~p3~0); {6778#true} is VALID [2020-07-17 22:26:21,993 INFO L280 TraceCheckUtils]: 10: Hoare triple {6778#true} assume 0 != ~p4~0;~lk4~0 := 1; {6782#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:21,994 INFO L280 TraceCheckUtils]: 11: Hoare triple {6782#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {6782#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:21,994 INFO L280 TraceCheckUtils]: 12: Hoare triple {6782#(not (= 0 main_~p4~0))} assume 0 != ~p6~0;~lk6~0 := 1; {6782#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:21,996 INFO L280 TraceCheckUtils]: 13: Hoare triple {6782#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {6782#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:21,996 INFO L280 TraceCheckUtils]: 14: Hoare triple {6782#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {6782#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:21,997 INFO L280 TraceCheckUtils]: 15: Hoare triple {6782#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {6782#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:21,997 INFO L280 TraceCheckUtils]: 16: Hoare triple {6782#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {6779#false} is VALID [2020-07-17 22:26:21,998 INFO L280 TraceCheckUtils]: 17: Hoare triple {6779#false} assume 0 != ~p5~0; {6779#false} is VALID [2020-07-17 22:26:21,998 INFO L280 TraceCheckUtils]: 18: Hoare triple {6779#false} assume 1 != ~lk5~0; {6779#false} is VALID [2020-07-17 22:26:21,998 INFO L280 TraceCheckUtils]: 19: Hoare triple {6779#false} assume !false; {6779#false} is VALID [2020-07-17 22:26:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:21,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516241907] [2020-07-17 22:26:22,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:22,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:22,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34572615] [2020-07-17 22:26:22,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:22,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:22,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:22,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-17 22:26:22,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:22,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:22,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:22,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:22,021 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2020-07-17 22:26:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,173 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2020-07-17 22:26:22,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:22,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-17 22:26:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-17 22:26:22,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2020-07-17 22:26:22,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:22,286 INFO L225 Difference]: With dead ends: 456 [2020-07-17 22:26:22,287 INFO L226 Difference]: Without dead ends: 314 [2020-07-17 22:26:22,287 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-07-17 22:26:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2020-07-17 22:26:22,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:22,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 314 states. Second operand 312 states. [2020-07-17 22:26:22,356 INFO L74 IsIncluded]: Start isIncluded. First operand 314 states. Second operand 312 states. [2020-07-17 22:26:22,356 INFO L87 Difference]: Start difference. First operand 314 states. Second operand 312 states. [2020-07-17 22:26:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,366 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2020-07-17 22:26:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 423 transitions. [2020-07-17 22:26:22,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:22,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:22,367 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand 314 states. [2020-07-17 22:26:22,367 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 314 states. [2020-07-17 22:26:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,379 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2020-07-17 22:26:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 423 transitions. [2020-07-17 22:26:22,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:22,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:22,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:22,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2020-07-17 22:26:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2020-07-17 22:26:22,390 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2020-07-17 22:26:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:22,391 INFO L479 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2020-07-17 22:26:22,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2020-07-17 22:26:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:22,392 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:22,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:22,392 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 22:26:22,393 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:22,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:22,393 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2020-07-17 22:26:22,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:22,393 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739531578] [2020-07-17 22:26:22,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,417 INFO L280 TraceCheckUtils]: 0: Hoare triple {8235#true} assume true; {8235#true} is VALID [2020-07-17 22:26:22,418 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8235#true} {8235#true} #129#return; {8235#true} is VALID [2020-07-17 22:26:22,418 INFO L263 TraceCheckUtils]: 0: Hoare triple {8235#true} call ULTIMATE.init(); {8235#true} is VALID [2020-07-17 22:26:22,418 INFO L280 TraceCheckUtils]: 1: Hoare triple {8235#true} assume true; {8235#true} is VALID [2020-07-17 22:26:22,419 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8235#true} {8235#true} #129#return; {8235#true} is VALID [2020-07-17 22:26:22,419 INFO L263 TraceCheckUtils]: 3: Hoare triple {8235#true} call #t~ret7 := main(); {8235#true} is VALID [2020-07-17 22:26:22,419 INFO L280 TraceCheckUtils]: 4: Hoare triple {8235#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;havoc ~cond~0; {8235#true} is VALID [2020-07-17 22:26:22,419 INFO L280 TraceCheckUtils]: 5: Hoare triple {8235#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {8235#true} is VALID [2020-07-17 22:26:22,419 INFO L280 TraceCheckUtils]: 6: Hoare triple {8235#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {8235#true} is VALID [2020-07-17 22:26:22,420 INFO L280 TraceCheckUtils]: 7: Hoare triple {8235#true} assume !(0 != ~p1~0); {8235#true} is VALID [2020-07-17 22:26:22,420 INFO L280 TraceCheckUtils]: 8: Hoare triple {8235#true} assume !(0 != ~p2~0); {8235#true} is VALID [2020-07-17 22:26:22,420 INFO L280 TraceCheckUtils]: 9: Hoare triple {8235#true} assume !(0 != ~p3~0); {8235#true} is VALID [2020-07-17 22:26:22,420 INFO L280 TraceCheckUtils]: 10: Hoare triple {8235#true} assume !(0 != ~p4~0); {8235#true} is VALID [2020-07-17 22:26:22,427 INFO L280 TraceCheckUtils]: 11: Hoare triple {8235#true} assume 0 != ~p5~0;~lk5~0 := 1; {8239#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:22,428 INFO L280 TraceCheckUtils]: 12: Hoare triple {8239#(= 1 main_~lk5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {8239#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:22,430 INFO L280 TraceCheckUtils]: 13: Hoare triple {8239#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {8239#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:22,433 INFO L280 TraceCheckUtils]: 14: Hoare triple {8239#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {8239#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:22,436 INFO L280 TraceCheckUtils]: 15: Hoare triple {8239#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {8239#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:22,441 INFO L280 TraceCheckUtils]: 16: Hoare triple {8239#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {8239#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:22,443 INFO L280 TraceCheckUtils]: 17: Hoare triple {8239#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {8239#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:22,443 INFO L280 TraceCheckUtils]: 18: Hoare triple {8239#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {8236#false} is VALID [2020-07-17 22:26:22,444 INFO L280 TraceCheckUtils]: 19: Hoare triple {8236#false} assume !false; {8236#false} is VALID [2020-07-17 22:26:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:22,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739531578] [2020-07-17 22:26:22,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:22,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:22,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481280850] [2020-07-17 22:26:22,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:22,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:22,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:22,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:22,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:22,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:22,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:22,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:22,471 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2020-07-17 22:26:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,680 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2020-07-17 22:26:22,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:22,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2020-07-17 22:26:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2020-07-17 22:26:22,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2020-07-17 22:26:22,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:22,775 INFO L225 Difference]: With dead ends: 524 [2020-07-17 22:26:22,775 INFO L226 Difference]: Without dead ends: 522 [2020-07-17 22:26:22,776 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-07-17 22:26:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2020-07-17 22:26:22,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:22,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand 456 states. [2020-07-17 22:26:22,860 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand 456 states. [2020-07-17 22:26:22,860 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 456 states. [2020-07-17 22:26:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,879 INFO L93 Difference]: Finished difference Result 522 states and 695 transitions. [2020-07-17 22:26:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 695 transitions. [2020-07-17 22:26:22,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:22,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:22,881 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand 522 states. [2020-07-17 22:26:22,881 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 522 states. [2020-07-17 22:26:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,902 INFO L93 Difference]: Finished difference Result 522 states and 695 transitions. [2020-07-17 22:26:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 695 transitions. [2020-07-17 22:26:22,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:22,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:22,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:22,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-07-17 22:26:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2020-07-17 22:26:22,933 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2020-07-17 22:26:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:22,934 INFO L479 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2020-07-17 22:26:22,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2020-07-17 22:26:22,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:22,938 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:22,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-17 22:26:22,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 22:26:22,938 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:22,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:22,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2020-07-17 22:26:22,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:22,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223714531] [2020-07-17 22:26:22,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,980 INFO L280 TraceCheckUtils]: 0: Hoare triple {10328#true} assume true; {10328#true} is VALID [2020-07-17 22:26:22,981 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {10328#true} {10328#true} #129#return; {10328#true} is VALID [2020-07-17 22:26:22,981 INFO L263 TraceCheckUtils]: 0: Hoare triple {10328#true} call ULTIMATE.init(); {10328#true} is VALID [2020-07-17 22:26:22,981 INFO L280 TraceCheckUtils]: 1: Hoare triple {10328#true} assume true; {10328#true} is VALID [2020-07-17 22:26:22,982 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10328#true} {10328#true} #129#return; {10328#true} is VALID [2020-07-17 22:26:22,982 INFO L263 TraceCheckUtils]: 3: Hoare triple {10328#true} call #t~ret7 := main(); {10328#true} is VALID [2020-07-17 22:26:22,982 INFO L280 TraceCheckUtils]: 4: Hoare triple {10328#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;havoc ~cond~0; {10328#true} is VALID [2020-07-17 22:26:22,982 INFO L280 TraceCheckUtils]: 5: Hoare triple {10328#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {10328#true} is VALID [2020-07-17 22:26:22,982 INFO L280 TraceCheckUtils]: 6: Hoare triple {10328#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {10328#true} is VALID [2020-07-17 22:26:22,983 INFO L280 TraceCheckUtils]: 7: Hoare triple {10328#true} assume !(0 != ~p1~0); {10328#true} is VALID [2020-07-17 22:26:22,983 INFO L280 TraceCheckUtils]: 8: Hoare triple {10328#true} assume !(0 != ~p2~0); {10328#true} is VALID [2020-07-17 22:26:22,983 INFO L280 TraceCheckUtils]: 9: Hoare triple {10328#true} assume !(0 != ~p3~0); {10328#true} is VALID [2020-07-17 22:26:22,983 INFO L280 TraceCheckUtils]: 10: Hoare triple {10328#true} assume !(0 != ~p4~0); {10328#true} is VALID [2020-07-17 22:26:22,984 INFO L280 TraceCheckUtils]: 11: Hoare triple {10328#true} assume !(0 != ~p5~0); {10332#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:22,985 INFO L280 TraceCheckUtils]: 12: Hoare triple {10332#(= 0 main_~p5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {10332#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:22,986 INFO L280 TraceCheckUtils]: 13: Hoare triple {10332#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {10332#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:22,986 INFO L280 TraceCheckUtils]: 14: Hoare triple {10332#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {10332#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:22,987 INFO L280 TraceCheckUtils]: 15: Hoare triple {10332#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {10332#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:22,987 INFO L280 TraceCheckUtils]: 16: Hoare triple {10332#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {10332#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:22,988 INFO L280 TraceCheckUtils]: 17: Hoare triple {10332#(= 0 main_~p5~0)} assume 0 != ~p5~0; {10329#false} is VALID [2020-07-17 22:26:22,988 INFO L280 TraceCheckUtils]: 18: Hoare triple {10329#false} assume 1 != ~lk5~0; {10329#false} is VALID [2020-07-17 22:26:22,988 INFO L280 TraceCheckUtils]: 19: Hoare triple {10329#false} assume !false; {10329#false} is VALID [2020-07-17 22:26:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:22,989 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223714531] [2020-07-17 22:26:22,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:22,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:22,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991647636] [2020-07-17 22:26:22,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:22,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:22,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:23,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:23,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:23,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:23,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:23,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:23,012 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2020-07-17 22:26:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:23,293 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2020-07-17 22:26:23,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:23,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2020-07-17 22:26:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2020-07-17 22:26:23,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 107 transitions. [2020-07-17 22:26:23,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:23,441 INFO L225 Difference]: With dead ends: 1020 [2020-07-17 22:26:23,441 INFO L226 Difference]: Without dead ends: 586 [2020-07-17 22:26:23,443 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:23,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-07-17 22:26:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2020-07-17 22:26:23,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:23,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 586 states. Second operand 584 states. [2020-07-17 22:26:23,594 INFO L74 IsIncluded]: Start isIncluded. First operand 586 states. Second operand 584 states. [2020-07-17 22:26:23,594 INFO L87 Difference]: Start difference. First operand 586 states. Second operand 584 states. [2020-07-17 22:26:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:23,620 INFO L93 Difference]: Finished difference Result 586 states and 727 transitions. [2020-07-17 22:26:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 727 transitions. [2020-07-17 22:26:23,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:23,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:23,622 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand 586 states. [2020-07-17 22:26:23,622 INFO L87 Difference]: Start difference. First operand 584 states. Second operand 586 states. [2020-07-17 22:26:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:23,646 INFO L93 Difference]: Finished difference Result 586 states and 727 transitions. [2020-07-17 22:26:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 727 transitions. [2020-07-17 22:26:23,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:23,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:23,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:23,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-07-17 22:26:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2020-07-17 22:26:23,676 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2020-07-17 22:26:23,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:23,676 INFO L479 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2020-07-17 22:26:23,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2020-07-17 22:26:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:23,679 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:23,679 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:23,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 22:26:23,680 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:23,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:23,680 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2020-07-17 22:26:23,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:23,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497272738] [2020-07-17 22:26:23,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:23,715 INFO L280 TraceCheckUtils]: 0: Hoare triple {13205#true} assume true; {13205#true} is VALID [2020-07-17 22:26:23,715 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13205#true} {13205#true} #129#return; {13205#true} is VALID [2020-07-17 22:26:23,715 INFO L263 TraceCheckUtils]: 0: Hoare triple {13205#true} call ULTIMATE.init(); {13205#true} is VALID [2020-07-17 22:26:23,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {13205#true} assume true; {13205#true} is VALID [2020-07-17 22:26:23,716 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13205#true} {13205#true} #129#return; {13205#true} is VALID [2020-07-17 22:26:23,716 INFO L263 TraceCheckUtils]: 3: Hoare triple {13205#true} call #t~ret7 := main(); {13205#true} is VALID [2020-07-17 22:26:23,716 INFO L280 TraceCheckUtils]: 4: Hoare triple {13205#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;havoc ~cond~0; {13205#true} is VALID [2020-07-17 22:26:23,716 INFO L280 TraceCheckUtils]: 5: Hoare triple {13205#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {13205#true} is VALID [2020-07-17 22:26:23,717 INFO L280 TraceCheckUtils]: 6: Hoare triple {13205#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {13205#true} is VALID [2020-07-17 22:26:23,717 INFO L280 TraceCheckUtils]: 7: Hoare triple {13205#true} assume !(0 != ~p1~0); {13205#true} is VALID [2020-07-17 22:26:23,717 INFO L280 TraceCheckUtils]: 8: Hoare triple {13205#true} assume !(0 != ~p2~0); {13205#true} is VALID [2020-07-17 22:26:23,717 INFO L280 TraceCheckUtils]: 9: Hoare triple {13205#true} assume !(0 != ~p3~0); {13205#true} is VALID [2020-07-17 22:26:23,717 INFO L280 TraceCheckUtils]: 10: Hoare triple {13205#true} assume !(0 != ~p4~0); {13205#true} is VALID [2020-07-17 22:26:23,718 INFO L280 TraceCheckUtils]: 11: Hoare triple {13205#true} assume 0 != ~p5~0;~lk5~0 := 1; {13209#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:23,719 INFO L280 TraceCheckUtils]: 12: Hoare triple {13209#(not (= 0 main_~p5~0))} assume 0 != ~p6~0;~lk6~0 := 1; {13209#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:23,719 INFO L280 TraceCheckUtils]: 13: Hoare triple {13209#(not (= 0 main_~p5~0))} assume !(0 != ~p1~0); {13209#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:23,720 INFO L280 TraceCheckUtils]: 14: Hoare triple {13209#(not (= 0 main_~p5~0))} assume !(0 != ~p2~0); {13209#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:23,721 INFO L280 TraceCheckUtils]: 15: Hoare triple {13209#(not (= 0 main_~p5~0))} assume !(0 != ~p3~0); {13209#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:23,721 INFO L280 TraceCheckUtils]: 16: Hoare triple {13209#(not (= 0 main_~p5~0))} assume !(0 != ~p4~0); {13209#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:23,722 INFO L280 TraceCheckUtils]: 17: Hoare triple {13209#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {13206#false} is VALID [2020-07-17 22:26:23,722 INFO L280 TraceCheckUtils]: 18: Hoare triple {13206#false} assume 0 != ~p6~0; {13206#false} is VALID [2020-07-17 22:26:23,722 INFO L280 TraceCheckUtils]: 19: Hoare triple {13206#false} assume 1 != ~lk6~0; {13206#false} is VALID [2020-07-17 22:26:23,723 INFO L280 TraceCheckUtils]: 20: Hoare triple {13206#false} assume !false; {13206#false} is VALID [2020-07-17 22:26:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:23,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497272738] [2020-07-17 22:26:23,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:23,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:23,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629652154] [2020-07-17 22:26:23,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:23,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:23,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:23,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:23,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:23,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:23,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:23,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:23,750 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2020-07-17 22:26:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:24,031 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2020-07-17 22:26:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:24,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-17 22:26:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-17 22:26:24,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2020-07-17 22:26:24,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:24,184 INFO L225 Difference]: With dead ends: 876 [2020-07-17 22:26:24,184 INFO L226 Difference]: Without dead ends: 602 [2020-07-17 22:26:24,185 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:24,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-07-17 22:26:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2020-07-17 22:26:24,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:24,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 602 states. Second operand 600 states. [2020-07-17 22:26:24,333 INFO L74 IsIncluded]: Start isIncluded. First operand 602 states. Second operand 600 states. [2020-07-17 22:26:24,333 INFO L87 Difference]: Start difference. First operand 602 states. Second operand 600 states. [2020-07-17 22:26:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:24,358 INFO L93 Difference]: Finished difference Result 602 states and 727 transitions. [2020-07-17 22:26:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 727 transitions. [2020-07-17 22:26:24,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:24,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:24,360 INFO L74 IsIncluded]: Start isIncluded. First operand 600 states. Second operand 602 states. [2020-07-17 22:26:24,360 INFO L87 Difference]: Start difference. First operand 600 states. Second operand 602 states. [2020-07-17 22:26:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:24,385 INFO L93 Difference]: Finished difference Result 602 states and 727 transitions. [2020-07-17 22:26:24,385 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 727 transitions. [2020-07-17 22:26:24,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:24,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:24,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:24,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-07-17 22:26:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2020-07-17 22:26:24,410 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2020-07-17 22:26:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:24,410 INFO L479 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2020-07-17 22:26:24,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2020-07-17 22:26:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:24,412 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:24,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:24,412 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 22:26:24,412 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:24,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:24,413 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2020-07-17 22:26:24,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:24,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054224602] [2020-07-17 22:26:24,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:24,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {15986#true} assume true; {15986#true} is VALID [2020-07-17 22:26:24,434 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {15986#true} {15986#true} #129#return; {15986#true} is VALID [2020-07-17 22:26:24,434 INFO L263 TraceCheckUtils]: 0: Hoare triple {15986#true} call ULTIMATE.init(); {15986#true} is VALID [2020-07-17 22:26:24,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {15986#true} assume true; {15986#true} is VALID [2020-07-17 22:26:24,435 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {15986#true} {15986#true} #129#return; {15986#true} is VALID [2020-07-17 22:26:24,435 INFO L263 TraceCheckUtils]: 3: Hoare triple {15986#true} call #t~ret7 := main(); {15986#true} is VALID [2020-07-17 22:26:24,435 INFO L280 TraceCheckUtils]: 4: Hoare triple {15986#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;havoc ~cond~0; {15986#true} is VALID [2020-07-17 22:26:24,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {15986#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {15986#true} is VALID [2020-07-17 22:26:24,436 INFO L280 TraceCheckUtils]: 6: Hoare triple {15986#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {15986#true} is VALID [2020-07-17 22:26:24,436 INFO L280 TraceCheckUtils]: 7: Hoare triple {15986#true} assume !(0 != ~p1~0); {15986#true} is VALID [2020-07-17 22:26:24,436 INFO L280 TraceCheckUtils]: 8: Hoare triple {15986#true} assume !(0 != ~p2~0); {15986#true} is VALID [2020-07-17 22:26:24,436 INFO L280 TraceCheckUtils]: 9: Hoare triple {15986#true} assume !(0 != ~p3~0); {15986#true} is VALID [2020-07-17 22:26:24,437 INFO L280 TraceCheckUtils]: 10: Hoare triple {15986#true} assume !(0 != ~p4~0); {15986#true} is VALID [2020-07-17 22:26:24,437 INFO L280 TraceCheckUtils]: 11: Hoare triple {15986#true} assume !(0 != ~p5~0); {15986#true} is VALID [2020-07-17 22:26:24,437 INFO L280 TraceCheckUtils]: 12: Hoare triple {15986#true} assume 0 != ~p6~0;~lk6~0 := 1; {15990#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:24,438 INFO L280 TraceCheckUtils]: 13: Hoare triple {15990#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {15990#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:24,439 INFO L280 TraceCheckUtils]: 14: Hoare triple {15990#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {15990#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:24,439 INFO L280 TraceCheckUtils]: 15: Hoare triple {15990#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {15990#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:24,440 INFO L280 TraceCheckUtils]: 16: Hoare triple {15990#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {15990#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:24,440 INFO L280 TraceCheckUtils]: 17: Hoare triple {15990#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {15990#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:24,441 INFO L280 TraceCheckUtils]: 18: Hoare triple {15990#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {15990#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:24,441 INFO L280 TraceCheckUtils]: 19: Hoare triple {15990#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {15987#false} is VALID [2020-07-17 22:26:24,441 INFO L280 TraceCheckUtils]: 20: Hoare triple {15987#false} assume !false; {15987#false} is VALID [2020-07-17 22:26:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:24,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054224602] [2020-07-17 22:26:24,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:24,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:24,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703323658] [2020-07-17 22:26:24,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:24,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:24,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:24,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:24,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:24,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:24,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:24,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:24,468 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2020-07-17 22:26:24,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:24,867 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2020-07-17 22:26:24,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:24,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:24,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2020-07-17 22:26:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2020-07-17 22:26:24,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2020-07-17 22:26:24,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:24,980 INFO L225 Difference]: With dead ends: 970 [2020-07-17 22:26:24,980 INFO L226 Difference]: Without dead ends: 968 [2020-07-17 22:26:24,981 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:24,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2020-07-17 22:26:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2020-07-17 22:26:25,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:25,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 968 states. Second operand 904 states. [2020-07-17 22:26:25,149 INFO L74 IsIncluded]: Start isIncluded. First operand 968 states. Second operand 904 states. [2020-07-17 22:26:25,149 INFO L87 Difference]: Start difference. First operand 968 states. Second operand 904 states. [2020-07-17 22:26:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:25,202 INFO L93 Difference]: Finished difference Result 968 states and 1126 transitions. [2020-07-17 22:26:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1126 transitions. [2020-07-17 22:26:25,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:25,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:25,205 INFO L74 IsIncluded]: Start isIncluded. First operand 904 states. Second operand 968 states. [2020-07-17 22:26:25,205 INFO L87 Difference]: Start difference. First operand 904 states. Second operand 968 states. [2020-07-17 22:26:25,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:25,280 INFO L93 Difference]: Finished difference Result 968 states and 1126 transitions. [2020-07-17 22:26:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1126 transitions. [2020-07-17 22:26:25,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:25,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:25,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:25,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2020-07-17 22:26:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2020-07-17 22:26:25,328 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2020-07-17 22:26:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:25,328 INFO L479 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2020-07-17 22:26:25,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2020-07-17 22:26:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:25,330 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:25,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:25,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 22:26:25,330 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:25,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2020-07-17 22:26:25,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:25,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358637374] [2020-07-17 22:26:25,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:25,358 INFO L280 TraceCheckUtils]: 0: Hoare triple {19912#true} assume true; {19912#true} is VALID [2020-07-17 22:26:25,359 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19912#true} {19912#true} #129#return; {19912#true} is VALID [2020-07-17 22:26:25,359 INFO L263 TraceCheckUtils]: 0: Hoare triple {19912#true} call ULTIMATE.init(); {19912#true} is VALID [2020-07-17 22:26:25,359 INFO L280 TraceCheckUtils]: 1: Hoare triple {19912#true} assume true; {19912#true} is VALID [2020-07-17 22:26:25,359 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19912#true} {19912#true} #129#return; {19912#true} is VALID [2020-07-17 22:26:25,359 INFO L263 TraceCheckUtils]: 3: Hoare triple {19912#true} call #t~ret7 := main(); {19912#true} is VALID [2020-07-17 22:26:25,360 INFO L280 TraceCheckUtils]: 4: Hoare triple {19912#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;havoc ~cond~0; {19912#true} is VALID [2020-07-17 22:26:25,360 INFO L280 TraceCheckUtils]: 5: Hoare triple {19912#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {19912#true} is VALID [2020-07-17 22:26:25,360 INFO L280 TraceCheckUtils]: 6: Hoare triple {19912#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {19912#true} is VALID [2020-07-17 22:26:25,361 INFO L280 TraceCheckUtils]: 7: Hoare triple {19912#true} assume !(0 != ~p1~0); {19912#true} is VALID [2020-07-17 22:26:25,361 INFO L280 TraceCheckUtils]: 8: Hoare triple {19912#true} assume !(0 != ~p2~0); {19912#true} is VALID [2020-07-17 22:26:25,361 INFO L280 TraceCheckUtils]: 9: Hoare triple {19912#true} assume !(0 != ~p3~0); {19912#true} is VALID [2020-07-17 22:26:25,361 INFO L280 TraceCheckUtils]: 10: Hoare triple {19912#true} assume !(0 != ~p4~0); {19912#true} is VALID [2020-07-17 22:26:25,361 INFO L280 TraceCheckUtils]: 11: Hoare triple {19912#true} assume !(0 != ~p5~0); {19912#true} is VALID [2020-07-17 22:26:25,364 INFO L280 TraceCheckUtils]: 12: Hoare triple {19912#true} assume !(0 != ~p6~0); {19916#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:25,364 INFO L280 TraceCheckUtils]: 13: Hoare triple {19916#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {19916#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:25,365 INFO L280 TraceCheckUtils]: 14: Hoare triple {19916#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {19916#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:25,365 INFO L280 TraceCheckUtils]: 15: Hoare triple {19916#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {19916#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:25,366 INFO L280 TraceCheckUtils]: 16: Hoare triple {19916#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {19916#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:25,366 INFO L280 TraceCheckUtils]: 17: Hoare triple {19916#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {19916#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:25,367 INFO L280 TraceCheckUtils]: 18: Hoare triple {19916#(= 0 main_~p6~0)} assume 0 != ~p6~0; {19913#false} is VALID [2020-07-17 22:26:25,367 INFO L280 TraceCheckUtils]: 19: Hoare triple {19913#false} assume 1 != ~lk6~0; {19913#false} is VALID [2020-07-17 22:26:25,367 INFO L280 TraceCheckUtils]: 20: Hoare triple {19913#false} assume !false; {19913#false} is VALID [2020-07-17 22:26:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:25,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358637374] [2020-07-17 22:26:25,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:25,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:25,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642014946] [2020-07-17 22:26:25,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:25,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:25,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:25,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:25,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:25,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:25,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:25,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:25,390 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2020-07-17 22:26:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:25,909 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2020-07-17 22:26:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:25,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:25,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-17 22:26:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-17 22:26:25,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2020-07-17 22:26:26,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:26,005 INFO L225 Difference]: With dead ends: 1992 [2020-07-17 22:26:26,005 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:26:26,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:26:26,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:26:26,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:26,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:26,012 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:26,012 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:26,012 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:26:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:26:26,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:26,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:26,013 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:26,013 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:26,013 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:26:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:26:26,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:26,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:26,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:26,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:26:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:26:26,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-07-17 22:26:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:26,016 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:26:26,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:26:26,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:26,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-17 22:26:26,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:26:26,049 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:26:26,049 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:26:26,049 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:26:26,050 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:26:26,050 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:26:26,050 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:26:26,050 INFO L268 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2020-07-17 22:26:26,050 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2020-07-17 22:26:26,050 INFO L268 CegarLoopResult]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2020-07-17 22:26:26,050 INFO L268 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2020-07-17 22:26:26,050 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-07-17 22:26:26,051 INFO L268 CegarLoopResult]: For program point L29(lines 29 31) no Hoare annotation was computed. [2020-07-17 22:26:26,051 INFO L268 CegarLoopResult]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2020-07-17 22:26:26,051 INFO L268 CegarLoopResult]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2020-07-17 22:26:26,051 INFO L268 CegarLoopResult]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2020-07-17 22:26:26,051 INFO L268 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2020-07-17 22:26:26,051 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2020-07-17 22:26:26,051 INFO L268 CegarLoopResult]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2020-07-17 22:26:26,051 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2020-07-17 22:26:26,052 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-07-17 22:26:26,052 INFO L268 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2020-07-17 22:26:26,052 INFO L268 CegarLoopResult]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2020-07-17 22:26:26,052 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-07-17 22:26:26,052 INFO L268 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2020-07-17 22:26:26,052 INFO L268 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-07-17 22:26:26,053 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-07-17 22:26:26,053 INFO L268 CegarLoopResult]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2020-07-17 22:26:26,053 INFO L268 CegarLoopResult]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2020-07-17 22:26:26,053 INFO L268 CegarLoopResult]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2020-07-17 22:26:26,054 INFO L268 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-07-17 22:26:26,054 INFO L268 CegarLoopResult]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2020-07-17 22:26:26,054 INFO L268 CegarLoopResult]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2020-07-17 22:26:26,059 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:26:26,059 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:26:26,060 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:26:26,060 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-17 22:26:26,060 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:26:26,060 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:26:26,060 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-17 22:26:26,060 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-17 22:26:26,060 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:26:26,060 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-17 22:26:26,060 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-17 22:26:26,061 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:26:26,061 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-17 22:26:26,061 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-17 22:26:26,061 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-17 22:26:26,061 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-17 22:26:26,061 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2020-07-17 22:26:26,061 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2020-07-17 22:26:26,061 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-17 22:26:26,061 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-17 22:26:26,061 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-17 22:26:26,062 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-17 22:26:26,062 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-17 22:26:26,062 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-17 22:26:26,062 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2020-07-17 22:26:26,062 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2020-07-17 22:26:26,062 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-17 22:26:26,062 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-17 22:26:26,062 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-17 22:26:26,062 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:26:26,062 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-17 22:26:26,063 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-17 22:26:26,063 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-17 22:26:26,063 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-17 22:26:26,063 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-17 22:26:26,063 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-17 22:26:26,063 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-17 22:26:26,064 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-17 22:26:26,064 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-17 22:26:26,064 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-17 22:26:26,064 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2020-07-17 22:26:26,064 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2020-07-17 22:26:26,064 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2020-07-17 22:26:26,064 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2020-07-17 22:26:26,065 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2020-07-17 22:26:26,065 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2020-07-17 22:26:26,065 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2020-07-17 22:26:26,065 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2020-07-17 22:26:26,065 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:26:26,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:26:26 BoogieIcfgContainer [2020-07-17 22:26:26,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:26:26,091 INFO L168 Benchmark]: Toolchain (without parser) took 9802.85 ms. Allocated memory was 136.8 MB in the beginning and 349.2 MB in the end (delta: 212.3 MB). Free memory was 101.2 MB in the beginning and 178.6 MB in the end (delta: -77.4 MB). Peak memory consumption was 134.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:26,092 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:26:26,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.51 ms. Allocated memory is still 136.8 MB. Free memory was 100.8 MB in the beginning and 90.4 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:26,093 INFO L168 Benchmark]: Boogie Preprocessor took 123.37 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 90.4 MB in the beginning and 178.4 MB in the end (delta: -88.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:26,093 INFO L168 Benchmark]: RCFGBuilder took 430.31 ms. Allocated memory is still 200.3 MB. Free memory was 178.4 MB in the beginning and 155.1 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:26,096 INFO L168 Benchmark]: TraceAbstraction took 8979.93 ms. Allocated memory was 200.3 MB in the beginning and 349.2 MB in the end (delta: 148.9 MB). Free memory was 154.5 MB in the beginning and 178.6 MB in the end (delta: -24.2 MB). Peak memory consumption was 124.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:26,098 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.54 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 261.51 ms. Allocated memory is still 136.8 MB. Free memory was 100.8 MB in the beginning and 90.4 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.37 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 90.4 MB in the beginning and 178.4 MB in the end (delta: -88.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 430.31 ms. Allocated memory is still 200.3 MB. Free memory was 178.4 MB in the beginning and 155.1 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8979.93 ms. Allocated memory was 200.3 MB in the beginning and 349.2 MB in the end (delta: 148.9 MB). Free memory was 154.5 MB in the beginning and 178.6 MB in the end (delta: -24.2 MB). Peak memory consumption was 124.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...