/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.1-dev-b7b32d2 [2021-02-21 20:32:49,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-21 20:32:49,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-21 20:32:49,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-21 20:32:49,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-21 20:32:49,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-21 20:32:49,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-21 20:32:49,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-21 20:32:49,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-21 20:32:49,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-21 20:32:49,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-21 20:32:49,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-21 20:32:49,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-21 20:32:49,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-21 20:32:49,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-21 20:32:49,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-21 20:32:49,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-21 20:32:49,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-21 20:32:49,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-21 20:32:49,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-21 20:32:49,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-21 20:32:49,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-21 20:32:49,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-21 20:32:49,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-21 20:32:49,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-21 20:32:49,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-21 20:32:49,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-21 20:32:49,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-21 20:32:49,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-21 20:32:49,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-21 20:32:49,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-21 20:32:49,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-21 20:32:49,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-21 20:32:49,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-21 20:32:49,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-21 20:32:49,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-21 20:32:49,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-21 20:32:49,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-21 20:32:49,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-21 20:32:49,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-21 20:32:49,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-21 20:32:49,468 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-21 20:32:49,487 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-21 20:32:49,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-21 20:32:49,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-21 20:32:49,490 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-21 20:32:49,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-21 20:32:49,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-21 20:32:49,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-21 20:32:49,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-21 20:32:49,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-21 20:32:49,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-21 20:32:49,492 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-21 20:32:49,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-21 20:32:49,492 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-21 20:32:49,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-21 20:32:49,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-21 20:32:49,493 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-21 20:32:49,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-21 20:32:49,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-21 20:32:49,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-21 20:32:49,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-21 20:32:49,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-21 20:32:49,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-21 20:32:49,494 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 [2021-02-21 20:32:49,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-21 20:32:49,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-21 20:32:49,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-21 20:32:49,978 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-21 20:32:49,979 INFO L275 PluginConnector]: CDTParser initialized [2021-02-21 20:32:49,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2021-02-21 20:32:50,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85dc567cb/ab9b01c8b39f467983689054edfe93bd/FLAG81c00b247 [2021-02-21 20:32:50,836 INFO L306 CDTParser]: Found 1 translation units. [2021-02-21 20:32:50,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2021-02-21 20:32:50,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85dc567cb/ab9b01c8b39f467983689054edfe93bd/FLAG81c00b247 [2021-02-21 20:32:50,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85dc567cb/ab9b01c8b39f467983689054edfe93bd [2021-02-21 20:32:50,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-21 20:32:50,880 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-21 20:32:50,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-21 20:32:50,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-21 20:32:50,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-21 20:32:50,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:32:50" (1/1) ... [2021-02-21 20:32:50,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40af6daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:32:50, skipping insertion in model container [2021-02-21 20:32:50,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:32:50" (1/1) ... [2021-02-21 20:32:50,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-21 20:32:50,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-21 20:32:51,087 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c[2544,2557] [2021-02-21 20:32:51,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:32:51,103 INFO L203 MainTranslator]: Completed pre-run [2021-02-21 20:32:51,128 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c[2544,2557] [2021-02-21 20:32:51,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:32:51,147 INFO L208 MainTranslator]: Completed translation [2021-02-21 20:32:51,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:32:51 WrapperNode [2021-02-21 20:32:51,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-21 20:32:51,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-21 20:32:51,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-21 20:32:51,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-21 20:32:51,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:32:51" (1/1) ... [2021-02-21 20:32:51,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:32:51" (1/1) ... [2021-02-21 20:32:51,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:32:51" (1/1) ... [2021-02-21 20:32:51,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:32:51" (1/1) ... [2021-02-21 20:32:51,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:32:51" (1/1) ... [2021-02-21 20:32:51,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:32:51" (1/1) ... [2021-02-21 20:32:51,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:32:51" (1/1) ... [2021-02-21 20:32:51,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-21 20:32:51,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-21 20:32:51,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-21 20:32:51,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-21 20:32:51,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:32:51" (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 [2021-02-21 20:32:51,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-21 20:32:51,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-21 20:32:51,314 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-21 20:32:51,315 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-21 20:32:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-21 20:32:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-21 20:32:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-21 20:32:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-21 20:32:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-21 20:32:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-21 20:32:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-21 20:32:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-21 20:32:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-21 20:32:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-21 20:32:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-21 20:32:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-21 20:32:51,834 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-21 20:32:51,835 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-02-21 20:32:51,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:32:51 BoogieIcfgContainer [2021-02-21 20:32:51,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-21 20:32:51,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-21 20:32:51,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-21 20:32:51,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-21 20:32:51,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 08:32:50" (1/3) ... [2021-02-21 20:32:51,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c3e685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:32:51, skipping insertion in model container [2021-02-21 20:32:51,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:32:51" (2/3) ... [2021-02-21 20:32:51,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c3e685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:32:51, skipping insertion in model container [2021-02-21 20:32:51,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:32:51" (3/3) ... [2021-02-21 20:32:51,847 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2021-02-21 20:32:51,855 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-21 20:32:51,860 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-21 20:32:51,883 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-21 20:32:51,910 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-21 20:32:51,911 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-21 20:32:51,911 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-21 20:32:51,911 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-21 20:32:51,911 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-21 20:32:51,911 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-21 20:32:51,911 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-21 20:32:51,912 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-21 20:32:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2021-02-21 20:32:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-21 20:32:51,941 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:32:51,942 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] [2021-02-21 20:32:51,943 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:32:51,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:32:51,950 INFO L82 PathProgramCache]: Analyzing trace with hash 156622351, now seen corresponding path program 1 times [2021-02-21 20:32:51,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:32:51,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [271191362] [2021-02-21 20:32:51,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:32:52,045 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:32:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:52,233 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:52,236 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:52,239 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:52,240 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:32:52,268 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:52,269 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:52,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:32:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:52,375 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:52,377 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:32:52,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [271191362] [2021-02-21 20:32:52,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:32:52,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:32:52,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124993003] [2021-02-21 20:32:52,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:32:52,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:32:52,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:32:52,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:32:52,438 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2021-02-21 20:32:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:32:53,315 INFO L93 Difference]: Finished difference Result 178 states and 238 transitions. [2021-02-21 20:32:53,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:32:53,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2021-02-21 20:32:53,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:32:53,330 INFO L225 Difference]: With dead ends: 178 [2021-02-21 20:32:53,331 INFO L226 Difference]: Without dead ends: 120 [2021-02-21 20:32:53,335 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 [2021-02-21 20:32:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-02-21 20:32:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2021-02-21 20:32:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-02-21 20:32:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 150 transitions. [2021-02-21 20:32:53,409 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 150 transitions. Word has length 57 [2021-02-21 20:32:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:32:53,410 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 150 transitions. [2021-02-21 20:32:53,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:32:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions. [2021-02-21 20:32:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-02-21 20:32:53,413 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:32:53,413 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] [2021-02-21 20:32:53,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-21 20:32:53,413 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:32:53,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:32:53,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1202234617, now seen corresponding path program 1 times [2021-02-21 20:32:53,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:32:53,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1249569869] [2021-02-21 20:32:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:32:53,418 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:32:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:53,500 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:53,501 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:53,501 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:53,502 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:32:53,506 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:53,506 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:53,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:32:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:53,540 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:53,541 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:32:53,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1249569869] [2021-02-21 20:32:53,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:32:53,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:32:53,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375281623] [2021-02-21 20:32:53,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:32:53,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:32:53,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:32:53,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:32:53,551 INFO L87 Difference]: Start difference. First operand 118 states and 150 transitions. Second operand 4 states. [2021-02-21 20:32:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:32:53,791 INFO L93 Difference]: Finished difference Result 143 states and 183 transitions. [2021-02-21 20:32:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:32:53,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2021-02-21 20:32:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:32:53,795 INFO L225 Difference]: With dead ends: 143 [2021-02-21 20:32:53,795 INFO L226 Difference]: Without dead ends: 141 [2021-02-21 20:32:53,797 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 [2021-02-21 20:32:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-02-21 20:32:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2021-02-21 20:32:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-02-21 20:32:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2021-02-21 20:32:53,832 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 58 [2021-02-21 20:32:53,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:32:53,833 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2021-02-21 20:32:53,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:32:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2021-02-21 20:32:53,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-02-21 20:32:53,835 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:32:53,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:32:53,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-21 20:32:53,836 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:32:53,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:32:53,837 INFO L82 PathProgramCache]: Analyzing trace with hash 560570913, now seen corresponding path program 1 times [2021-02-21 20:32:53,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:32:53,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [267966809] [2021-02-21 20:32:53,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:32:53,841 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:32:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:53,898 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:53,899 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:53,901 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:53,905 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:32:53,910 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:53,911 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:53,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:32:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:53,971 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:53,972 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:32:53,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [267966809] [2021-02-21 20:32:53,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:32:53,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:32:53,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287418164] [2021-02-21 20:32:53,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:32:53,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:32:53,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:32:53,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:32:53,983 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand 4 states. [2021-02-21 20:32:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:32:54,246 INFO L93 Difference]: Finished difference Result 274 states and 365 transitions. [2021-02-21 20:32:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:32:54,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2021-02-21 20:32:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:32:54,249 INFO L225 Difference]: With dead ends: 274 [2021-02-21 20:32:54,249 INFO L226 Difference]: Without dead ends: 193 [2021-02-21 20:32:54,250 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 [2021-02-21 20:32:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-02-21 20:32:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2021-02-21 20:32:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2021-02-21 20:32:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 248 transitions. [2021-02-21 20:32:54,324 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 248 transitions. Word has length 58 [2021-02-21 20:32:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:32:54,324 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 248 transitions. [2021-02-21 20:32:54,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:32:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 248 transitions. [2021-02-21 20:32:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-02-21 20:32:54,335 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:32:54,335 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] [2021-02-21 20:32:54,338 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-21 20:32:54,338 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:32:54,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:32:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1569348316, now seen corresponding path program 1 times [2021-02-21 20:32:54,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:32:54,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1040381162] [2021-02-21 20:32:54,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:32:54,350 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:32:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:54,416 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:54,417 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:54,418 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:54,418 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:32:54,422 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:54,422 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:54,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:32:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:54,469 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:54,472 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:32:54,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1040381162] [2021-02-21 20:32:54,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:32:54,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:32:54,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178349401] [2021-02-21 20:32:54,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:32:54,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:32:54,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:32:54,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:32:54,479 INFO L87 Difference]: Start difference. First operand 191 states and 248 transitions. Second operand 4 states. [2021-02-21 20:32:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:32:54,700 INFO L93 Difference]: Finished difference Result 233 states and 304 transitions. [2021-02-21 20:32:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:32:54,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-02-21 20:32:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:32:54,703 INFO L225 Difference]: With dead ends: 233 [2021-02-21 20:32:54,703 INFO L226 Difference]: Without dead ends: 231 [2021-02-21 20:32:54,703 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 [2021-02-21 20:32:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-02-21 20:32:54,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 191. [2021-02-21 20:32:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2021-02-21 20:32:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 246 transitions. [2021-02-21 20:32:54,743 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 246 transitions. Word has length 59 [2021-02-21 20:32:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:32:54,744 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 246 transitions. [2021-02-21 20:32:54,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:32:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 246 transitions. [2021-02-21 20:32:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-02-21 20:32:54,745 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:32:54,746 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] [2021-02-21 20:32:54,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-21 20:32:54,746 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:32:54,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:32:54,747 INFO L82 PathProgramCache]: Analyzing trace with hash 198074819, now seen corresponding path program 1 times [2021-02-21 20:32:54,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:32:54,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [573384363] [2021-02-21 20:32:54,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:32:54,749 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:32:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:54,782 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:54,783 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:54,783 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:54,784 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:32:54,787 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:54,787 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:54,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:32:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:54,814 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:54,815 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:32:54,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [573384363] [2021-02-21 20:32:54,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:32:54,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:32:54,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950847303] [2021-02-21 20:32:54,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:32:54,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:32:54,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:32:54,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:32:54,823 INFO L87 Difference]: Start difference. First operand 191 states and 246 transitions. Second operand 4 states. [2021-02-21 20:32:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:32:55,072 INFO L93 Difference]: Finished difference Result 487 states and 648 transitions. [2021-02-21 20:32:55,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:32:55,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-02-21 20:32:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:32:55,076 INFO L225 Difference]: With dead ends: 487 [2021-02-21 20:32:55,076 INFO L226 Difference]: Without dead ends: 333 [2021-02-21 20:32:55,077 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 [2021-02-21 20:32:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-02-21 20:32:55,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2021-02-21 20:32:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2021-02-21 20:32:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 430 transitions. [2021-02-21 20:32:55,158 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 430 transitions. Word has length 59 [2021-02-21 20:32:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:32:55,158 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 430 transitions. [2021-02-21 20:32:55,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:32:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 430 transitions. [2021-02-21 20:32:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-02-21 20:32:55,160 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:32:55,160 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] [2021-02-21 20:32:55,160 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-21 20:32:55,160 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:32:55,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:32:55,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1845598165, now seen corresponding path program 1 times [2021-02-21 20:32:55,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:32:55,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1457502190] [2021-02-21 20:32:55,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:32:55,163 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:32:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:55,192 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:55,192 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:55,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:55,194 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:32:55,197 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:55,197 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:55,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:32:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:55,228 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:55,229 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:32:55,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1457502190] [2021-02-21 20:32:55,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:32:55,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:32:55,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125607269] [2021-02-21 20:32:55,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:32:55,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:32:55,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:32:55,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:32:55,238 INFO L87 Difference]: Start difference. First operand 331 states and 430 transitions. Second operand 4 states. [2021-02-21 20:32:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:32:55,574 INFO L93 Difference]: Finished difference Result 895 states and 1184 transitions. [2021-02-21 20:32:55,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:32:55,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2021-02-21 20:32:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:32:55,579 INFO L225 Difference]: With dead ends: 895 [2021-02-21 20:32:55,579 INFO L226 Difference]: Without dead ends: 601 [2021-02-21 20:32:55,581 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 [2021-02-21 20:32:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2021-02-21 20:32:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2021-02-21 20:32:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2021-02-21 20:32:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 774 transitions. [2021-02-21 20:32:55,721 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 774 transitions. Word has length 60 [2021-02-21 20:32:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:32:55,722 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 774 transitions. [2021-02-21 20:32:55,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:32:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 774 transitions. [2021-02-21 20:32:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-02-21 20:32:55,723 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:32:55,723 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] [2021-02-21 20:32:55,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-21 20:32:55,724 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:32:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:32:55,725 INFO L82 PathProgramCache]: Analyzing trace with hash -64970725, now seen corresponding path program 1 times [2021-02-21 20:32:55,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:32:55,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [823746013] [2021-02-21 20:32:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:32:55,727 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:32:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:55,751 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:55,751 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:55,752 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:55,753 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:32:55,756 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:55,757 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:55,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:32:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:55,788 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:55,789 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:32:55,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [823746013] [2021-02-21 20:32:55,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:32:55,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:32:55,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875806030] [2021-02-21 20:32:55,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:32:55,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:32:55,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:32:55,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:32:55,797 INFO L87 Difference]: Start difference. First operand 599 states and 774 transitions. Second operand 4 states. [2021-02-21 20:32:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:32:56,126 INFO L93 Difference]: Finished difference Result 731 states and 944 transitions. [2021-02-21 20:32:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:32:56,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2021-02-21 20:32:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:32:56,131 INFO L225 Difference]: With dead ends: 731 [2021-02-21 20:32:56,132 INFO L226 Difference]: Without dead ends: 729 [2021-02-21 20:32:56,133 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 [2021-02-21 20:32:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2021-02-21 20:32:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 599. [2021-02-21 20:32:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2021-02-21 20:32:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 766 transitions. [2021-02-21 20:32:56,250 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 766 transitions. Word has length 60 [2021-02-21 20:32:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:32:56,250 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 766 transitions. [2021-02-21 20:32:56,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:32:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 766 transitions. [2021-02-21 20:32:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-02-21 20:32:56,252 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:32:56,252 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] [2021-02-21 20:32:56,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-21 20:32:56,252 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:32:56,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:32:56,253 INFO L82 PathProgramCache]: Analyzing trace with hash -673905288, now seen corresponding path program 1 times [2021-02-21 20:32:56,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:32:56,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [808412088] [2021-02-21 20:32:56,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:32:56,255 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:32:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:56,277 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:56,278 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:56,278 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:56,279 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:32:56,283 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:56,283 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:56,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:32:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:56,314 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:56,315 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:32:56,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [808412088] [2021-02-21 20:32:56,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:32:56,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:32:56,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535166785] [2021-02-21 20:32:56,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:32:56,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:32:56,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:32:56,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:32:56,322 INFO L87 Difference]: Start difference. First operand 599 states and 766 transitions. Second operand 4 states. [2021-02-21 20:32:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:32:56,641 INFO L93 Difference]: Finished difference Result 723 states and 920 transitions. [2021-02-21 20:32:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:32:56,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-02-21 20:32:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:32:56,646 INFO L225 Difference]: With dead ends: 723 [2021-02-21 20:32:56,646 INFO L226 Difference]: Without dead ends: 721 [2021-02-21 20:32:56,647 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 [2021-02-21 20:32:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-02-21 20:32:56,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 599. [2021-02-21 20:32:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2021-02-21 20:32:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 758 transitions. [2021-02-21 20:32:56,745 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 758 transitions. Word has length 61 [2021-02-21 20:32:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:32:56,745 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 758 transitions. [2021-02-21 20:32:56,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:32:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 758 transitions. [2021-02-21 20:32:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-02-21 20:32:56,747 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:32:56,747 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] [2021-02-21 20:32:56,747 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-21 20:32:56,747 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:32:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:32:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1379214711, now seen corresponding path program 1 times [2021-02-21 20:32:56,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:32:56,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1774138289] [2021-02-21 20:32:56,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:32:56,751 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:32:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:56,800 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:56,803 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:56,804 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:56,805 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:32:56,810 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:56,812 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:56,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:32:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:56,842 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:56,843 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:32:56,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1774138289] [2021-02-21 20:32:56,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:32:56,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:32:56,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127701701] [2021-02-21 20:32:56,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:32:56,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:32:56,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:32:56,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:32:56,851 INFO L87 Difference]: Start difference. First operand 599 states and 758 transitions. Second operand 4 states. [2021-02-21 20:32:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:32:57,265 INFO L93 Difference]: Finished difference Result 1675 states and 2136 transitions. [2021-02-21 20:32:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:32:57,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-02-21 20:32:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:32:57,272 INFO L225 Difference]: With dead ends: 1675 [2021-02-21 20:32:57,272 INFO L226 Difference]: Without dead ends: 1113 [2021-02-21 20:32:57,275 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 [2021-02-21 20:32:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2021-02-21 20:32:57,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1111. [2021-02-21 20:32:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2021-02-21 20:32:57,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1382 transitions. [2021-02-21 20:32:57,471 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1382 transitions. Word has length 61 [2021-02-21 20:32:57,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:32:57,471 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 1382 transitions. [2021-02-21 20:32:57,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:32:57,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1382 transitions. [2021-02-21 20:32:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-02-21 20:32:57,473 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:32:57,473 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] [2021-02-21 20:32:57,473 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-21 20:32:57,473 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:32:57,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:32:57,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1923960111, now seen corresponding path program 1 times [2021-02-21 20:32:57,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:32:57,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1013941034] [2021-02-21 20:32:57,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:32:57,476 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:32:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:57,495 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:57,496 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:57,496 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:57,497 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:32:57,500 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:57,501 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:57,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:32:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:57,533 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:57,534 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:32:57,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1013941034] [2021-02-21 20:32:57,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:32:57,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:32:57,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828238402] [2021-02-21 20:32:57,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:32:57,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:32:57,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:32:57,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:32:57,541 INFO L87 Difference]: Start difference. First operand 1111 states and 1382 transitions. Second operand 4 states. [2021-02-21 20:32:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:32:57,983 INFO L93 Difference]: Finished difference Result 1323 states and 1624 transitions. [2021-02-21 20:32:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:32:57,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2021-02-21 20:32:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:32:57,991 INFO L225 Difference]: With dead ends: 1323 [2021-02-21 20:32:57,991 INFO L226 Difference]: Without dead ends: 1321 [2021-02-21 20:32:57,992 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 [2021-02-21 20:32:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2021-02-21 20:32:58,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1111. [2021-02-21 20:32:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2021-02-21 20:32:58,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1366 transitions. [2021-02-21 20:32:58,173 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1366 transitions. Word has length 62 [2021-02-21 20:32:58,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:32:58,174 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 1366 transitions. [2021-02-21 20:32:58,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:32:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1366 transitions. [2021-02-21 20:32:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-02-21 20:32:58,176 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:32:58,176 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] [2021-02-21 20:32:58,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-21 20:32:58,176 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:32:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:32:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash -193770103, now seen corresponding path program 1 times [2021-02-21 20:32:58,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:32:58,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [353646158] [2021-02-21 20:32:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:32:58,179 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:32:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:58,197 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:58,197 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:58,198 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:58,198 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:32:58,202 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:58,202 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:58,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:32:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:58,232 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:58,232 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:32:58,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [353646158] [2021-02-21 20:32:58,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:32:58,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:32:58,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745856607] [2021-02-21 20:32:58,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:32:58,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:32:58,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:32:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:32:58,239 INFO L87 Difference]: Start difference. First operand 1111 states and 1366 transitions. Second operand 4 states. [2021-02-21 20:32:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:32:58,790 INFO L93 Difference]: Finished difference Result 3161 states and 3895 transitions. [2021-02-21 20:32:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:32:58,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2021-02-21 20:32:58,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:32:58,796 INFO L225 Difference]: With dead ends: 3161 [2021-02-21 20:32:58,796 INFO L226 Difference]: Without dead ends: 1111 [2021-02-21 20:32:58,801 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 [2021-02-21 20:32:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2021-02-21 20:32:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2021-02-21 20:32:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2021-02-21 20:32:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1302 transitions. [2021-02-21 20:32:58,974 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1302 transitions. Word has length 62 [2021-02-21 20:32:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:32:58,974 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 1302 transitions. [2021-02-21 20:32:58,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:32:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1302 transitions. [2021-02-21 20:32:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-02-21 20:32:58,976 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:32:58,976 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] [2021-02-21 20:32:58,976 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-21 20:32:58,976 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:32:58,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:32:58,977 INFO L82 PathProgramCache]: Analyzing trace with hash 853409228, now seen corresponding path program 1 times [2021-02-21 20:32:58,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:32:58,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1356792960] [2021-02-21 20:32:58,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:32:58,979 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:32:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:58,996 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:58,996 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:58,997 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:58,997 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:32:59,000 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:59,001 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:59,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:32:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:32:59,031 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:32:59,032 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:32:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:32:59,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1356792960] [2021-02-21 20:32:59,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:32:59,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:32:59,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718653270] [2021-02-21 20:32:59,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:32:59,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:32:59,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:32:59,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:32:59,037 INFO L87 Difference]: Start difference. First operand 1111 states and 1302 transitions. Second operand 4 states. [2021-02-21 20:32:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:32:59,436 INFO L93 Difference]: Finished difference Result 1111 states and 1302 transitions. [2021-02-21 20:32:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:32:59,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2021-02-21 20:32:59,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:32:59,438 INFO L225 Difference]: With dead ends: 1111 [2021-02-21 20:32:59,438 INFO L226 Difference]: Without dead ends: 0 [2021-02-21 20:32:59,440 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 [2021-02-21 20:32:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-21 20:32:59,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-21 20:32:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-21 20:32:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-21 20:32:59,441 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2021-02-21 20:32:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:32:59,441 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-21 20:32:59,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:32:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-21 20:32:59,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-21 20:32:59,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-21 20:32:59,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-21 20:32:59,841 WARN L202 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 31 [2021-02-21 20:33:00,200 WARN L202 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 31 [2021-02-21 20:33:00,409 WARN L202 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 41 [2021-02-21 20:33:00,678 WARN L202 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2021-02-21 20:33:01,034 WARN L202 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2021-02-21 20:33:01,243 WARN L202 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2021-02-21 20:33:01,494 WARN L202 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2021-02-21 20:33:01,614 WARN L202 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 85 [2021-02-21 20:33:02,008 WARN L202 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2021-02-21 20:33:02,142 WARN L202 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 45 [2021-02-21 20:33:02,251 WARN L202 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 34 [2021-02-21 20:33:02,443 WARN L202 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 31 [2021-02-21 20:33:02,651 WARN L202 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2021-02-21 20:33:03,071 WARN L202 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-02-21 20:33:03,489 WARN L202 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 39 [2021-02-21 20:33:04,049 WARN L202 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-21 20:33:05,550 WARN L202 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-21 20:33:06,976 WARN L202 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-21 20:33:07,695 WARN L202 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-21 20:33:07,851 WARN L202 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-21 20:33:08,134 WARN L202 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-21 20:33:08,918 WARN L202 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-21 20:33:09,042 WARN L202 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-21 20:33:10,431 WARN L202 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-21 20:33:10,731 WARN L202 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-21 20:33:11,057 WARN L202 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-21 20:33:11,176 WARN L202 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-21 20:33:11,784 WARN L202 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-21 20:33:13,212 WARN L202 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-21 20:33:14,853 WARN L202 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-21 20:33:15,163 WARN L202 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-21 20:33:18,671 WARN L202 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-21 20:33:19,261 WARN L202 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-21 20:33:19,380 WARN L202 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-21 20:33:19,524 WARN L202 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-21 20:33:19,823 WARN L202 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-21 20:33:19,834 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-02-21 20:33:19,834 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-02-21 20:33:19,834 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-02-21 20:33:19,834 INFO L192 CegarLoopUtils]: At program point L3-2(line 3) the Hoare annotation is: true [2021-02-21 20:33:19,834 INFO L192 CegarLoopUtils]: At program point L3-3(line 3) the Hoare annotation is: true [2021-02-21 20:33:19,835 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-21 20:33:19,835 INFO L192 CegarLoopUtils]: At program point L3-4(line 3) the Hoare annotation is: true [2021-02-21 20:33:19,835 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-21 20:33:19,835 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2021-02-21 20:33:19,835 INFO L185 CegarLoopUtils]: 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|)) [2021-02-21 20:33:19,835 INFO L192 CegarLoopUtils]: At program point L3(line 3) the Hoare annotation is: true [2021-02-21 20:33:19,835 INFO L192 CegarLoopUtils]: At program point L3-1(line 3) the Hoare annotation is: true [2021-02-21 20:33:19,835 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-21 20:33:19,836 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-21 20:33:19,836 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-21 20:33:19,836 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-21 20:33:19,836 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-21 20:33:19,836 INFO L192 CegarLoopUtils]: At program point L27(line 27) the Hoare annotation is: true [2021-02-21 20:33:19,837 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,837 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2021-02-21 20:33:19,837 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,838 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,838 INFO L192 CegarLoopUtils]: At program point L44(line 44) the Hoare annotation is: true [2021-02-21 20:33:19,838 INFO L192 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: true [2021-02-21 20:33:19,839 INFO L192 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: true [2021-02-21 20:33:19,839 INFO L192 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: true [2021-02-21 20:33:19,839 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,839 INFO L192 CegarLoopUtils]: At program point L36(line 36) the Hoare annotation is: true [2021-02-21 20:33:19,840 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,840 INFO L185 CegarLoopUtils]: At program point L94-1(lines 29 104) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2021-02-21 20:33:19,840 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,840 INFO L185 CegarLoopUtils]: At program point L53(line 53) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2021-02-21 20:33:19,840 INFO L192 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: true [2021-02-21 20:33:19,840 INFO L192 CegarLoopUtils]: At program point L20-1(line 20) the Hoare annotation is: true [2021-02-21 20:33:19,840 INFO L192 CegarLoopUtils]: At program point L20-2(line 20) the Hoare annotation is: true [2021-02-21 20:33:19,841 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-21 20:33:19,841 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,841 INFO L192 CegarLoopUtils]: At program point L21(line 21) the Hoare annotation is: true [2021-02-21 20:33:19,841 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,841 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2021-02-21 20:33:19,841 INFO L192 CegarLoopUtils]: At program point L38(line 38) the Hoare annotation is: true [2021-02-21 20:33:19,842 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,842 INFO L185 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) the Hoare annotation is: false [2021-02-21 20:33:19,842 INFO L192 CegarLoopUtils]: At program point L30(line 30) the Hoare annotation is: true [2021-02-21 20:33:19,842 INFO L192 CegarLoopUtils]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2021-02-21 20:33:19,842 INFO L192 CegarLoopUtils]: At program point L30-1(line 30) the Hoare annotation is: true [2021-02-21 20:33:19,842 INFO L192 CegarLoopUtils]: At program point L30-2(line 30) the Hoare annotation is: true [2021-02-21 20:33:19,842 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,843 INFO L192 CegarLoopUtils]: At program point L14(line 14) the Hoare annotation is: true [2021-02-21 20:33:19,843 INFO L192 CegarLoopUtils]: At program point L14-1(line 14) the Hoare annotation is: true [2021-02-21 20:33:19,843 INFO L192 CegarLoopUtils]: At program point L14-2(line 14) the Hoare annotation is: true [2021-02-21 20:33:19,843 INFO L192 CegarLoopUtils]: At program point L105(lines 7 109) the Hoare annotation is: true [2021-02-21 20:33:19,843 INFO L192 CegarLoopUtils]: At program point L31(lines 31 33) the Hoare annotation is: true [2021-02-21 20:33:19,844 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,844 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,844 INFO L192 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: true [2021-02-21 20:33:19,844 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,844 INFO L192 CegarLoopUtils]: At program point L23-1(line 23) the Hoare annotation is: true [2021-02-21 20:33:19,844 INFO L192 CegarLoopUtils]: At program point L23-2(line 23) the Hoare annotation is: true [2021-02-21 20:33:19,845 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,845 INFO L192 CegarLoopUtils]: At program point L48(lines 48 50) the Hoare annotation is: true [2021-02-21 20:33:19,845 INFO L192 CegarLoopUtils]: At program point L15(line 15) the Hoare annotation is: true [2021-02-21 20:33:19,845 INFO L185 CegarLoopUtils]: At program point L48-2(lines 29 104) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2021-02-21 20:33:19,845 INFO L192 CegarLoopUtils]: At program point L40(line 40) the Hoare annotation is: true [2021-02-21 20:33:19,845 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,845 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,845 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,846 INFO L192 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: true [2021-02-21 20:33:19,846 INFO L192 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: true [2021-02-21 20:33:19,846 INFO L185 CegarLoopUtils]: At program point L107(line 107) the Hoare annotation is: false [2021-02-21 20:33:19,846 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,846 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-21 20:33:19,846 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-21 20:33:19,846 INFO L192 CegarLoopUtils]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2021-02-21 20:33:19,847 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,847 INFO L192 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: true [2021-02-21 20:33:19,847 INFO L192 CegarLoopUtils]: At program point L17-1(line 17) the Hoare annotation is: true [2021-02-21 20:33:19,847 INFO L192 CegarLoopUtils]: At program point L17-2(line 17) the Hoare annotation is: true [2021-02-21 20:33:19,847 INFO L185 CegarLoopUtils]: At program point L108(line 108) the Hoare annotation is: false [2021-02-21 20:33:19,847 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,847 INFO L192 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: true [2021-02-21 20:33:19,848 INFO L192 CegarLoopUtils]: At program point L9(line 9) the Hoare annotation is: true [2021-02-21 20:33:19,848 INFO L185 CegarLoopUtils]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2021-02-21 20:33:19,848 INFO L185 CegarLoopUtils]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2021-02-21 20:33:19,848 INFO L192 CegarLoopUtils]: At program point L34(line 34) the Hoare annotation is: true [2021-02-21 20:33:19,848 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,848 INFO L192 CegarLoopUtils]: At program point L18(line 18) the Hoare annotation is: true [2021-02-21 20:33:19,848 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,848 INFO L185 CegarLoopUtils]: At program point L101(line 101) the Hoare annotation is: (= main_~lk6~0 1) [2021-02-21 20:33:19,849 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 20:33:19,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 08:33:19 BoogieIcfgContainer [2021-02-21 20:33:19,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-21 20:33:19,870 INFO L168 Benchmark]: Toolchain (without parser) took 29000.71 ms. Allocated memory was 151.0 MB in the beginning and 506.5 MB in the end (delta: 355.5 MB). Free memory was 127.6 MB in the beginning and 252.1 MB in the end (delta: -124.5 MB). Peak memory consumption was 306.6 MB. Max. memory is 8.0 GB. [2021-02-21 20:33:19,871 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 124.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-21 20:33:19,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.14 ms. Allocated memory is still 151.0 MB. Free memory was 126.4 MB in the beginning and 116.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-02-21 20:33:19,872 INFO L168 Benchmark]: Boogie Preprocessor took 44.71 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 114.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-02-21 20:33:19,874 INFO L168 Benchmark]: RCFGBuilder took 641.64 ms. Allocated memory is still 151.0 MB. Free memory was 114.6 MB in the beginning and 125.8 MB in the end (delta: -11.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 8.0 GB. [2021-02-21 20:33:19,874 INFO L168 Benchmark]: TraceAbstraction took 28027.87 ms. Allocated memory was 151.0 MB in the beginning and 506.5 MB in the end (delta: 355.5 MB). Free memory was 125.8 MB in the beginning and 252.1 MB in the end (delta: -126.3 MB). Peak memory consumption was 303.6 MB. Max. memory is 8.0 GB. [2021-02-21 20:33:19,877 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.24 ms. Allocated memory is still 151.0 MB. Free memory is still 124.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 267.14 ms. Allocated memory is still 151.0 MB. Free memory was 126.4 MB in the beginning and 116.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.71 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 114.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 641.64 ms. Allocated memory is still 151.0 MB. Free memory was 114.6 MB in the beginning and 125.8 MB in the end (delta: -11.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 28027.87 ms. Allocated memory was 151.0 MB in the beginning and 506.5 MB in the end (delta: 355.5 MB). Free memory was 125.8 MB in the beginning and 252.1 MB in the end (delta: -126.3 MB). Peak memory consumption was 303.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 107]: call to reach_error is unreachable For all program executions holds that call to reach_error is 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: 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: 7.5s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 20.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1447 SDtfs, 1651 SDslu, 184 SDs, 0 SdLazy, 1044 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s 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=1111occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 535 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 87 LocationsWithAnnotation, 87 PreInvPairs, 2143 NumberOfFragments, 5883 HoareAnnotationTreeSize, 87 FomulaSimplifications, 423099 FormulaSimplificationTreeSizeReduction, 4.0s HoareSimplificationTime, 87 FomulaSimplificationsInter, 12518 FormulaSimplificationTreeSizeReductionInter, 16.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...