/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 23:43:10,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 23:43:10,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 23:43:10,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 23:43:10,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 23:43:10,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 23:43:10,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 23:43:10,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 23:43:10,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 23:43:10,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 23:43:10,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 23:43:10,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 23:43:10,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 23:43:10,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 23:43:10,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 23:43:10,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 23:43:10,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 23:43:10,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 23:43:10,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 23:43:10,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 23:43:10,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 23:43:10,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 23:43:10,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 23:43:10,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 23:43:10,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 23:43:10,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 23:43:10,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 23:43:10,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 23:43:10,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 23:43:10,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 23:43:10,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 23:43:10,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 23:43:10,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 23:43:10,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 23:43:10,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 23:43:10,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 23:43:10,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 23:43:10,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 23:43:10,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 23:43:10,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 23:43:10,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 23:43:10,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-01-31 23:43:10,295 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 23:43:10,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 23:43:10,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 23:43:10,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 23:43:10,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 23:43:10,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 23:43:10,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 23:43:10,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 23:43:10,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 23:43:10,298 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 23:43:10,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 23:43:10,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 23:43:10,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 23:43:10,299 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 23:43:10,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 23:43:10,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:43:10,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 23:43:10,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 23:43:10,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 23:43:10,300 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-01-31 23:43:10,300 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 23:43:10,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 23:43:10,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 23:43:10,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 23:43:10,575 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 23:43:10,575 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 23:43:10,577 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2022-01-31 23:43:10,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a601329dd/b667980a9f734f0da9f819261f74c637/FLAG79cdfc591 [2022-01-31 23:43:11,030 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 23:43:11,031 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2022-01-31 23:43:11,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a601329dd/b667980a9f734f0da9f819261f74c637/FLAG79cdfc591 [2022-01-31 23:43:11,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a601329dd/b667980a9f734f0da9f819261f74c637 [2022-01-31 23:43:11,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 23:43:11,054 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 23:43:11,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 23:43:11,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 23:43:11,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 23:43:11,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:43:11" (1/1) ... [2022-01-31 23:43:11,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15eaff85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:43:11, skipping insertion in model container [2022-01-31 23:43:11,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:43:11" (1/1) ... [2022-01-31 23:43:11,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 23:43:11,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 23:43:11,225 WARN L230 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_7.c[2881,2894] [2022-01-31 23:43:11,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:43:11,238 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 23:43:11,253 WARN L230 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_7.c[2881,2894] [2022-01-31 23:43:11,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:43:11,263 INFO L208 MainTranslator]: Completed translation [2022-01-31 23:43:11,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:43:11 WrapperNode [2022-01-31 23:43:11,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 23:43:11,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 23:43:11,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 23:43:11,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 23:43:11,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:43:11" (1/1) ... [2022-01-31 23:43:11,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:43:11" (1/1) ... [2022-01-31 23:43:11,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:43:11" (1/1) ... [2022-01-31 23:43:11,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:43:11" (1/1) ... [2022-01-31 23:43:11,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:43:11" (1/1) ... [2022-01-31 23:43:11,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:43:11" (1/1) ... [2022-01-31 23:43:11,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:43:11" (1/1) ... [2022-01-31 23:43:11,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 23:43:11,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 23:43:11,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 23:43:11,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 23:43:11,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:43:11" (1/1) ... [2022-01-31 23:43:11,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:43:11,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 23:43:11,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 23:43:11,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 23:43:11,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 23:43:11,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 23:43:11,371 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 23:43:11,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 23:43:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 23:43:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 23:43:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 23:43:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 23:43:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 23:43:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 23:43:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 23:43:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 23:43:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 23:43:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 23:43:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 23:43:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 23:43:11,451 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 23:43:11,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 23:43:11,667 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 23:43:11,672 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 23:43:11,672 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 23:43:11,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:43:11 BoogieIcfgContainer [2022-01-31 23:43:11,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 23:43:11,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 23:43:11,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 23:43:11,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 23:43:11,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:43:11" (1/3) ... [2022-01-31 23:43:11,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37591bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:43:11, skipping insertion in model container [2022-01-31 23:43:11,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:43:11" (2/3) ... [2022-01-31 23:43:11,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37591bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:43:11, skipping insertion in model container [2022-01-31 23:43:11,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:43:11" (3/3) ... [2022-01-31 23:43:11,696 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2022-01-31 23:43:11,700 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 23:43:11,700 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 23:43:11,758 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 23:43:11,765 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=QVASR [2022-01-31 23:43:11,765 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 23:43:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 23:43:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:43:11,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:11,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:11,799 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:11,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:11,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 1 times [2022-01-31 23:43:11,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:11,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [228315477] [2022-01-31 23:43:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:11,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:11,879 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:12,066 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:12,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [228315477] [2022-01-31 23:43:12,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [228315477] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:12,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:12,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:12,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038089479] [2022-01-31 23:43:12,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:12,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:12,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:12,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:12,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:12,108 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:12,290 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-01-31 23:43:12,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:12,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 23:43:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:12,299 INFO L225 Difference]: With dead ends: 70 [2022-01-31 23:43:12,299 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 23:43:12,302 INFO L932 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 [2022-01-31 23:43:12,305 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:12,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 71 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:43:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 23:43:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-01-31 23:43:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2022-01-31 23:43:12,354 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2022-01-31 23:43:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:12,355 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2022-01-31 23:43:12,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2022-01-31 23:43:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:43:12,356 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:12,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:12,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 23:43:12,357 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:12,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:12,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 1 times [2022-01-31 23:43:12,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:12,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2013069333] [2022-01-31 23:43:12,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:12,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:12,362 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:12,424 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:12,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2013069333] [2022-01-31 23:43:12,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2013069333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:12,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:12,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:12,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167365283] [2022-01-31 23:43:12,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:12,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:12,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:12,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:12,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:12,427 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:12,511 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-01-31 23:43:12,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:12,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 23:43:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:12,515 INFO L225 Difference]: With dead ends: 88 [2022-01-31 23:43:12,516 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 23:43:12,516 INFO L932 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 [2022-01-31 23:43:12,517 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:12,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 71 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:43:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 23:43:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-01-31 23:43:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2022-01-31 23:43:12,533 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 18 [2022-01-31 23:43:12,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:12,533 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2022-01-31 23:43:12,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2022-01-31 23:43:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 23:43:12,534 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:12,534 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:12,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 23:43:12,535 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:12,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:12,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 1 times [2022-01-31 23:43:12,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:12,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [488189286] [2022-01-31 23:43:12,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:12,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:12,538 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:12,580 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:12,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [488189286] [2022-01-31 23:43:12,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [488189286] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:12,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:12,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:12,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321757446] [2022-01-31 23:43:12,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:12,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:12,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:12,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:12,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:12,582 INFO L87 Difference]: Start difference. First operand 53 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:12,682 INFO L93 Difference]: Finished difference Result 82 states and 136 transitions. [2022-01-31 23:43:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:12,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 23:43:12,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:12,687 INFO L225 Difference]: With dead ends: 82 [2022-01-31 23:43:12,687 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 23:43:12,688 INFO L932 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 [2022-01-31 23:43:12,689 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:12,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:43:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 23:43:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-01-31 23:43:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2022-01-31 23:43:12,708 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 19 [2022-01-31 23:43:12,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:12,708 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2022-01-31 23:43:12,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2022-01-31 23:43:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 23:43:12,711 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:12,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:12,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 23:43:12,712 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:12,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:12,712 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 1 times [2022-01-31 23:43:12,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:12,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1645235819] [2022-01-31 23:43:12,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:12,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:12,717 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:12,781 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:12,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1645235819] [2022-01-31 23:43:12,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1645235819] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:12,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:12,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:12,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012616127] [2022-01-31 23:43:12,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:12,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:12,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:12,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:12,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:12,783 INFO L87 Difference]: Start difference. First operand 56 states and 92 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:12,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:12,870 INFO L93 Difference]: Finished difference Result 148 states and 252 transitions. [2022-01-31 23:43:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:12,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 23:43:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:12,877 INFO L225 Difference]: With dead ends: 148 [2022-01-31 23:43:12,877 INFO L226 Difference]: Without dead ends: 101 [2022-01-31 23:43:12,878 INFO L932 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 [2022-01-31 23:43:12,883 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:12,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:43:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-01-31 23:43:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-01-31 23:43:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 165 transitions. [2022-01-31 23:43:12,904 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 165 transitions. Word has length 19 [2022-01-31 23:43:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:12,904 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 165 transitions. [2022-01-31 23:43:12,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 165 transitions. [2022-01-31 23:43:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 23:43:12,905 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:12,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:12,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 23:43:12,906 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:12,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:12,906 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 1 times [2022-01-31 23:43:12,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:12,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1513387890] [2022-01-31 23:43:12,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:12,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:12,908 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:12,948 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:12,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1513387890] [2022-01-31 23:43:12,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1513387890] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:12,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:12,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:12,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543498680] [2022-01-31 23:43:12,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:12,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:12,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:12,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:12,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:12,951 INFO L87 Difference]: Start difference. First operand 99 states and 165 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:13,030 INFO L93 Difference]: Finished difference Result 127 states and 211 transitions. [2022-01-31 23:43:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:13,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 23:43:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:13,032 INFO L225 Difference]: With dead ends: 127 [2022-01-31 23:43:13,032 INFO L226 Difference]: Without dead ends: 125 [2022-01-31 23:43:13,033 INFO L932 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 [2022-01-31 23:43:13,036 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:13,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:43:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-01-31 23:43:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2022-01-31 23:43:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 163 transitions. [2022-01-31 23:43:13,057 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 163 transitions. Word has length 19 [2022-01-31 23:43:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:13,057 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 163 transitions. [2022-01-31 23:43:13,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 163 transitions. [2022-01-31 23:43:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 23:43:13,058 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:13,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:13,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 23:43:13,059 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 1 times [2022-01-31 23:43:13,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:13,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [237827576] [2022-01-31 23:43:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:13,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:13,062 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:13,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:13,097 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:13,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [237827576] [2022-01-31 23:43:13,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [237827576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:13,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:13,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:13,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862710682] [2022-01-31 23:43:13,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:13,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:13,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:13,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:13,099 INFO L87 Difference]: Start difference. First operand 99 states and 163 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:13,183 INFO L93 Difference]: Finished difference Result 179 states and 299 transitions. [2022-01-31 23:43:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:13,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-31 23:43:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:13,185 INFO L225 Difference]: With dead ends: 179 [2022-01-31 23:43:13,185 INFO L226 Difference]: Without dead ends: 177 [2022-01-31 23:43:13,185 INFO L932 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 [2022-01-31 23:43:13,186 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:13,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-01-31 23:43:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2022-01-31 23:43:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 221 transitions. [2022-01-31 23:43:13,206 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 221 transitions. Word has length 20 [2022-01-31 23:43:13,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:13,206 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 221 transitions. [2022-01-31 23:43:13,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,206 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 221 transitions. [2022-01-31 23:43:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 23:43:13,207 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:13,208 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:13,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 23:43:13,208 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:13,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:13,208 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 1 times [2022-01-31 23:43:13,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:13,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1254331914] [2022-01-31 23:43:13,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:13,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:13,211 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:13,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:13,242 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:13,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1254331914] [2022-01-31 23:43:13,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1254331914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:13,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:13,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:13,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599849347] [2022-01-31 23:43:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:13,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:13,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:13,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:13,244 INFO L87 Difference]: Start difference. First operand 135 states and 221 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:13,318 INFO L93 Difference]: Finished difference Result 311 states and 515 transitions. [2022-01-31 23:43:13,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:13,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-31 23:43:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:13,321 INFO L225 Difference]: With dead ends: 311 [2022-01-31 23:43:13,321 INFO L226 Difference]: Without dead ends: 185 [2022-01-31 23:43:13,322 INFO L932 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 [2022-01-31 23:43:13,324 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:13,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:13,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-01-31 23:43:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-01-31 23:43:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 295 transitions. [2022-01-31 23:43:13,355 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 295 transitions. Word has length 20 [2022-01-31 23:43:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:13,356 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 295 transitions. [2022-01-31 23:43:13,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 295 transitions. [2022-01-31 23:43:13,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 23:43:13,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:13,361 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:13,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 23:43:13,362 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:13,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 1 times [2022-01-31 23:43:13,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:13,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1636658218] [2022-01-31 23:43:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:13,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:13,366 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:13,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:13,422 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:13,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1636658218] [2022-01-31 23:43:13,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1636658218] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:13,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:13,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:13,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670308546] [2022-01-31 23:43:13,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:13,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:13,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:13,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:13,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:13,424 INFO L87 Difference]: Start difference. First operand 183 states and 295 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:13,495 INFO L93 Difference]: Finished difference Result 277 states and 445 transitions. [2022-01-31 23:43:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:13,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-01-31 23:43:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:13,499 INFO L225 Difference]: With dead ends: 277 [2022-01-31 23:43:13,502 INFO L226 Difference]: Without dead ends: 191 [2022-01-31 23:43:13,505 INFO L932 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 [2022-01-31 23:43:13,510 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:13,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 77 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-01-31 23:43:13,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2022-01-31 23:43:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 299 transitions. [2022-01-31 23:43:13,533 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 299 transitions. Word has length 21 [2022-01-31 23:43:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:13,536 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 299 transitions. [2022-01-31 23:43:13,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 299 transitions. [2022-01-31 23:43:13,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 23:43:13,537 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:13,537 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:13,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 23:43:13,538 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:13,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:13,538 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 1 times [2022-01-31 23:43:13,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:13,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [217383050] [2022-01-31 23:43:13,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:13,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:13,541 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:13,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:13,580 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:13,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [217383050] [2022-01-31 23:43:13,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [217383050] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:13,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:13,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:13,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484405228] [2022-01-31 23:43:13,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:13,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:13,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:13,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:13,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:13,582 INFO L87 Difference]: Start difference. First operand 189 states and 299 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:13,665 INFO L93 Difference]: Finished difference Result 333 states and 533 transitions. [2022-01-31 23:43:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:13,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-01-31 23:43:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:13,668 INFO L225 Difference]: With dead ends: 333 [2022-01-31 23:43:13,668 INFO L226 Difference]: Without dead ends: 331 [2022-01-31 23:43:13,668 INFO L932 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 [2022-01-31 23:43:13,670 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 96 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:13,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 57 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-01-31 23:43:13,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 265. [2022-01-31 23:43:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 411 transitions. [2022-01-31 23:43:13,697 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 411 transitions. Word has length 21 [2022-01-31 23:43:13,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:13,697 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 411 transitions. [2022-01-31 23:43:13,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 411 transitions. [2022-01-31 23:43:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 23:43:13,698 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:13,698 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:13,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 23:43:13,699 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:13,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 1 times [2022-01-31 23:43:13,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:13,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [221429019] [2022-01-31 23:43:13,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:13,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:13,701 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:13,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:13,754 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:13,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [221429019] [2022-01-31 23:43:13,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [221429019] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:13,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:13,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:13,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994224150] [2022-01-31 23:43:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:13,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:13,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:13,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:13,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:13,763 INFO L87 Difference]: Start difference. First operand 265 states and 411 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:13,846 INFO L93 Difference]: Finished difference Result 605 states and 941 transitions. [2022-01-31 23:43:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:13,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-01-31 23:43:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:13,848 INFO L225 Difference]: With dead ends: 605 [2022-01-31 23:43:13,848 INFO L226 Difference]: Without dead ends: 355 [2022-01-31 23:43:13,850 INFO L932 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 [2022-01-31 23:43:13,851 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:13,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-01-31 23:43:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2022-01-31 23:43:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 535 transitions. [2022-01-31 23:43:13,887 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 535 transitions. Word has length 21 [2022-01-31 23:43:13,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:13,887 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 535 transitions. [2022-01-31 23:43:13,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 535 transitions. [2022-01-31 23:43:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 23:43:13,890 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:13,890 INFO L514 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] [2022-01-31 23:43:13,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 23:43:13,890 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:13,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:13,891 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 1 times [2022-01-31 23:43:13,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:13,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578355950] [2022-01-31 23:43:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:13,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:13,893 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:13,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:13,934 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:13,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578355950] [2022-01-31 23:43:13,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1578355950] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:13,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:13,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:13,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111451141] [2022-01-31 23:43:13,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:13,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:13,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:13,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:13,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:13,936 INFO L87 Difference]: Start difference. First operand 353 states and 535 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:14,048 INFO L93 Difference]: Finished difference Result 529 states and 797 transitions. [2022-01-31 23:43:14,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:14,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-31 23:43:14,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:14,050 INFO L225 Difference]: With dead ends: 529 [2022-01-31 23:43:14,050 INFO L226 Difference]: Without dead ends: 363 [2022-01-31 23:43:14,051 INFO L932 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 [2022-01-31 23:43:14,051 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:14,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 74 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-01-31 23:43:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2022-01-31 23:43:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 535 transitions. [2022-01-31 23:43:14,082 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 535 transitions. Word has length 22 [2022-01-31 23:43:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:14,082 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 535 transitions. [2022-01-31 23:43:14,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 535 transitions. [2022-01-31 23:43:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 23:43:14,083 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:14,083 INFO L514 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] [2022-01-31 23:43:14,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 23:43:14,083 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:14,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:14,084 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 1 times [2022-01-31 23:43:14,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:14,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [427750647] [2022-01-31 23:43:14,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:14,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:14,086 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:14,108 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:14,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [427750647] [2022-01-31 23:43:14,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [427750647] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:14,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:14,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:14,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67094373] [2022-01-31 23:43:14,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:14,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:14,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:14,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:14,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:14,110 INFO L87 Difference]: Start difference. First operand 361 states and 535 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:14,200 INFO L93 Difference]: Finished difference Result 621 states and 929 transitions. [2022-01-31 23:43:14,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:14,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-31 23:43:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:14,203 INFO L225 Difference]: With dead ends: 621 [2022-01-31 23:43:14,204 INFO L226 Difference]: Without dead ends: 619 [2022-01-31 23:43:14,204 INFO L932 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 [2022-01-31 23:43:14,204 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:14,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 56 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-01-31 23:43:14,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 521. [2022-01-31 23:43:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 751 transitions. [2022-01-31 23:43:14,248 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 751 transitions. Word has length 22 [2022-01-31 23:43:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:14,248 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 751 transitions. [2022-01-31 23:43:14,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 751 transitions. [2022-01-31 23:43:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 23:43:14,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:14,249 INFO L514 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] [2022-01-31 23:43:14,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 23:43:14,250 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:14,250 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 1 times [2022-01-31 23:43:14,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:14,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [288387282] [2022-01-31 23:43:14,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:14,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:14,252 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:14,276 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:14,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [288387282] [2022-01-31 23:43:14,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [288387282] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:14,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:14,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:14,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262212755] [2022-01-31 23:43:14,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:14,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:14,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:14,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:14,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:14,278 INFO L87 Difference]: Start difference. First operand 521 states and 751 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:14,381 INFO L93 Difference]: Finished difference Result 1181 states and 1697 transitions. [2022-01-31 23:43:14,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:14,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-31 23:43:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:14,384 INFO L225 Difference]: With dead ends: 1181 [2022-01-31 23:43:14,384 INFO L226 Difference]: Without dead ends: 683 [2022-01-31 23:43:14,385 INFO L932 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 [2022-01-31 23:43:14,386 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:14,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 79 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-01-31 23:43:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2022-01-31 23:43:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 951 transitions. [2022-01-31 23:43:14,464 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 951 transitions. Word has length 22 [2022-01-31 23:43:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:14,465 INFO L470 AbstractCegarLoop]: Abstraction has 681 states and 951 transitions. [2022-01-31 23:43:14,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 951 transitions. [2022-01-31 23:43:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 23:43:14,466 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:14,466 INFO L514 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] [2022-01-31 23:43:14,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 23:43:14,467 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:14,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 1 times [2022-01-31 23:43:14,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:14,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [46550649] [2022-01-31 23:43:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:14,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:14,469 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:14,491 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:14,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [46550649] [2022-01-31 23:43:14,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [46550649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:14,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:14,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:14,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953351859] [2022-01-31 23:43:14,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:14,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:14,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:14,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:14,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:14,493 INFO L87 Difference]: Start difference. First operand 681 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:14,593 INFO L93 Difference]: Finished difference Result 1021 states and 1417 transitions. [2022-01-31 23:43:14,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:14,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 23:43:14,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:14,597 INFO L225 Difference]: With dead ends: 1021 [2022-01-31 23:43:14,597 INFO L226 Difference]: Without dead ends: 699 [2022-01-31 23:43:14,598 INFO L932 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 [2022-01-31 23:43:14,599 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:14,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 71 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-01-31 23:43:14,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-01-31 23:43:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 951 transitions. [2022-01-31 23:43:14,656 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 951 transitions. Word has length 23 [2022-01-31 23:43:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:14,656 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 951 transitions. [2022-01-31 23:43:14,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 951 transitions. [2022-01-31 23:43:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 23:43:14,657 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:14,657 INFO L514 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] [2022-01-31 23:43:14,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 23:43:14,658 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:14,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:14,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 1 times [2022-01-31 23:43:14,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:14,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1081259236] [2022-01-31 23:43:14,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:14,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:14,659 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:14,687 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:14,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1081259236] [2022-01-31 23:43:14,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1081259236] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:14,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:14,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:14,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573663231] [2022-01-31 23:43:14,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:14,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:14,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:14,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:14,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:14,689 INFO L87 Difference]: Start difference. First operand 697 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:14,833 INFO L93 Difference]: Finished difference Result 1165 states and 1593 transitions. [2022-01-31 23:43:14,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:14,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 23:43:14,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:14,837 INFO L225 Difference]: With dead ends: 1165 [2022-01-31 23:43:14,838 INFO L226 Difference]: Without dead ends: 1163 [2022-01-31 23:43:14,838 INFO L932 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 [2022-01-31 23:43:14,838 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:14,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-01-31 23:43:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1033. [2022-01-31 23:43:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1367 transitions. [2022-01-31 23:43:14,924 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1367 transitions. Word has length 23 [2022-01-31 23:43:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:14,924 INFO L470 AbstractCegarLoop]: Abstraction has 1033 states and 1367 transitions. [2022-01-31 23:43:14,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1367 transitions. [2022-01-31 23:43:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 23:43:14,926 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:14,926 INFO L514 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] [2022-01-31 23:43:14,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 23:43:14,926 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 1 times [2022-01-31 23:43:14,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:14,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [774845599] [2022-01-31 23:43:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:14,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:14,928 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:14,960 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:14,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [774845599] [2022-01-31 23:43:14,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [774845599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:14,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:14,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:14,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791069292] [2022-01-31 23:43:14,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:14,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:14,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:14,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:14,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:14,962 INFO L87 Difference]: Start difference. First operand 1033 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:15,121 INFO L93 Difference]: Finished difference Result 2317 states and 3033 transitions. [2022-01-31 23:43:15,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:15,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 23:43:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:15,126 INFO L225 Difference]: With dead ends: 2317 [2022-01-31 23:43:15,126 INFO L226 Difference]: Without dead ends: 1323 [2022-01-31 23:43:15,128 INFO L932 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 [2022-01-31 23:43:15,128 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:15,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 81 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-01-31 23:43:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2022-01-31 23:43:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1671 transitions. [2022-01-31 23:43:15,254 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1671 transitions. Word has length 23 [2022-01-31 23:43:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:15,255 INFO L470 AbstractCegarLoop]: Abstraction has 1321 states and 1671 transitions. [2022-01-31 23:43:15,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1671 transitions. [2022-01-31 23:43:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 23:43:15,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:15,256 INFO L514 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] [2022-01-31 23:43:15,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 23:43:15,257 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:15,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:15,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 1 times [2022-01-31 23:43:15,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:15,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [868797132] [2022-01-31 23:43:15,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:15,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:15,259 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:15,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:15,283 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:15,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [868797132] [2022-01-31 23:43:15,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [868797132] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:15,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:15,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:15,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101013827] [2022-01-31 23:43:15,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:15,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:15,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:15,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:15,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:15,285 INFO L87 Difference]: Start difference. First operand 1321 states and 1671 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:15,432 INFO L93 Difference]: Finished difference Result 1981 states and 2489 transitions. [2022-01-31 23:43:15,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:15,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-01-31 23:43:15,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:15,437 INFO L225 Difference]: With dead ends: 1981 [2022-01-31 23:43:15,437 INFO L226 Difference]: Without dead ends: 1355 [2022-01-31 23:43:15,439 INFO L932 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 [2022-01-31 23:43:15,440 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:15,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 68 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:15,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-01-31 23:43:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-01-31 23:43:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1671 transitions. [2022-01-31 23:43:15,570 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1671 transitions. Word has length 24 [2022-01-31 23:43:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:15,571 INFO L470 AbstractCegarLoop]: Abstraction has 1353 states and 1671 transitions. [2022-01-31 23:43:15,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1671 transitions. [2022-01-31 23:43:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 23:43:15,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:15,572 INFO L514 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] [2022-01-31 23:43:15,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 23:43:15,573 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:15,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:15,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 1 times [2022-01-31 23:43:15,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:15,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [67947726] [2022-01-31 23:43:15,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:15,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:15,575 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:15,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:15,601 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:15,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [67947726] [2022-01-31 23:43:15,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [67947726] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:15,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:15,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:15,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270181521] [2022-01-31 23:43:15,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:15,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:15,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:15,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:15,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:15,602 INFO L87 Difference]: Start difference. First operand 1353 states and 1671 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:15,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:15,821 INFO L93 Difference]: Finished difference Result 2187 states and 2664 transitions. [2022-01-31 23:43:15,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:15,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-01-31 23:43:15,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:15,829 INFO L225 Difference]: With dead ends: 2187 [2022-01-31 23:43:15,830 INFO L226 Difference]: Without dead ends: 2185 [2022-01-31 23:43:15,833 INFO L932 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 [2022-01-31 23:43:15,833 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 74 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:15,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-01-31 23:43:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2057. [2022-01-31 23:43:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2471 transitions. [2022-01-31 23:43:16,038 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2471 transitions. Word has length 24 [2022-01-31 23:43:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:16,039 INFO L470 AbstractCegarLoop]: Abstraction has 2057 states and 2471 transitions. [2022-01-31 23:43:16,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2471 transitions. [2022-01-31 23:43:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 23:43:16,041 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:16,041 INFO L514 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] [2022-01-31 23:43:16,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 23:43:16,042 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:16,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 1 times [2022-01-31 23:43:16,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:16,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1864895254] [2022-01-31 23:43:16,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:16,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:16,043 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:16,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:16,065 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:16,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1864895254] [2022-01-31 23:43:16,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1864895254] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:16,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:16,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 23:43:16,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500104162] [2022-01-31 23:43:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:16,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 23:43:16,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:16,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 23:43:16,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 23:43:16,066 INFO L87 Difference]: Start difference. First operand 2057 states and 2471 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:16,348 INFO L93 Difference]: Finished difference Result 4553 states and 5351 transitions. [2022-01-31 23:43:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 23:43:16,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-01-31 23:43:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:16,349 INFO L225 Difference]: With dead ends: 4553 [2022-01-31 23:43:16,349 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 23:43:16,357 INFO L932 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 [2022-01-31 23:43:16,357 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:16,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 82 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:43:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 23:43:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 23:43:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 23:43:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 23:43:16,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-01-31 23:43:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:16,359 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 23:43:16,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:43:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 23:43:16,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 23:43:16,361 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 23:43:16,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 23:43:16,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 23:43:45,756 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-01-31 23:43:45,757 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-01-31 23:43:45,757 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-01-31 23:43:45,757 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 23:43:45,757 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 23:43:45,757 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 23:43:45,757 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 23:43:45,757 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 23:43:45,757 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 23:43:45,757 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 23:43:45,757 INFO L854 garLoopResultBuilder]: At program point L93-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse2 (= main_~p7~0 0)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse5 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse6 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse3) (and .cse0 .cse1 .cse2 .cse6) (and .cse4 .cse0 .cse1 .cse3) (and .cse5 .cse2 .cse7 .cse6) (and .cse4 .cse0 .cse1 .cse6) (and .cse5 .cse0 .cse2 .cse3) (and .cse5 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse6) (and .cse4 .cse5 .cse7 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse1 .cse2 .cse7 .cse3) (and .cse4 .cse1 .cse7 .cse6) (and .cse5 .cse0 .cse2 .cse6) (and .cse4 .cse1 .cse7 .cse3) (and .cse4 .cse5 .cse7 .cse6))) [2022-01-31 23:43:45,758 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2022-01-31 23:43:45,758 INFO L854 garLoopResultBuilder]: At program point L77-1(lines 32 118) the Hoare annotation is: (let ((.cse9 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~lk1~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse2 (= main_~p7~0 0)) (.cse13 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse12 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p1~0 0)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse4) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse4 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse10) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse4) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse4 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse10 .cse5) (and .cse8 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse1 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse10) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2022-01-31 23:43:45,759 INFO L854 garLoopResultBuilder]: At program point L69-1(lines 32 118) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-01-31 23:43:45,759 INFO L854 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (let ((.cse6 (= main_~p7~0 0)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse9 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse8) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse5) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse5))) [2022-01-31 23:43:45,759 INFO L854 garLoopResultBuilder]: At program point L61-1(lines 32 118) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-01-31 23:43:45,759 INFO L861 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-01-31 23:43:45,759 INFO L861 garLoopResultBuilder]: At program point L53(lines 53 55) the Hoare annotation is: true [2022-01-31 23:43:45,759 INFO L854 garLoopResultBuilder]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-01-31 23:43:45,759 INFO L854 garLoopResultBuilder]: At program point L103-1(lines 32 118) the Hoare annotation is: (let ((.cse1 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse0 .cse3) (and .cse2 .cse3))) [2022-01-31 23:43:45,760 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2022-01-31 23:43:45,760 INFO L854 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1)) (.cse0 (not (= main_~p5~0 0))) (.cse2 (= main_~lk5~0 1)) (.cse4 (= main_~p7~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4 .cse3) (and .cse0 .cse1 .cse2 .cse5) (and .cse0 .cse2 .cse4 .cse5))) [2022-01-31 23:43:45,760 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) the Hoare annotation is: false [2022-01-31 23:43:45,760 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2022-01-31 23:43:45,760 INFO L854 garLoopResultBuilder]: At program point L88-1(lines 32 118) the Hoare annotation is: (let ((.cse8 (= main_~p7~0 0)) (.cse6 (= main_~p5~0 0)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p4~0 0)) (.cse9 (= main_~lk3~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse8 .cse6 .cse3 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse7) (and .cse0 .cse2 .cse5 .cse7 .cse4) (and .cse0 .cse1 .cse9 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse3) (and .cse2 .cse5 .cse8 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse7 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse8 .cse6 .cse7 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse3 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse3) (and .cse5 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse2 .cse5 .cse9 .cse3) (and .cse1 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse8 .cse7 .cse4) (and .cse0 .cse2 .cse5 .cse9 .cse7) (and .cse5 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse7) (and .cse0 .cse1 .cse9 .cse6 .cse7) (and .cse2 .cse5 .cse8 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse3 .cse4) (and .cse1 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse5 .cse3 .cse4))) [2022-01-31 23:43:45,760 INFO L861 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-01-31 23:43:45,761 INFO L854 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~p7~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse9 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse10 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse10 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5) (and .cse6 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse6 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse6 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse10 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse4 .cse9 .cse5) (and .cse0 .cse7 .cse1 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse10 .cse9 .cse5) (and .cse6 .cse7 .cse8 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse10 .cse5) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse9 .cse5))) [2022-01-31 23:43:45,761 INFO L854 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2022-01-31 23:43:45,761 INFO L854 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-01-31 23:43:45,761 INFO L854 garLoopResultBuilder]: At program point L73-1(lines 32 118) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-01-31 23:43:45,761 INFO L854 garLoopResultBuilder]: At program point L98-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~p5~0 0)) (.cse3 (= main_~lk7~0 1)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse1 .cse5 .cse4) (and .cse1 .cse5 .cse2) (and .cse3 .cse5 .cse4) (and .cse3 .cse5 .cse2) (and .cse3 .cse0 .cse2) (and .cse0 .cse1 .cse4))) [2022-01-31 23:43:45,761 INFO L854 garLoopResultBuilder]: At program point L65-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-01-31 23:43:45,761 INFO L854 garLoopResultBuilder]: At program point L57-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-01-31 23:43:45,762 INFO L854 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (= main_~p6~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk7~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse7 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse5 .cse4) (and .cse6 .cse0 .cse1 .cse2 .cse7) (and .cse6 .cse0 .cse1 .cse2 .cse4) (and .cse6 .cse1 .cse2 .cse5 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse7) (and .cse6 .cse1 .cse2 .cse5 .cse7))) [2022-01-31 23:43:45,762 INFO L854 garLoopResultBuilder]: At program point L83-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse10 (= main_~p7~0 0)) (.cse3 (= main_~p5~0 0)) (.cse11 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse4 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse11) (and .cse9 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse11 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse4) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse9 .cse1 .cse7 .cse11 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse6 .cse9 .cse7 .cse4 .cse8) (and .cse6 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse2 .cse4 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse11) (and .cse6 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse11 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse4 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse4) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse4 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse11) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse11) (and .cse1 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse11 .cse8 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse8) (and .cse9 .cse1 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse11 .cse5) (and .cse9 .cse1 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse4))) [2022-01-31 23:43:45,762 INFO L854 garLoopResultBuilder]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~lk7~0 1) (= main_~p7~0 0)) [2022-01-31 23:43:45,762 INFO L861 garLoopResultBuilder]: At program point L34(lines 34 36) the Hoare annotation is: true [2022-01-31 23:43:45,762 INFO L854 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse9 (= main_~p7~0 0)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse13 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse11 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p4~0 0)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse5 (= main_~p5~0 0)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~p6~0 0)) (.cse12 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse7 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse7 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse11 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse11 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse7 .cse12 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse11 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse11) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse11 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse7 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse7 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse12))) [2022-01-31 23:43:45,762 INFO L854 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse1 (not (= main_~p6~0 0)))) (or (and (= main_~lk7~0 1) .cse0 .cse1) (and (= main_~p7~0 0) .cse0 .cse1))) [2022-01-31 23:43:45,766 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:45,767 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 23:43:45,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:43:45 BoogieIcfgContainer [2022-01-31 23:43:45,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 23:43:45,776 INFO L158 Benchmark]: Toolchain (without parser) took 34721.86ms. Allocated memory was 190.8MB in the beginning and 877.7MB in the end (delta: 686.8MB). Free memory was 136.5MB in the beginning and 431.4MB in the end (delta: -294.8MB). Peak memory consumption was 516.1MB. Max. memory is 8.0GB. [2022-01-31 23:43:45,776 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory is still 153.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 23:43:45,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.83ms. Allocated memory is still 190.8MB. Free memory was 136.3MB in the beginning and 162.4MB in the end (delta: -26.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-31 23:43:45,776 INFO L158 Benchmark]: Boogie Preprocessor took 28.87ms. Allocated memory is still 190.8MB. Free memory was 162.4MB in the beginning and 160.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 23:43:45,777 INFO L158 Benchmark]: RCFGBuilder took 379.87ms. Allocated memory is still 190.8MB. Free memory was 160.9MB in the beginning and 149.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 23:43:45,777 INFO L158 Benchmark]: TraceAbstraction took 34100.44ms. Allocated memory was 190.8MB in the beginning and 877.7MB in the end (delta: 686.8MB). Free memory was 148.8MB in the beginning and 431.4MB in the end (delta: -282.6MB). Peak memory consumption was 528.0MB. Max. memory is 8.0GB. [2022-01-31 23:43:45,778 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.12ms. Allocated memory is still 190.8MB. Free memory is still 153.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.83ms. Allocated memory is still 190.8MB. Free memory was 136.3MB in the beginning and 162.4MB in the end (delta: -26.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.87ms. Allocated memory is still 190.8MB. Free memory was 162.4MB in the beginning and 160.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 379.87ms. Allocated memory is still 190.8MB. Free memory was 160.9MB in the beginning and 149.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 34100.44ms. Allocated memory was 190.8MB in the beginning and 877.7MB in the end (delta: 686.8MB). Free memory was 148.8MB in the beginning and 431.4MB in the end (delta: -282.6MB). Peak memory consumption was 528.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 121]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 29.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1693 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1693 mSDsluCounter, 1341 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1206 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2057occurred in iteration=18, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 36 PreInvPairs, 2605 NumberOfFragments, 9766 HoareAnnotationTreeSize, 36 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 11.6s HoareSimplificationTime, 36 FomulaSimplificationsInter, 148195 FormulaSimplificationTreeSizeReductionInter, 17.7s 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-01-31 23:43:45,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...