/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:49:10,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:49:10,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:49:10,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:49:10,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:49:10,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:49:10,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:49:10,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:49:10,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:49:10,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:49:10,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:49:10,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:49:10,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:49:10,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:49:10,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:49:10,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:49:10,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:49:10,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:49:10,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:49:10,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:49:10,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:49:10,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:49:10,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:49:10,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:49:10,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:49:10,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:49:10,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:49:10,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:49:10,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:49:10,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:49:10,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:49:10,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:49:10,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:49:10,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:49:10,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:49:10,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:49:10,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:49:10,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:49:10,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:49:10,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:49:10,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:49:10,332 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:49:10,348 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:49:10,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:49:10,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:49:10,351 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:49:10,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:49:10,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:49:10,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:49:10,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:49:10,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:49:10,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:49:10,353 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:49:10,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:49:10,354 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:49:10,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:49:10,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:49:10,355 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:49:10,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:49:10,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:49:10,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:49:10,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:49:10,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:49:10,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:49:10,357 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 06:49:10,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:49:10,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:49:10,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:49:10,831 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:49:10,831 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:49:10,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt3.c [2020-11-07 06:49:10,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da2ff0170/129e40db34ca43c5a95127d898d77249/FLAG89c69d49d [2020-11-07 06:49:11,696 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:49:11,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt3.c [2020-11-07 06:49:11,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da2ff0170/129e40db34ca43c5a95127d898d77249/FLAG89c69d49d [2020-11-07 06:49:12,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da2ff0170/129e40db34ca43c5a95127d898d77249 [2020-11-07 06:49:12,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:49:12,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:49:12,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:49:12,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:49:12,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:49:12,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:12" (1/1) ... [2020-11-07 06:49:12,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a52580d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:12, skipping insertion in model container [2020-11-07 06:49:12,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:12" (1/1) ... [2020-11-07 06:49:12,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:49:12,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:49:12,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:49:12,371 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:49:12,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:49:12,416 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:49:12,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:12 WrapperNode [2020-11-07 06:49:12,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:49:12,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:49:12,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:49:12,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:49:12,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:12" (1/1) ... [2020-11-07 06:49:12,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:12" (1/1) ... [2020-11-07 06:49:12,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:12" (1/1) ... [2020-11-07 06:49:12,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:12" (1/1) ... [2020-11-07 06:49:12,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:12" (1/1) ... [2020-11-07 06:49:12,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:12" (1/1) ... [2020-11-07 06:49:12,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:12" (1/1) ... [2020-11-07 06:49:12,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:49:12,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:49:12,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:49:12,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:49:12,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:12" (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-11-07 06:49:12,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:49:12,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:49:12,616 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:49:12,616 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:49:12,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:49:12,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:49:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:49:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:49:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:49:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:49:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:49:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:49:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-11-07 06:49:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:49:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:49:12,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:49:12,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:49:12,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:49:12,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:49:12,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:49:13,298 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:49:13,298 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 06:49:13,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:13 BoogieIcfgContainer [2020-11-07 06:49:13,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:49:13,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:49:13,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:49:13,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:49:13,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:49:12" (1/3) ... [2020-11-07 06:49:13,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4239cd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:13, skipping insertion in model container [2020-11-07 06:49:13,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:12" (2/3) ... [2020-11-07 06:49:13,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4239cd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:13, skipping insertion in model container [2020-11-07 06:49:13,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:13" (3/3) ... [2020-11-07 06:49:13,322 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt3.c [2020-11-07 06:49:13,344 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:49:13,350 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:49:13,366 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:49:13,413 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:49:13,414 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:49:13,414 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:49:13,414 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:49:13,414 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:49:13,414 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:49:13,414 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:49:13,415 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:49:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-11-07 06:49:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-07 06:49:13,457 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:13,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:13,458 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2136131298, now seen corresponding path program 1 times [2020-11-07 06:49:13,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:13,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1811963879] [2020-11-07 06:49:13,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:14,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:14,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1811963879] [2020-11-07 06:49:14,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:49:14,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 06:49:14,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049647208] [2020-11-07 06:49:14,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:49:14,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:14,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:49:14,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:14,419 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 9 states. [2020-11-07 06:49:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:15,393 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2020-11-07 06:49:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:49:15,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-11-07 06:49:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:15,408 INFO L225 Difference]: With dead ends: 80 [2020-11-07 06:49:15,409 INFO L226 Difference]: Without dead ends: 41 [2020-11-07 06:49:15,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:49:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-07 06:49:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2020-11-07 06:49:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-07 06:49:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2020-11-07 06:49:15,470 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 31 [2020-11-07 06:49:15,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:15,471 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2020-11-07 06:49:15,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:49:15,472 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-11-07 06:49:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-07 06:49:15,473 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:15,474 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:15,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:49:15,474 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:15,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:15,476 INFO L82 PathProgramCache]: Analyzing trace with hash -609275412, now seen corresponding path program 1 times [2020-11-07 06:49:15,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:15,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1152073806] [2020-11-07 06:49:15,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:16,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:16,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1152073806] [2020-11-07 06:49:16,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:16,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 06:49:16,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912433048] [2020-11-07 06:49:16,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:49:16,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:16,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:49:16,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:49:16,033 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 13 states. [2020-11-07 06:49:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:16,799 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-11-07 06:49:16,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:49:16,800 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2020-11-07 06:49:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:16,802 INFO L225 Difference]: With dead ends: 54 [2020-11-07 06:49:16,802 INFO L226 Difference]: Without dead ends: 48 [2020-11-07 06:49:16,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2020-11-07 06:49:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-07 06:49:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2020-11-07 06:49:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-07 06:49:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2020-11-07 06:49:16,822 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 35 [2020-11-07 06:49:16,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:16,822 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2020-11-07 06:49:16,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:49:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-11-07 06:49:16,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-07 06:49:16,824 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:16,824 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:16,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:49:16,825 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:16,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:16,825 INFO L82 PathProgramCache]: Analyzing trace with hash -2142497862, now seen corresponding path program 2 times [2020-11-07 06:49:16,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:16,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1420888093] [2020-11-07 06:49:16,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:17,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:17,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1420888093] [2020-11-07 06:49:17,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:17,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:49:17,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242186184] [2020-11-07 06:49:17,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:49:17,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:17,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:49:17,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:17,273 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 9 states. [2020-11-07 06:49:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:22,108 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-11-07 06:49:22,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:49:22,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2020-11-07 06:49:22,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:22,112 INFO L225 Difference]: With dead ends: 71 [2020-11-07 06:49:22,112 INFO L226 Difference]: Without dead ends: 58 [2020-11-07 06:49:22,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:49:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-07 06:49:22,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2020-11-07 06:49:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-07 06:49:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2020-11-07 06:49:22,133 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2020-11-07 06:49:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:22,133 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2020-11-07 06:49:22,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:49:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-11-07 06:49:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-07 06:49:22,135 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:22,135 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:22,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:49:22,136 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:22,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:22,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1785635382, now seen corresponding path program 1 times [2020-11-07 06:49:22,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:22,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [894353815] [2020-11-07 06:49:22,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:22,510 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2020-11-07 06:49:22,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:22,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [894353815] [2020-11-07 06:49:22,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:22,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 06:49:22,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139047077] [2020-11-07 06:49:22,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 06:49:22,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:22,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 06:49:22,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:49:22,762 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 15 states. [2020-11-07 06:49:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:25,969 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2020-11-07 06:49:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 06:49:25,971 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2020-11-07 06:49:25,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:25,973 INFO L225 Difference]: With dead ends: 59 [2020-11-07 06:49:25,973 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 06:49:25,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2020-11-07 06:49:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 06:49:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2020-11-07 06:49:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-11-07 06:49:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2020-11-07 06:49:26,009 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 40 [2020-11-07 06:49:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:26,010 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2020-11-07 06:49:26,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 06:49:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-11-07 06:49:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-07 06:49:26,015 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:26,016 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:26,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:49:26,016 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:26,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:26,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1979567766, now seen corresponding path program 1 times [2020-11-07 06:49:26,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:26,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1151350432] [2020-11-07 06:49:26,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:26,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:26,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1151350432] [2020-11-07 06:49:26,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:26,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:26,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995094773] [2020-11-07 06:49:26,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:26,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:26,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:26,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:26,179 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 5 states. [2020-11-07 06:49:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:26,413 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2020-11-07 06:49:26,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:26,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-11-07 06:49:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:26,415 INFO L225 Difference]: With dead ends: 61 [2020-11-07 06:49:26,415 INFO L226 Difference]: Without dead ends: 48 [2020-11-07 06:49:26,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:26,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-07 06:49:26,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-11-07 06:49:26,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-11-07 06:49:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2020-11-07 06:49:26,447 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 40 [2020-11-07 06:49:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:26,448 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2020-11-07 06:49:26,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2020-11-07 06:49:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 06:49:26,459 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:26,459 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:26,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:49:26,459 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:26,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:26,460 INFO L82 PathProgramCache]: Analyzing trace with hash -974762236, now seen corresponding path program 2 times [2020-11-07 06:49:26,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:26,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1287199920] [2020-11-07 06:49:26,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:26,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:26,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1287199920] [2020-11-07 06:49:26,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:26,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:49:26,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932353793] [2020-11-07 06:49:26,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:49:26,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:26,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:49:26,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:26,736 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 7 states. [2020-11-07 06:49:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:29,473 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2020-11-07 06:49:29,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:49:29,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-11-07 06:49:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:29,475 INFO L225 Difference]: With dead ends: 67 [2020-11-07 06:49:29,476 INFO L226 Difference]: Without dead ends: 54 [2020-11-07 06:49:29,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:49:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-07 06:49:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2020-11-07 06:49:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-07 06:49:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-11-07 06:49:29,498 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2020-11-07 06:49:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:29,498 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-11-07 06:49:29,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:49:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-11-07 06:49:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 06:49:29,499 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:29,500 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:29,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:49:29,500 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:29,501 INFO L82 PathProgramCache]: Analyzing trace with hash -669265876, now seen corresponding path program 3 times [2020-11-07 06:49:29,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:29,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1753291834] [2020-11-07 06:49:29,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:29,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:29,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1753291834] [2020-11-07 06:49:29,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:29,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:49:29,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334453736] [2020-11-07 06:49:29,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:49:29,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:29,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:49:29,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:49:29,641 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 6 states. [2020-11-07 06:49:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:29,946 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2020-11-07 06:49:29,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:49:29,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2020-11-07 06:49:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:29,948 INFO L225 Difference]: With dead ends: 65 [2020-11-07 06:49:29,949 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 06:49:29,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 06:49:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2020-11-07 06:49:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-07 06:49:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2020-11-07 06:49:29,971 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 45 [2020-11-07 06:49:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:29,972 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2020-11-07 06:49:29,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:49:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2020-11-07 06:49:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 06:49:29,973 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:29,973 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:29,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:49:29,974 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash -475333492, now seen corresponding path program 1 times [2020-11-07 06:49:29,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:29,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [292842127] [2020-11-07 06:49:29,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:30,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:30,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [292842127] [2020-11-07 06:49:30,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:30,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 06:49:30,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238666997] [2020-11-07 06:49:30,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 06:49:30,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:30,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 06:49:30,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:49:30,632 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 17 states. [2020-11-07 06:49:31,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:31,926 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2020-11-07 06:49:31,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:49:31,926 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2020-11-07 06:49:31,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:31,928 INFO L225 Difference]: With dead ends: 64 [2020-11-07 06:49:31,929 INFO L226 Difference]: Without dead ends: 58 [2020-11-07 06:49:31,930 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2020-11-07 06:49:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-07 06:49:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2020-11-07 06:49:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 06:49:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-11-07 06:49:31,969 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 45 [2020-11-07 06:49:31,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:31,969 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-11-07 06:49:31,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 06:49:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-11-07 06:49:31,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 06:49:31,974 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:31,974 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:31,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:49:31,976 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:31,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:31,977 INFO L82 PathProgramCache]: Analyzing trace with hash 975277658, now seen corresponding path program 2 times [2020-11-07 06:49:31,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:31,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1151089635] [2020-11-07 06:49:31,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:32,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:32,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1151089635] [2020-11-07 06:49:32,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:32,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 06:49:32,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085968176] [2020-11-07 06:49:32,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 06:49:32,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:32,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 06:49:32,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:49:32,936 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 19 states. [2020-11-07 06:49:34,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:34,599 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2020-11-07 06:49:34,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 06:49:34,600 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2020-11-07 06:49:34,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:34,601 INFO L225 Difference]: With dead ends: 71 [2020-11-07 06:49:34,602 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 06:49:34,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 06:49:34,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 06:49:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2020-11-07 06:49:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-11-07 06:49:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2020-11-07 06:49:34,646 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 49 [2020-11-07 06:49:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:34,648 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2020-11-07 06:49:34,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 06:49:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-11-07 06:49:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-07 06:49:34,653 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:34,653 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:34,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:49:34,654 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:34,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1816037672, now seen corresponding path program 3 times [2020-11-07 06:49:34,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:34,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [893370724] [2020-11-07 06:49:34,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:35,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:35,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [893370724] [2020-11-07 06:49:35,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:35,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:49:35,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687003383] [2020-11-07 06:49:35,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:49:35,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:35,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:49:35,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:49:35,162 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 11 states. [2020-11-07 06:49:36,308 WARN L194 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-07 06:49:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:37,235 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2020-11-07 06:49:37,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:49:37,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2020-11-07 06:49:37,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:37,238 INFO L225 Difference]: With dead ends: 101 [2020-11-07 06:49:37,239 INFO L226 Difference]: Without dead ends: 88 [2020-11-07 06:49:37,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:49:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-07 06:49:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2020-11-07 06:49:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-07 06:49:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2020-11-07 06:49:37,290 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 53 [2020-11-07 06:49:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:37,290 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2020-11-07 06:49:37,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:49:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2020-11-07 06:49:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 06:49:37,291 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:37,292 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:37,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:49:37,292 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:37,293 INFO L82 PathProgramCache]: Analyzing trace with hash -53814648, now seen corresponding path program 4 times [2020-11-07 06:49:37,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:37,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1916809385] [2020-11-07 06:49:37,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:37,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:37,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1916809385] [2020-11-07 06:49:37,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:37,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:49:37,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68598991] [2020-11-07 06:49:37,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:49:37,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:37,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:49:37,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:49:37,470 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 8 states. [2020-11-07 06:49:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:37,967 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2020-11-07 06:49:37,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:49:37,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-11-07 06:49:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:37,969 INFO L225 Difference]: With dead ends: 100 [2020-11-07 06:49:37,969 INFO L226 Difference]: Without dead ends: 61 [2020-11-07 06:49:37,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:49:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-07 06:49:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2020-11-07 06:49:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 06:49:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-11-07 06:49:37,996 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 54 [2020-11-07 06:49:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:37,996 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-11-07 06:49:37,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:49:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-11-07 06:49:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 06:49:37,997 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:37,997 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:37,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:49:37,998 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:37,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:37,999 INFO L82 PathProgramCache]: Analyzing trace with hash 140117736, now seen corresponding path program 5 times [2020-11-07 06:49:37,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:37,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1697445643] [2020-11-07 06:49:38,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:38,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 06:49:38,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1697445643] [2020-11-07 06:49:38,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:38,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 06:49:38,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609882897] [2020-11-07 06:49:38,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 06:49:38,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:38,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 06:49:38,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:49:38,468 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 15 states. [2020-11-07 06:49:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:39,371 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-11-07 06:49:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 06:49:39,372 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2020-11-07 06:49:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:39,373 INFO L225 Difference]: With dead ends: 59 [2020-11-07 06:49:39,373 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:49:39,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2020-11-07 06:49:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:49:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:49:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:49:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:49:39,375 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2020-11-07 06:49:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:39,375 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:49:39,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 06:49:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:49:39,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:49:39,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 06:49:39,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:49:39,573 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 152 [2020-11-07 06:49:43,074 WARN L194 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 141 DAG size of output: 41 [2020-11-07 06:49:43,374 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 21 [2020-11-07 06:49:43,697 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 21 [2020-11-07 06:49:43,896 WARN L194 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 41 [2020-11-07 06:49:44,032 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 26 [2020-11-07 06:49:44,202 WARN L194 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 21 [2020-11-07 06:49:44,372 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 23 [2020-11-07 06:49:44,702 WARN L194 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 41 [2020-11-07 06:49:44,795 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 06:49:44,796 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 06:49:44,796 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 06:49:44,796 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 06:49:44,796 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 06:49:44,797 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 06:49:44,797 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:49:44,797 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 06:49:44,797 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:49:44,797 INFO L269 CegarLoopResult]: At program point L3-5(line 3) the Hoare annotation is: true [2020-11-07 06:49:44,798 INFO L262 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:49:44,798 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= ~SIZE~0 |old(~SIZE~0)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 06:49:44,798 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 06:49:44,799 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 06:49:44,799 INFO L262 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:49:44,799 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:49:44,799 INFO L262 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:49:44,799 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:49:44,799 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:49:44,799 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:49:44,799 INFO L266 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-11-07 06:49:44,800 INFO L266 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-11-07 06:49:44,800 INFO L266 CegarLoopResult]: For program point L6-3(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:49:44,800 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:49:44,800 INFO L262 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 3))) (+ (* 6 .cse0) (* 8589934593 (div (+ (* .cse0 (- 3)) main_~l~0 .cse1) 4294967296)) (* 8589934592 .cse2) 2)))) (* 2 main_~l~0)) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0) (<= main_~n~0 (+ (* 4294967296 (div main_~n~0 4294967296)) 20000001)))) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,800 INFO L262 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse3 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296)))) (let ((.cse1 (div (+ main_~l~0 .cse2) 3))) (+ (* 6 .cse1) (* 8589934593 (div (+ (* .cse1 (- 3)) main_~l~0 .cse2) 4294967296)) (* 8589934592 .cse3) 2)))) (* 2 main_~l~0)) (<= .cse0 main_~l~0) (<= main_~n~0 (+ (* 4294967296 (div main_~n~0 4294967296)) 20000001)))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,801 INFO L262 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0) (<= main_~n~0 (+ (* 4294967296 (div main_~n~0 4294967296)) 20000001)))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,801 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 16 36) the Hoare annotation is: true [2020-11-07 06:49:44,801 INFO L262 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0) (<= main_~n~0 (+ (* 4294967296 (div main_~n~0 4294967296)) 20000001))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,801 INFO L262 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (and (= main_~i~0 0) (= main_~l~0 0) (<= main_~n~0 (+ (* 4294967296 (div main_~n~0 4294967296)) 20000001)))) [2020-11-07 06:49:44,801 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (= main_~l~0 0) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,802 INFO L269 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: true [2020-11-07 06:49:44,802 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 06:49:44,802 INFO L269 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-11-07 06:49:44,802 INFO L269 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-11-07 06:49:44,802 INFO L269 CegarLoopResult]: At program point L17-3(line 17) the Hoare annotation is: true [2020-11-07 06:49:44,802 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 16 36) the Hoare annotation is: true [2020-11-07 06:49:44,802 INFO L269 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-11-07 06:49:44,802 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 16 36) the Hoare annotation is: true [2020-11-07 06:49:44,803 INFO L262 CegarLoopResult]: At program point L28(lines 28 31) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 3))) (+ (* 6 .cse0) (* 8589934593 (div (+ (* .cse0 (- 3)) main_~l~0 .cse1) 4294967296)) (* 8589934592 .cse2) 2)))) (* 2 main_~l~0)) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0) (<= main_~n~0 (+ (* 4294967296 (div main_~n~0 4294967296)) 20000001)))) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,803 INFO L262 CegarLoopResult]: At program point L26(lines 26 31) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0) (<= main_~n~0 (+ (* 4294967296 (div main_~n~0 4294967296)) 20000001)))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,803 INFO L262 CegarLoopResult]: At program point L28-2(lines 26 31) the Hoare annotation is: (or (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~l~0 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= main_~n~0 (+ (* 4294967296 (div main_~n~0 4294967296)) 20000001)))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,803 INFO L262 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (or (and (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0) (<= main_~n~0 (+ (* 4294967296 (div main_~n~0 4294967296)) 20000001))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,804 INFO L262 CegarLoopResult]: At program point L24-2(lines 24 33) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0) (<= main_~n~0 (+ (* 4294967296 (div main_~n~0 4294967296)) 20000001)))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,804 INFO L262 CegarLoopResult]: At program point L24-3(lines 24 33) the Hoare annotation is: (or (let ((.cse2 (div (+ main_~i~0 main_~j~0 main_~k~0) 4294967296)) (.cse3 (div main_~l~0 4294967296))) (let ((.cse1 (* 4294967296 .cse3)) (.cse0 (+ main_~l~0 (* 4294967296 .cse2)))) (and (< .cse0 (+ main_~i~0 main_~j~0 main_~k~0 .cse1 1)) (< .cse2 (+ .cse3 1)) (<= (+ main_~i~0 main_~j~0 main_~k~0 .cse1) .cse0)))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,804 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~l~0 0) (<= main_~n~0 (+ (* 4294967296 (div main_~n~0 4294967296)) 20000001))) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,804 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (= main_~l~0 0) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,804 INFO L262 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (= main_~l~0 0) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:49:44,804 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2020-11-07 06:49:44,804 INFO L262 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:49:44,805 INFO L262 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:49:44,805 INFO L262 CegarLoopResult]: At program point L9(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:49:44,805 INFO L262 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:49:44,805 INFO L262 CegarLoopResult]: At program point L9-2(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:49:44,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:49:44 BoogieIcfgContainer [2020-11-07 06:49:44,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:49:44,830 INFO L168 Benchmark]: Toolchain (without parser) took 32753.15 ms. Allocated memory was 152.0 MB in the beginning and 222.3 MB in the end (delta: 70.3 MB). Free memory was 129.1 MB in the beginning and 101.9 MB in the end (delta: 27.2 MB). Peak memory consumption was 130.2 MB. Max. memory is 8.0 GB. [2020-11-07 06:49:44,830 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 152.0 MB. Free memory was 126.4 MB in the beginning and 126.3 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:49:44,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.95 ms. Allocated memory is still 152.0 MB. Free memory was 128.6 MB in the beginning and 118.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 06:49:44,832 INFO L168 Benchmark]: Boogie Preprocessor took 78.81 ms. Allocated memory is still 152.0 MB. Free memory was 118.9 MB in the beginning and 117.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:49:44,832 INFO L168 Benchmark]: RCFGBuilder took 804.96 ms. Allocated memory is still 152.0 MB. Free memory was 117.5 MB in the beginning and 133.5 MB in the end (delta: -16.0 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. [2020-11-07 06:49:44,833 INFO L168 Benchmark]: TraceAbstraction took 31516.22 ms. Allocated memory was 152.0 MB in the beginning and 222.3 MB in the end (delta: 70.3 MB). Free memory was 133.0 MB in the beginning and 101.9 MB in the end (delta: 31.0 MB). Peak memory consumption was 133.9 MB. Max. memory is 8.0 GB. [2020-11-07 06:49:44,836 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 152.0 MB. Free memory was 126.4 MB in the beginning and 126.3 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 331.95 ms. Allocated memory is still 152.0 MB. Free memory was 128.6 MB in the beginning and 118.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 78.81 ms. Allocated memory is still 152.0 MB. Free memory was 118.9 MB in the beginning and 117.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 804.96 ms. Allocated memory is still 152.0 MB. Free memory was 117.5 MB in the beginning and 133.5 MB in the end (delta: -16.0 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 31516.22 ms. Allocated memory was 152.0 MB in the beginning and 222.3 MB in the end (delta: 70.3 MB). Free memory was 133.0 MB in the beginning and 101.9 MB in the end (delta: 31.0 MB). Peak memory consumption was 133.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 24]: Loop Invariant Derived loop invariant: (((l <= i + j + k && i + j + k <= l) && n <= 4294967296 * (n / 4294967296) + 20000001) || !(SIZE <= 20000001)) || !(20000001 <= SIZE) - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 25.9s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 393 SDtfs, 848 SDslu, 1092 SDs, 0 SdLazy, 2200 SolverSat, 183 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 49 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 49 LocationsWithAnnotation, 165 PreInvPairs, 230 NumberOfFragments, 668 HoareAnnotationTreeSize, 165 FomulaSimplifications, 111642 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 49 FomulaSimplificationsInter, 9954 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 517 ConstructedInterpolants, 0 QuantifiedInterpolants, 196401 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 47/200 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...