/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:46:39,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:46:39,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:46:39,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:46:39,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:46:39,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:46:39,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:46:39,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:46:39,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:46:39,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:46:39,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:46:39,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:46:39,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:46:39,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:46:39,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:46:39,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:46:39,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:46:39,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:46:39,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:46:39,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:46:39,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:46:39,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:46:39,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:46:39,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:46:39,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:46:39,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:46:39,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:46:39,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:46:39,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:46:39,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:46:39,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:46:39,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:46:39,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:46:39,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:46:39,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:46:39,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:46:39,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:46:39,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:46:39,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:46:39,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:46:39,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:46:39,317 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 00:46:39,341 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:46:39,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:46:39,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:46:39,347 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:46:39,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:46:39,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:46:39,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:46:39,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:46:39,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:46:39,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:46:39,350 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:46:39,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:46:39,350 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:46:39,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:46:39,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:46:39,352 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:46:39,352 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:46:39,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:46:39,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:46:39,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:46:39,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:46:39,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:46:39,354 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 [2020-11-07 00:46:39,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:46:39,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:46:39,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:46:39,781 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:46:39,783 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:46:39,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-11-07 00:46:39,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a3e879e/b251847d0ddc4a08b1e8279e9b129033/FLAG91ed1d5eb [2020-11-07 00:46:40,479 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:46:40,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-11-07 00:46:40,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a3e879e/b251847d0ddc4a08b1e8279e9b129033/FLAG91ed1d5eb [2020-11-07 00:46:40,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a3e879e/b251847d0ddc4a08b1e8279e9b129033 [2020-11-07 00:46:40,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:46:40,882 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:46:40,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:46:40,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:46:40,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:46:40,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:46:40" (1/1) ... [2020-11-07 00:46:40,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da179a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:40, skipping insertion in model container [2020-11-07 00:46:40,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:46:40" (1/1) ... [2020-11-07 00:46:40,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:46:40,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:46:41,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:46:41,142 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:46:41,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:46:41,187 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:46:41,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:41 WrapperNode [2020-11-07 00:46:41,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:46:41,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:46:41,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:46:41,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:46:41,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:41" (1/1) ... [2020-11-07 00:46:41,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:41" (1/1) ... [2020-11-07 00:46:41,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:41" (1/1) ... [2020-11-07 00:46:41,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:41" (1/1) ... [2020-11-07 00:46:41,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:41" (1/1) ... [2020-11-07 00:46:41,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:41" (1/1) ... [2020-11-07 00:46:41,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:41" (1/1) ... [2020-11-07 00:46:41,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:46:41,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:46:41,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:46:41,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:46:41,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:41" (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 00:46:41,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:46:41,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:46:41,321 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:46:41,321 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:46:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:46:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:46:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:46:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:46:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:46:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:46:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:46:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:46:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:46:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:46:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:46:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:46:41,773 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:46:41,773 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 00:46:41,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:46:41 BoogieIcfgContainer [2020-11-07 00:46:41,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:46:41,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:46:41,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:46:41,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:46:41,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:46:40" (1/3) ... [2020-11-07 00:46:41,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6e17ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:46:41, skipping insertion in model container [2020-11-07 00:46:41,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:41" (2/3) ... [2020-11-07 00:46:41,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6e17ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:46:41, skipping insertion in model container [2020-11-07 00:46:41,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:46:41" (3/3) ... [2020-11-07 00:46:41,784 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-11-07 00:46:41,801 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:46:41,805 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:46:41,823 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:46:41,845 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:46:41,845 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:46:41,845 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:46:41,845 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:46:41,845 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:46:41,846 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:46:41,846 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:46:41,846 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:46:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-11-07 00:46:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-07 00:46:41,872 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:41,872 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, 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 00:46:41,873 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:41,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:41,879 INFO L82 PathProgramCache]: Analyzing trace with hash 561928489, now seen corresponding path program 1 times [2020-11-07 00:46:41,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:41,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [654558938] [2020-11-07 00:46:41,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:41,964 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:42,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:42,331 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 00:46:42,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [654558938] [2020-11-07 00:46:42,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:42,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:42,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890611824] [2020-11-07 00:46:42,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:42,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:42,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:42,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:42,364 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2020-11-07 00:46:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:42,840 INFO L93 Difference]: Finished difference Result 181 states and 243 transitions. [2020-11-07 00:46:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:42,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-11-07 00:46:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:42,856 INFO L225 Difference]: With dead ends: 181 [2020-11-07 00:46:42,857 INFO L226 Difference]: Without dead ends: 120 [2020-11-07 00:46:42,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:46:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-11-07 00:46:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2020-11-07 00:46:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-07 00:46:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions. [2020-11-07 00:46:42,937 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 58 [2020-11-07 00:46:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:42,938 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions. [2020-11-07 00:46:42,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions. [2020-11-07 00:46:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 00:46:42,940 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:42,941 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, 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 00:46:42,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:46:42,941 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:42,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1435115152, now seen corresponding path program 1 times [2020-11-07 00:46:42,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:42,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150178626] [2020-11-07 00:46:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:42,947 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:43,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:43,114 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 00:46:43,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150178626] [2020-11-07 00:46:43,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:43,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:43,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063319122] [2020-11-07 00:46:43,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:43,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:43,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:43,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:43,119 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand 4 states. [2020-11-07 00:46:43,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:43,409 INFO L93 Difference]: Finished difference Result 144 states and 185 transitions. [2020-11-07 00:46:43,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:43,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-11-07 00:46:43,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:43,413 INFO L225 Difference]: With dead ends: 144 [2020-11-07 00:46:43,413 INFO L226 Difference]: Without dead ends: 141 [2020-11-07 00:46:43,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:46:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-11-07 00:46:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2020-11-07 00:46:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-07 00:46:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2020-11-07 00:46:43,445 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 59 [2020-11-07 00:46:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:43,445 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2020-11-07 00:46:43,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2020-11-07 00:46:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 00:46:43,448 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:43,448 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, 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 00:46:43,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:46:43,448 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:43,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:43,449 INFO L82 PathProgramCache]: Analyzing trace with hash 247511734, now seen corresponding path program 1 times [2020-11-07 00:46:43,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:43,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265069603] [2020-11-07 00:46:43,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:43,453 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:43,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:43,537 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 00:46:43,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265069603] [2020-11-07 00:46:43,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:43,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:43,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705077416] [2020-11-07 00:46:43,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:43,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:43,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:43,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:43,541 INFO L87 Difference]: Start difference. First operand 119 states and 150 transitions. Second operand 4 states. [2020-11-07 00:46:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:43,809 INFO L93 Difference]: Finished difference Result 275 states and 367 transitions. [2020-11-07 00:46:43,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:43,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-11-07 00:46:43,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:43,812 INFO L225 Difference]: With dead ends: 275 [2020-11-07 00:46:43,812 INFO L226 Difference]: Without dead ends: 193 [2020-11-07 00:46:43,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:46:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-11-07 00:46:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2020-11-07 00:46:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-11-07 00:46:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 249 transitions. [2020-11-07 00:46:43,870 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 249 transitions. Word has length 59 [2020-11-07 00:46:43,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:43,871 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 249 transitions. [2020-11-07 00:46:43,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 249 transitions. [2020-11-07 00:46:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:46:43,873 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:43,874 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, 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 00:46:43,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:46:43,875 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:43,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:43,876 INFO L82 PathProgramCache]: Analyzing trace with hash 134996116, now seen corresponding path program 1 times [2020-11-07 00:46:43,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:43,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [181766230] [2020-11-07 00:46:43,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:43,885 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:43,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:44,021 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 00:46:44,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [181766230] [2020-11-07 00:46:44,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:44,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:44,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490444072] [2020-11-07 00:46:44,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:44,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:44,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:44,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:44,025 INFO L87 Difference]: Start difference. First operand 192 states and 249 transitions. Second operand 4 states. [2020-11-07 00:46:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:44,256 INFO L93 Difference]: Finished difference Result 234 states and 306 transitions. [2020-11-07 00:46:44,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:44,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-11-07 00:46:44,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:44,259 INFO L225 Difference]: With dead ends: 234 [2020-11-07 00:46:44,260 INFO L226 Difference]: Without dead ends: 231 [2020-11-07 00:46:44,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:46:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-11-07 00:46:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 192. [2020-11-07 00:46:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-11-07 00:46:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 247 transitions. [2020-11-07 00:46:44,313 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 247 transitions. Word has length 60 [2020-11-07 00:46:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:44,313 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 247 transitions. [2020-11-07 00:46:44,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 247 transitions. [2020-11-07 00:46:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:46:44,315 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:44,315 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, 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 00:46:44,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:46:44,316 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:44,316 INFO L82 PathProgramCache]: Analyzing trace with hash -909461547, now seen corresponding path program 1 times [2020-11-07 00:46:44,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:44,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [360524949] [2020-11-07 00:46:44,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:44,320 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:44,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:44,389 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 00:46:44,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [360524949] [2020-11-07 00:46:44,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:44,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:44,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902498419] [2020-11-07 00:46:44,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:44,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:44,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:44,393 INFO L87 Difference]: Start difference. First operand 192 states and 247 transitions. Second operand 4 states. [2020-11-07 00:46:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:44,661 INFO L93 Difference]: Finished difference Result 488 states and 650 transitions. [2020-11-07 00:46:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:44,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-11-07 00:46:44,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:44,664 INFO L225 Difference]: With dead ends: 488 [2020-11-07 00:46:44,664 INFO L226 Difference]: Without dead ends: 333 [2020-11-07 00:46:44,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:46:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-11-07 00:46:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2020-11-07 00:46:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-11-07 00:46:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 431 transitions. [2020-11-07 00:46:44,731 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 431 transitions. Word has length 60 [2020-11-07 00:46:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:44,731 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 431 transitions. [2020-11-07 00:46:44,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 431 transitions. [2020-11-07 00:46:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:46:44,733 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:44,733 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, 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 00:46:44,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:46:44,734 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:44,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:44,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1879083938, now seen corresponding path program 1 times [2020-11-07 00:46:44,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:44,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2125505793] [2020-11-07 00:46:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:44,737 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:44,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:44,823 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 00:46:44,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2125505793] [2020-11-07 00:46:44,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:44,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:44,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475678404] [2020-11-07 00:46:44,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:44,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:44,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:44,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:44,827 INFO L87 Difference]: Start difference. First operand 332 states and 431 transitions. Second operand 4 states. [2020-11-07 00:46:45,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:45,117 INFO L93 Difference]: Finished difference Result 896 states and 1186 transitions. [2020-11-07 00:46:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:45,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-11-07 00:46:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:45,121 INFO L225 Difference]: With dead ends: 896 [2020-11-07 00:46:45,122 INFO L226 Difference]: Without dead ends: 601 [2020-11-07 00:46:45,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:46:45,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-11-07 00:46:45,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 600. [2020-11-07 00:46:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-11-07 00:46:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 775 transitions. [2020-11-07 00:46:45,239 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 775 transitions. Word has length 61 [2020-11-07 00:46:45,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:45,240 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 775 transitions. [2020-11-07 00:46:45,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 775 transitions. [2020-11-07 00:46:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:46:45,241 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:45,242 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, 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 00:46:45,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:46:45,242 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:45,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:45,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1513976804, now seen corresponding path program 1 times [2020-11-07 00:46:45,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:45,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [889873231] [2020-11-07 00:46:45,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:45,245 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:45,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:45,308 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 00:46:45,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [889873231] [2020-11-07 00:46:45,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:45,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:45,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241928935] [2020-11-07 00:46:45,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:45,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:45,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:45,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:45,310 INFO L87 Difference]: Start difference. First operand 600 states and 775 transitions. Second operand 4 states. [2020-11-07 00:46:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:45,617 INFO L93 Difference]: Finished difference Result 732 states and 946 transitions. [2020-11-07 00:46:45,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:45,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-11-07 00:46:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:45,623 INFO L225 Difference]: With dead ends: 732 [2020-11-07 00:46:45,623 INFO L226 Difference]: Without dead ends: 729 [2020-11-07 00:46:45,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:46:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2020-11-07 00:46:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 600. [2020-11-07 00:46:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-11-07 00:46:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 767 transitions. [2020-11-07 00:46:45,770 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 767 transitions. Word has length 61 [2020-11-07 00:46:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:45,770 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 767 transitions. [2020-11-07 00:46:45,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 767 transitions. [2020-11-07 00:46:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 00:46:45,772 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:45,772 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, 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 00:46:45,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:46:45,772 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:45,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:45,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1092518240, now seen corresponding path program 1 times [2020-11-07 00:46:45,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:45,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1183629256] [2020-11-07 00:46:45,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:45,776 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:45,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:45,837 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 00:46:45,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1183629256] [2020-11-07 00:46:45,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:45,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:45,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674685891] [2020-11-07 00:46:45,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:45,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:45,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:45,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:45,840 INFO L87 Difference]: Start difference. First operand 600 states and 767 transitions. Second operand 4 states. [2020-11-07 00:46:46,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:46,162 INFO L93 Difference]: Finished difference Result 724 states and 922 transitions. [2020-11-07 00:46:46,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:46,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-11-07 00:46:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:46,167 INFO L225 Difference]: With dead ends: 724 [2020-11-07 00:46:46,167 INFO L226 Difference]: Without dead ends: 721 [2020-11-07 00:46:46,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:46:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2020-11-07 00:46:46,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 600. [2020-11-07 00:46:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-11-07 00:46:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 759 transitions. [2020-11-07 00:46:46,304 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 759 transitions. Word has length 62 [2020-11-07 00:46:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:46,304 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 759 transitions. [2020-11-07 00:46:46,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 759 transitions. [2020-11-07 00:46:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 00:46:46,305 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:46,306 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, 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 00:46:46,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:46:46,306 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:46,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1870307711, now seen corresponding path program 1 times [2020-11-07 00:46:46,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:46,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [392847590] [2020-11-07 00:46:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:46,311 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:46,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:46,390 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 00:46:46,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [392847590] [2020-11-07 00:46:46,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:46,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:46,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946846449] [2020-11-07 00:46:46,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:46,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:46,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:46,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:46,398 INFO L87 Difference]: Start difference. First operand 600 states and 759 transitions. Second operand 4 states. [2020-11-07 00:46:46,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:46,781 INFO L93 Difference]: Finished difference Result 1676 states and 2138 transitions. [2020-11-07 00:46:46,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:46,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-11-07 00:46:46,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:46,788 INFO L225 Difference]: With dead ends: 1676 [2020-11-07 00:46:46,788 INFO L226 Difference]: Without dead ends: 1113 [2020-11-07 00:46:46,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:46:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2020-11-07 00:46:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1112. [2020-11-07 00:46:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2020-11-07 00:46:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1383 transitions. [2020-11-07 00:46:46,970 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1383 transitions. Word has length 62 [2020-11-07 00:46:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:46,970 INFO L481 AbstractCegarLoop]: Abstraction has 1112 states and 1383 transitions. [2020-11-07 00:46:46,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1383 transitions. [2020-11-07 00:46:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 00:46:46,972 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:46,972 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, 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 00:46:46,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:46:46,973 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:46,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:46,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2137320306, now seen corresponding path program 1 times [2020-11-07 00:46:46,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:46,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [133425651] [2020-11-07 00:46:46,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:46,977 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:47,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:47,026 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 00:46:47,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [133425651] [2020-11-07 00:46:47,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:47,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:47,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624521644] [2020-11-07 00:46:47,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:47,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:47,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:47,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:47,029 INFO L87 Difference]: Start difference. First operand 1112 states and 1383 transitions. Second operand 4 states. [2020-11-07 00:46:47,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:47,594 INFO L93 Difference]: Finished difference Result 3164 states and 3946 transitions. [2020-11-07 00:46:47,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:47,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-11-07 00:46:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:47,603 INFO L225 Difference]: With dead ends: 3164 [2020-11-07 00:46:47,603 INFO L226 Difference]: Without dead ends: 1625 [2020-11-07 00:46:47,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:46:47,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2020-11-07 00:46:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1624. [2020-11-07 00:46:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2020-11-07 00:46:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1943 transitions. [2020-11-07 00:46:47,872 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1943 transitions. Word has length 63 [2020-11-07 00:46:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:47,873 INFO L481 AbstractCegarLoop]: Abstraction has 1624 states and 1943 transitions. [2020-11-07 00:46:47,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1943 transitions. [2020-11-07 00:46:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 00:46:47,875 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:47,875 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, 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 00:46:47,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:46:47,875 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash -912193112, now seen corresponding path program 1 times [2020-11-07 00:46:47,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:47,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [262997796] [2020-11-07 00:46:47,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:47,879 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:47,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:47,925 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 00:46:47,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [262997796] [2020-11-07 00:46:47,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:47,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:47,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603074769] [2020-11-07 00:46:47,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:47,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:47,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:47,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:47,928 INFO L87 Difference]: Start difference. First operand 1624 states and 1943 transitions. Second operand 4 states. [2020-11-07 00:46:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:48,366 INFO L93 Difference]: Finished difference Result 1836 states and 2170 transitions. [2020-11-07 00:46:48,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:48,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-11-07 00:46:48,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:48,373 INFO L225 Difference]: With dead ends: 1836 [2020-11-07 00:46:48,373 INFO L226 Difference]: Without dead ends: 1321 [2020-11-07 00:46:48,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:46:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2020-11-07 00:46:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1112. [2020-11-07 00:46:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2020-11-07 00:46:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1303 transitions. [2020-11-07 00:46:48,520 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1303 transitions. Word has length 63 [2020-11-07 00:46:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:48,520 INFO L481 AbstractCegarLoop]: Abstraction has 1112 states and 1303 transitions. [2020-11-07 00:46:48,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1303 transitions. [2020-11-07 00:46:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-07 00:46:48,522 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:48,522 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, 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 00:46:48,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:46:48,523 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:48,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:48,523 INFO L82 PathProgramCache]: Analyzing trace with hash 382930092, now seen corresponding path program 1 times [2020-11-07 00:46:48,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:48,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [798056074] [2020-11-07 00:46:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:48,526 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:48,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:48,583 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 00:46:48,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [798056074] [2020-11-07 00:46:48,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:48,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:48,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104834522] [2020-11-07 00:46:48,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:48,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:48,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:48,586 INFO L87 Difference]: Start difference. First operand 1112 states and 1303 transitions. Second operand 4 states. [2020-11-07 00:46:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:48,833 INFO L93 Difference]: Finished difference Result 1112 states and 1303 transitions. [2020-11-07 00:46:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:48,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-11-07 00:46:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:48,834 INFO L225 Difference]: With dead ends: 1112 [2020-11-07 00:46:48,834 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:46:48,838 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:46:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:46:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:46:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:46:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:46:48,839 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2020-11-07 00:46:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:48,840 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:46:48,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:46:48,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:46:48,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:46:48,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:46:49,139 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 31 [2020-11-07 00:46:49,637 WARN L194 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 53 [2020-11-07 00:46:49,808 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 41 [2020-11-07 00:46:50,007 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-11-07 00:46:50,328 WARN L194 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-11-07 00:46:50,453 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-11-07 00:46:50,603 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-11-07 00:46:50,984 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-11-07 00:46:51,126 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 45 [2020-11-07 00:46:51,509 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-11-07 00:46:51,914 WARN L194 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-07 00:46:52,255 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 39 [2020-11-07 00:46:52,820 WARN L194 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 00:46:54,046 WARN L194 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-11-07 00:46:55,213 WARN L194 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 00:46:55,774 WARN L194 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 00:46:55,893 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 00:46:56,106 WARN L194 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 00:46:56,648 WARN L194 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 00:46:57,952 WARN L194 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 00:46:58,205 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 00:46:58,472 WARN L194 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 00:46:59,065 WARN L194 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 00:47:00,221 WARN L194 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 00:47:01,543 WARN L194 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-11-07 00:47:01,792 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 00:47:04,612 WARN L194 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 00:47:05,091 WARN L194 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 00:47:05,196 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 00:47:05,311 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 00:47:05,579 WARN L194 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 00:47:05,588 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 00:47:05,588 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 00:47:05,588 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:47:05,589 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 00:47:05,589 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 00:47:05,589 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 00:47:05,589 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:47:05,589 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 00:47:05,590 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:47:05,590 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:47:05,590 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)|) (= |#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 00:47:05,591 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 00:47:05,591 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 00:47:05,591 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:47:05,591 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:47:05,591 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:47:05,591 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:47:05,591 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:47:05,592 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 00:47:05,592 INFO L262 CegarLoopResult]: At program point L60-1(lines 29 104) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-11-07 00:47:05,592 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2020-11-07 00:47:05,592 INFO L262 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (let ((.cse3 (= main_~p5~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p6~0 0)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse4 .cse6 .cse5))) [2020-11-07 00:47:05,593 INFO L262 CegarLoopResult]: At program point L52-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-11-07 00:47:05,593 INFO L269 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-11-07 00:47:05,593 INFO L269 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-11-07 00:47:05,593 INFO L269 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-11-07 00:47:05,593 INFO L269 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-11-07 00:47:05,594 INFO L262 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-11-07 00:47:05,594 INFO L269 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-11-07 00:47:05,594 INFO L262 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-11-07 00:47:05,594 INFO L262 CegarLoopResult]: At program point L94-1(lines 29 104) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2020-11-07 00:47:05,594 INFO L262 CegarLoopResult]: At program point L86(line 86) the Hoare annotation is: (let ((.cse3 (= main_~p5~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p6~0 0)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse4 .cse6 .cse5))) [2020-11-07 00:47:05,594 INFO L262 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 00:47:05,595 INFO L269 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-11-07 00:47:05,595 INFO L269 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-11-07 00:47:05,595 INFO L269 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-11-07 00:47:05,595 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 00:47:05,595 INFO L262 CegarLoopResult]: At program point L95(line 95) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1))) (or (and (= main_~lk6~0 1) .cse0) (and (= main_~p6~0 0) .cse0))) [2020-11-07 00:47:05,595 INFO L269 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-11-07 00:47:05,595 INFO L262 CegarLoopResult]: At program point L79-1(lines 29 104) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse4 (= main_~p6~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse0 .cse6 .cse4 .cse2) (and .cse4 .cse1 .cse2 .cse7) (and .cse6 .cse4 .cse7 .cse5) (and .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse3 .cse7 .cse5) (and .cse0 .cse4 .cse1 .cse2) (and .cse4 .cse1 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3) (and .cse0 .cse6 .cse3 .cse5) (and .cse6 .cse4 .cse2 .cse7) (and .cse6 .cse2 .cse3 .cse7) (and .cse0 .cse6 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse3 .cse5))) [2020-11-07 00:47:05,596 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2020-11-07 00:47:05,596 INFO L269 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-11-07 00:47:05,596 INFO L262 CegarLoopResult]: At program point L96(line 96) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1))) (or (and (= main_~lk6~0 1) .cse0) (and (= main_~p6~0 0) .cse0))) [2020-11-07 00:47:05,596 INFO L269 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-11-07 00:47:05,596 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2020-11-07 00:47:05,596 INFO L269 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: true [2020-11-07 00:47:05,596 INFO L269 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: true [2020-11-07 00:47:05,597 INFO L262 CegarLoopResult]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse5 (= main_~p4~0 0)) (.cse8 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse1 .cse3 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse1 .cse3 .cse4 .cse5 .cse8) (and .cse6 .cse7 .cse3 .cse5 .cse8) (and .cse6 .cse7 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse6 .cse3 .cse4 .cse5 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3) (and .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse3 .cse5 .cse8))) [2020-11-07 00:47:05,597 INFO L269 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-11-07 00:47:05,597 INFO L269 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-11-07 00:47:05,597 INFO L269 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-11-07 00:47:05,597 INFO L269 CegarLoopResult]: At program point L105(lines 7 109) the Hoare annotation is: true [2020-11-07 00:47:05,597 INFO L269 CegarLoopResult]: At program point L31(lines 31 33) the Hoare annotation is: true [2020-11-07 00:47:05,597 INFO L262 CegarLoopResult]: At program point L64-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-11-07 00:47:05,598 INFO L262 CegarLoopResult]: At program point L89-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse3 (= main_~p6~0 0)) (.cse2 (= main_~p5~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-11-07 00:47:05,598 INFO L269 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-11-07 00:47:05,598 INFO L262 CegarLoopResult]: At program point L56-1(lines 29 104) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-11-07 00:47:05,598 INFO L269 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-11-07 00:47:05,598 INFO L269 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-11-07 00:47:05,598 INFO L262 CegarLoopResult]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse5 (= main_~p4~0 0)) (.cse8 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse1 .cse3 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse1 .cse3 .cse4 .cse5 .cse8) (and .cse6 .cse7 .cse3 .cse5 .cse8) (and .cse6 .cse7 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse6 .cse3 .cse4 .cse5 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3) (and .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse3 .cse5 .cse8))) [2020-11-07 00:47:05,598 INFO L269 CegarLoopResult]: At program point L48(lines 48 50) the Hoare annotation is: true [2020-11-07 00:47:05,599 INFO L269 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-11-07 00:47:05,599 INFO L262 CegarLoopResult]: At program point L48-2(lines 29 104) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 00:47:05,599 INFO L269 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-11-07 00:47:05,599 INFO L262 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-11-07 00:47:05,599 INFO L262 CegarLoopResult]: At program point L90(line 90) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse2 .cse3) (and .cse0 .cse1 .cse4))) [2020-11-07 00:47:05,600 INFO L262 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-11-07 00:47:05,600 INFO L269 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-11-07 00:47:05,600 INFO L269 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: true [2020-11-07 00:47:05,600 INFO L262 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: false [2020-11-07 00:47:05,600 INFO L262 CegarLoopResult]: At program point L74-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~p2~0 0)) (.cse5 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse9 (= main_~p4~0 0)) (.cse7 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse3 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse8) (and .cse1 .cse4 .cse9 .cse7 .cse8) (and .cse6 .cse3 .cse4 .cse9 .cse7) (and .cse0 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse4 .cse7 .cse8) (and .cse6 .cse2 .cse4 .cse9 .cse8) (and .cse0 .cse6 .cse4 .cse7 .cse8) (and .cse1 .cse3 .cse4 .cse9 .cse7) (and .cse0 .cse1 .cse5 .cse3 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse6 .cse4 .cse9 .cse7 .cse8) (and .cse5 .cse6 .cse9 .cse7 .cse8) (and .cse0 .cse5 .cse6 .cse2 .cse8) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse2 .cse4 .cse8) (and .cse6 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse5 .cse6 .cse2 .cse3) (and .cse1 .cse5 .cse3 .cse9 .cse7) (and .cse1 .cse5 .cse2 .cse3 .cse9) (and .cse0 .cse6 .cse3 .cse4 .cse7) (and .cse1 .cse5 .cse2 .cse9 .cse8) (and .cse5 .cse6 .cse2 .cse9 .cse8) (and .cse1 .cse2 .cse4 .cse9 .cse8) (and .cse1 .cse5 .cse9 .cse7 .cse8) (and .cse0 .cse1 .cse5 .cse7 .cse8) (and .cse5 .cse6 .cse2 .cse3 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse8) (and .cse5 .cse6 .cse3 .cse9 .cse7))) [2020-11-07 00:47:05,600 INFO L269 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-11-07 00:47:05,601 INFO L269 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-11-07 00:47:05,601 INFO L269 CegarLoopResult]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2020-11-07 00:47:05,601 INFO L262 CegarLoopResult]: At program point L91(line 91) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse2 .cse3) (and .cse0 .cse1 .cse4))) [2020-11-07 00:47:05,601 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 00:47:05,601 INFO L269 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-11-07 00:47:05,601 INFO L269 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-11-07 00:47:05,601 INFO L262 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: false [2020-11-07 00:47:05,602 INFO L262 CegarLoopResult]: At program point L75(line 75) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse10 (= main_~lk2~0 1)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5))) [2020-11-07 00:47:05,602 INFO L269 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-11-07 00:47:05,602 INFO L269 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-11-07 00:47:05,602 INFO L262 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2020-11-07 00:47:05,602 INFO L262 CegarLoopResult]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2020-11-07 00:47:05,602 INFO L269 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-11-07 00:47:05,602 INFO L262 CegarLoopResult]: At program point L84-1(lines 29 104) the Hoare annotation is: (let ((.cse5 (= main_~lk6~0 1)) (.cse4 (= main_~p5~0 0)) (.cse1 (= main_~p4~0 0)) (.cse3 (= main_~lk4~0 1)) (.cse0 (= main_~p6~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse3 .cse5 .cse2) (and .cse4 .cse5 .cse1) (and .cse5 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse4 .cse1) (and .cse3 .cse0 .cse2))) [2020-11-07 00:47:05,602 INFO L269 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-11-07 00:47:05,603 INFO L262 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse10 (= main_~lk2~0 1)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5))) [2020-11-07 00:47:05,603 INFO L262 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (= main_~lk6~0 1) [2020-11-07 00:47:05,603 INFO L262 CegarLoopResult]: At program point L68-1(lines 29 104) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2020-11-07 00:47:05,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:47:05 BoogieIcfgContainer [2020-11-07 00:47:05,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:47:05,618 INFO L168 Benchmark]: Toolchain (without parser) took 24741.59 ms. Allocated memory was 154.1 MB in the beginning and 537.9 MB in the end (delta: 383.8 MB). Free memory was 130.1 MB in the beginning and 422.3 MB in the end (delta: -292.1 MB). Peak memory consumption was 319.7 MB. Max. memory is 8.0 GB. [2020-11-07 00:47:05,619 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 154.1 MB. Free memory was 128.3 MB in the beginning and 128.2 MB in the end (delta: 79.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:47:05,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.00 ms. Allocated memory is still 154.1 MB. Free memory was 129.4 MB in the beginning and 119.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:47:05,620 INFO L168 Benchmark]: Boogie Preprocessor took 50.06 ms. Allocated memory is still 154.1 MB. Free memory was 119.8 MB in the beginning and 118.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:47:05,620 INFO L168 Benchmark]: RCFGBuilder took 535.57 ms. Allocated memory is still 154.1 MB. Free memory was 118.2 MB in the beginning and 130.4 MB in the end (delta: -12.3 MB). Peak memory consumption was 17.5 MB. Max. memory is 8.0 GB. [2020-11-07 00:47:05,621 INFO L168 Benchmark]: TraceAbstraction took 23838.88 ms. Allocated memory was 154.1 MB in the beginning and 537.9 MB in the end (delta: 383.8 MB). Free memory was 129.9 MB in the beginning and 422.3 MB in the end (delta: -292.4 MB). Peak memory consumption was 317.9 MB. Max. memory is 8.0 GB. [2020-11-07 00:47:05,624 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.22 ms. Allocated memory is still 154.1 MB. Free memory was 128.3 MB in the beginning and 128.2 MB in the end (delta: 79.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 300.00 ms. Allocated memory is still 154.1 MB. Free memory was 129.4 MB in the beginning and 119.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 50.06 ms. Allocated memory is still 154.1 MB. Free memory was 119.8 MB in the beginning and 118.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 535.57 ms. Allocated memory is still 154.1 MB. Free memory was 118.2 MB in the beginning and 130.4 MB in the end (delta: -12.3 MB). Peak memory consumption was 17.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 23838.88 ms. Allocated memory was 154.1 MB in the beginning and 537.9 MB in the end (delta: 383.8 MB). Free memory was 129.9 MB in the beginning and 422.3 MB in the end (delta: -292.4 MB). Peak memory consumption was 317.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: 29]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1456 SDtfs, 1641 SDslu, 202 SDs, 0 SdLazy, 1044 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1624occurred 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: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 526 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 90 LocationsWithAnnotation, 134 PreInvPairs, 2190 NumberOfFragments, 5886 HoareAnnotationTreeSize, 134 FomulaSimplifications, 372834 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 90 FomulaSimplificationsInter, 12518 FormulaSimplificationTreeSizeReductionInter, 13.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...