/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-24 01:59:43,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 01:59:43,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 01:59:43,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 01:59:43,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 01:59:43,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 01:59:43,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 01:59:43,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 01:59:43,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 01:59:43,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 01:59:43,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 01:59:43,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 01:59:43,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 01:59:43,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 01:59:43,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 01:59:43,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 01:59:43,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 01:59:43,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 01:59:43,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 01:59:43,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 01:59:43,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 01:59:43,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 01:59:43,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 01:59:43,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 01:59:43,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 01:59:43,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 01:59:43,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 01:59:43,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 01:59:43,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 01:59:43,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 01:59:43,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 01:59:43,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 01:59:43,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 01:59:43,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 01:59:43,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 01:59:43,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 01:59:43,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 01:59:43,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 01:59:43,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 01:59:43,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 01:59:43,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 01:59:43,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-24 01:59:43,506 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 01:59:43,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 01:59:43,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 01:59:43,508 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-24 01:59:43,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 01:59:43,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-24 01:59:43,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 01:59:43,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 01:59:43,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 01:59:43,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 01:59:43,509 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-24 01:59:43,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 01:59:43,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 01:59:43,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 01:59:43,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 01:59:43,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 01:59:43,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-24 01:59:43,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 01:59:43,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:59:43,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 01:59:43,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-24 01:59:43,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 01:59:43,510 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-24 01:59:43,510 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-02-24 01:59:43,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 01:59:43,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 01:59:43,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 01:59:43,735 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 01:59:43,736 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 01:59:43,737 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-02-24 01:59:43,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58b3d2d05/6569dbfc5aab4020b9a5e13148c0062a/FLAGe18a6acad [2022-02-24 01:59:44,152 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 01:59:44,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2022-02-24 01:59:44,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58b3d2d05/6569dbfc5aab4020b9a5e13148c0062a/FLAGe18a6acad [2022-02-24 01:59:44,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58b3d2d05/6569dbfc5aab4020b9a5e13148c0062a [2022-02-24 01:59:44,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 01:59:44,176 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-24 01:59:44,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 01:59:44,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 01:59:44,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 01:59:44,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:59:44" (1/1) ... [2022-02-24 01:59:44,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd0d4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:59:44, skipping insertion in model container [2022-02-24 01:59:44,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:59:44" (1/1) ... [2022-02-24 01:59:44,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 01:59:44,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 01:59:44,378 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-02-24 01:59:44,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:59:44,389 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 01:59:44,416 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-02-24 01:59:44,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:59:44,429 INFO L208 MainTranslator]: Completed translation [2022-02-24 01:59:44,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:59:44 WrapperNode [2022-02-24 01:59:44,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 01:59:44,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 01:59:44,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 01:59:44,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 01:59:44,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:59:44" (1/1) ... [2022-02-24 01:59:44,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:59:44" (1/1) ... [2022-02-24 01:59:44,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:59:44" (1/1) ... [2022-02-24 01:59:44,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:59:44" (1/1) ... [2022-02-24 01:59:44,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:59:44" (1/1) ... [2022-02-24 01:59:44,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:59:44" (1/1) ... [2022-02-24 01:59:44,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:59:44" (1/1) ... [2022-02-24 01:59:44,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 01:59:44,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 01:59:44,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 01:59:44,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 01:59:44,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:59:44" (1/1) ... [2022-02-24 01:59:44,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:59:44,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 01:59:44,495 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-02-24 01:59:44,513 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-02-24 01:59:44,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 01:59:44,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 01:59:44,530 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 01:59:44,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 01:59:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 01:59:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 01:59:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 01:59:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 01:59:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-24 01:59:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 01:59:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 01:59:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 01:59:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 01:59:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 01:59:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 01:59:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 01:59:44,591 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 01:59:44,593 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 01:59:44,742 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 01:59:44,746 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 01:59:44,747 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-24 01:59:44,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:59:44 BoogieIcfgContainer [2022-02-24 01:59:44,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 01:59:44,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 01:59:44,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 01:59:44,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 01:59:44,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 01:59:44" (1/3) ... [2022-02-24 01:59:44,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d3308d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:59:44, skipping insertion in model container [2022-02-24 01:59:44,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:59:44" (2/3) ... [2022-02-24 01:59:44,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d3308d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:59:44, skipping insertion in model container [2022-02-24 01:59:44,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:59:44" (3/3) ... [2022-02-24 01:59:44,758 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2022-02-24 01:59:44,761 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-24 01:59:44,761 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-24 01:59:44,791 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 01:59:44,796 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=JORDAN [2022-02-24 01:59:44,796 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-24 01:59:44,806 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-02-24 01:59:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-24 01:59:44,811 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:44,811 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:59:44,811 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:44,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:44,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 1 times [2022-02-24 01:59:44,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:44,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [750662611] [2022-02-24 01:59:44,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:44,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:44,862 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:45,037 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:45,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [750662611] [2022-02-24 01:59:45,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [750662611] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:45,039 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:45,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:45,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318532311] [2022-02-24 01:59:45,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:45,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:45,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:45,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:45,071 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-02-24 01:59:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:45,223 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-02-24 01:59:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:45,225 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-02-24 01:59:45,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:45,238 INFO L225 Difference]: With dead ends: 70 [2022-02-24 01:59:45,238 INFO L226 Difference]: Without dead ends: 55 [2022-02-24 01:59:45,241 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-02-24 01:59:45,244 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-02-24 01:59:45,245 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-02-24 01:59:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-24 01:59:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-02-24 01:59:45,288 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-02-24 01:59:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2022-02-24 01:59:45,291 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2022-02-24 01:59:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:45,292 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2022-02-24 01:59:45,292 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-02-24 01:59:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2022-02-24 01:59:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-24 01:59:45,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:45,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:59:45,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 01:59:45,295 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 1 times [2022-02-24 01:59:45,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:45,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1253215422] [2022-02-24 01:59:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:45,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:45,301 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:45,344 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:45,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1253215422] [2022-02-24 01:59:45,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1253215422] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:45,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:45,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:45,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034405409] [2022-02-24 01:59:45,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:45,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:45,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:45,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:45,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:45,350 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-02-24 01:59:45,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:45,447 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-02-24 01:59:45,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:45,447 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-02-24 01:59:45,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:45,448 INFO L225 Difference]: With dead ends: 88 [2022-02-24 01:59:45,448 INFO L226 Difference]: Without dead ends: 55 [2022-02-24 01:59:45,449 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-02-24 01:59:45,449 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-02-24 01:59:45,450 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-02-24 01:59:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-24 01:59:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-02-24 01:59:45,458 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-02-24 01:59:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2022-02-24 01:59:45,459 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 18 [2022-02-24 01:59:45,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:45,459 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2022-02-24 01:59:45,459 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-02-24 01:59:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2022-02-24 01:59:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-24 01:59:45,460 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:45,460 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-02-24 01:59:45,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 01:59:45,461 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:45,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:45,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 1 times [2022-02-24 01:59:45,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:45,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [147289180] [2022-02-24 01:59:45,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:45,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:45,463 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:45,503 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:45,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [147289180] [2022-02-24 01:59:45,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [147289180] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:45,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:45,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:45,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30665865] [2022-02-24 01:59:45,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:45,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:45,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:45,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:45,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:45,505 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-02-24 01:59:45,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:45,569 INFO L93 Difference]: Finished difference Result 82 states and 136 transitions. [2022-02-24 01:59:45,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:45,569 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-02-24 01:59:45,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:45,570 INFO L225 Difference]: With dead ends: 82 [2022-02-24 01:59:45,570 INFO L226 Difference]: Without dead ends: 58 [2022-02-24 01:59:45,571 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-02-24 01:59:45,572 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.0s IncrementalHoareTripleChecker+Time [2022-02-24 01:59:45,572 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.0s Time] [2022-02-24 01:59:45,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-24 01:59:45,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-02-24 01:59:45,579 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-02-24 01:59:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2022-02-24 01:59:45,580 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 19 [2022-02-24 01:59:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:45,580 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2022-02-24 01:59:45,580 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-02-24 01:59:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2022-02-24 01:59:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-24 01:59:45,581 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:45,581 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-02-24 01:59:45,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 01:59:45,582 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:45,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 1 times [2022-02-24 01:59:45,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:45,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [364344190] [2022-02-24 01:59:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:45,585 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:45,615 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:45,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [364344190] [2022-02-24 01:59:45,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [364344190] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:45,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:45,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:45,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118183934] [2022-02-24 01:59:45,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:45,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:45,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:45,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:45,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:45,617 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-02-24 01:59:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:45,673 INFO L93 Difference]: Finished difference Result 148 states and 252 transitions. [2022-02-24 01:59:45,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:45,674 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-02-24 01:59:45,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:45,675 INFO L225 Difference]: With dead ends: 148 [2022-02-24 01:59:45,675 INFO L226 Difference]: Without dead ends: 101 [2022-02-24 01:59:45,676 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-02-24 01:59:45,676 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.0s IncrementalHoareTripleChecker+Time [2022-02-24 01:59:45,677 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.0s Time] [2022-02-24 01:59:45,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-24 01:59:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-02-24 01:59:45,687 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-02-24 01:59:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 165 transitions. [2022-02-24 01:59:45,688 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 165 transitions. Word has length 19 [2022-02-24 01:59:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:45,689 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 165 transitions. [2022-02-24 01:59:45,689 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-02-24 01:59:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 165 transitions. [2022-02-24 01:59:45,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-24 01:59:45,690 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:45,690 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-02-24 01:59:45,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 01:59:45,690 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:45,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:45,691 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 1 times [2022-02-24 01:59:45,691 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:45,691 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1407577197] [2022-02-24 01:59:45,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:45,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:45,692 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:45,725 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:45,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1407577197] [2022-02-24 01:59:45,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1407577197] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:45,725 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:45,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:45,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003144475] [2022-02-24 01:59:45,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:45,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:45,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:45,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:45,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:45,727 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-02-24 01:59:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:45,779 INFO L93 Difference]: Finished difference Result 127 states and 211 transitions. [2022-02-24 01:59:45,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:45,779 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-02-24 01:59:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:45,780 INFO L225 Difference]: With dead ends: 127 [2022-02-24 01:59:45,781 INFO L226 Difference]: Without dead ends: 125 [2022-02-24 01:59:45,781 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-02-24 01:59:45,782 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.0s IncrementalHoareTripleChecker+Time [2022-02-24 01:59:45,782 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.0s Time] [2022-02-24 01:59:45,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-24 01:59:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2022-02-24 01:59:45,792 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-02-24 01:59:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 163 transitions. [2022-02-24 01:59:45,793 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 163 transitions. Word has length 19 [2022-02-24 01:59:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:45,794 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 163 transitions. [2022-02-24 01:59:45,794 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-02-24 01:59:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 163 transitions. [2022-02-24 01:59:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-24 01:59:45,795 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:45,795 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-02-24 01:59:45,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 01:59:45,795 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:45,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:45,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 1 times [2022-02-24 01:59:45,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:45,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1548724386] [2022-02-24 01:59:45,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:45,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:45,797 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:45,824 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:45,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1548724386] [2022-02-24 01:59:45,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1548724386] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:45,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:45,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:45,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270034416] [2022-02-24 01:59:45,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:45,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:45,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:45,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:45,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:45,825 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-02-24 01:59:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:45,882 INFO L93 Difference]: Finished difference Result 179 states and 299 transitions. [2022-02-24 01:59:45,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:45,883 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-02-24 01:59:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:45,884 INFO L225 Difference]: With dead ends: 179 [2022-02-24 01:59:45,884 INFO L226 Difference]: Without dead ends: 177 [2022-02-24 01:59:45,885 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-02-24 01:59:45,885 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-02-24 01:59:45,886 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-02-24 01:59:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-24 01:59:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2022-02-24 01:59:45,899 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-02-24 01:59:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 221 transitions. [2022-02-24 01:59:45,900 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 221 transitions. Word has length 20 [2022-02-24 01:59:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:45,901 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 221 transitions. [2022-02-24 01:59:45,901 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-02-24 01:59:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 221 transitions. [2022-02-24 01:59:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-24 01:59:45,902 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:45,902 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-02-24 01:59:45,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-24 01:59:45,902 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:45,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:45,903 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 1 times [2022-02-24 01:59:45,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:45,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1551104236] [2022-02-24 01:59:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:45,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:45,905 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:45,931 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:45,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1551104236] [2022-02-24 01:59:45,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1551104236] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:45,932 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:45,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:45,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714946160] [2022-02-24 01:59:45,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:45,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:45,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:45,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:45,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:45,933 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-02-24 01:59:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:45,995 INFO L93 Difference]: Finished difference Result 311 states and 515 transitions. [2022-02-24 01:59:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:45,995 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-02-24 01:59:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:45,996 INFO L225 Difference]: With dead ends: 311 [2022-02-24 01:59:45,996 INFO L226 Difference]: Without dead ends: 185 [2022-02-24 01:59:45,997 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-02-24 01:59:45,998 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-02-24 01:59:45,998 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-02-24 01:59:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-24 01:59:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-02-24 01:59:46,013 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-02-24 01:59:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 295 transitions. [2022-02-24 01:59:46,014 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 295 transitions. Word has length 20 [2022-02-24 01:59:46,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:46,014 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 295 transitions. [2022-02-24 01:59:46,014 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-02-24 01:59:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 295 transitions. [2022-02-24 01:59:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-24 01:59:46,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:46,016 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-02-24 01:59:46,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-24 01:59:46,016 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 1 times [2022-02-24 01:59:46,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:46,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1459211935] [2022-02-24 01:59:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:46,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:46,018 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:46,042 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:46,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1459211935] [2022-02-24 01:59:46,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1459211935] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:46,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:46,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:46,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102629227] [2022-02-24 01:59:46,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:46,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:46,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:46,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:46,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:46,043 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-02-24 01:59:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:46,123 INFO L93 Difference]: Finished difference Result 277 states and 445 transitions. [2022-02-24 01:59:46,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:46,126 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-02-24 01:59:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:46,131 INFO L225 Difference]: With dead ends: 277 [2022-02-24 01:59:46,131 INFO L226 Difference]: Without dead ends: 191 [2022-02-24 01:59:46,134 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-02-24 01:59:46,134 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-02-24 01:59:46,134 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-02-24 01:59:46,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-02-24 01:59:46,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2022-02-24 01:59:46,152 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-02-24 01:59:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 299 transitions. [2022-02-24 01:59:46,154 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 299 transitions. Word has length 21 [2022-02-24 01:59:46,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:46,157 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 299 transitions. [2022-02-24 01:59:46,157 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-02-24 01:59:46,157 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 299 transitions. [2022-02-24 01:59:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-24 01:59:46,161 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:46,161 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-02-24 01:59:46,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-24 01:59:46,164 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:46,164 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 1 times [2022-02-24 01:59:46,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:46,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [456771016] [2022-02-24 01:59:46,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:46,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:46,167 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:46,209 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:46,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [456771016] [2022-02-24 01:59:46,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [456771016] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:46,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:46,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:46,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56835142] [2022-02-24 01:59:46,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:46,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:46,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:46,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:46,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:46,211 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-02-24 01:59:46,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:46,273 INFO L93 Difference]: Finished difference Result 333 states and 533 transitions. [2022-02-24 01:59:46,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:46,273 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-02-24 01:59:46,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:46,275 INFO L225 Difference]: With dead ends: 333 [2022-02-24 01:59:46,275 INFO L226 Difference]: Without dead ends: 331 [2022-02-24 01:59:46,275 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-02-24 01:59:46,277 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-02-24 01:59:46,277 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-02-24 01:59:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-02-24 01:59:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 265. [2022-02-24 01:59:46,297 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-02-24 01:59:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 411 transitions. [2022-02-24 01:59:46,298 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 411 transitions. Word has length 21 [2022-02-24 01:59:46,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:46,299 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 411 transitions. [2022-02-24 01:59:46,299 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-02-24 01:59:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 411 transitions. [2022-02-24 01:59:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-24 01:59:46,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:46,300 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-02-24 01:59:46,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-24 01:59:46,301 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:46,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 1 times [2022-02-24 01:59:46,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:46,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584602335] [2022-02-24 01:59:46,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:46,303 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:46,353 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:46,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584602335] [2022-02-24 01:59:46,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [584602335] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:46,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:46,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:46,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758720436] [2022-02-24 01:59:46,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:46,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:46,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:46,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:46,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:46,354 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-02-24 01:59:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:46,421 INFO L93 Difference]: Finished difference Result 605 states and 941 transitions. [2022-02-24 01:59:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:46,422 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-02-24 01:59:46,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:46,423 INFO L225 Difference]: With dead ends: 605 [2022-02-24 01:59:46,423 INFO L226 Difference]: Without dead ends: 355 [2022-02-24 01:59:46,424 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-02-24 01:59:46,424 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-02-24 01:59:46,425 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-02-24 01:59:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-02-24 01:59:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2022-02-24 01:59:46,451 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-02-24 01:59:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 535 transitions. [2022-02-24 01:59:46,452 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 535 transitions. Word has length 21 [2022-02-24 01:59:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:46,453 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 535 transitions. [2022-02-24 01:59:46,453 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-02-24 01:59:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 535 transitions. [2022-02-24 01:59:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-24 01:59:46,454 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:46,454 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-02-24 01:59:46,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-24 01:59:46,454 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 1 times [2022-02-24 01:59:46,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:46,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1757572066] [2022-02-24 01:59:46,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:46,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:46,456 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:46,476 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:46,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1757572066] [2022-02-24 01:59:46,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1757572066] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:46,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:46,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:46,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417574491] [2022-02-24 01:59:46,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:46,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:46,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:46,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:46,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:46,478 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-02-24 01:59:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:46,547 INFO L93 Difference]: Finished difference Result 529 states and 797 transitions. [2022-02-24 01:59:46,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:46,547 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-02-24 01:59:46,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:46,549 INFO L225 Difference]: With dead ends: 529 [2022-02-24 01:59:46,549 INFO L226 Difference]: Without dead ends: 363 [2022-02-24 01:59:46,550 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-02-24 01:59:46,550 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-02-24 01:59:46,551 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-02-24 01:59:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-02-24 01:59:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2022-02-24 01:59:46,579 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-02-24 01:59:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 535 transitions. [2022-02-24 01:59:46,581 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 535 transitions. Word has length 22 [2022-02-24 01:59:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:46,582 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 535 transitions. [2022-02-24 01:59:46,583 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-02-24 01:59:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 535 transitions. [2022-02-24 01:59:46,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-24 01:59:46,583 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:46,583 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-02-24 01:59:46,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-24 01:59:46,584 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:46,584 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 1 times [2022-02-24 01:59:46,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:46,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1349558820] [2022-02-24 01:59:46,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:46,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:46,591 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:46,629 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:46,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1349558820] [2022-02-24 01:59:46,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1349558820] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:46,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:46,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:46,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220552810] [2022-02-24 01:59:46,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:46,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:46,630 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:46,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:46,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:46,630 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-02-24 01:59:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:46,713 INFO L93 Difference]: Finished difference Result 621 states and 929 transitions. [2022-02-24 01:59:46,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:46,713 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-02-24 01:59:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:46,715 INFO L225 Difference]: With dead ends: 621 [2022-02-24 01:59:46,715 INFO L226 Difference]: Without dead ends: 619 [2022-02-24 01:59:46,716 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-02-24 01:59:46,716 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-02-24 01:59:46,716 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-02-24 01:59:46,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-02-24 01:59:46,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 521. [2022-02-24 01:59:46,774 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-02-24 01:59:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 751 transitions. [2022-02-24 01:59:46,776 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 751 transitions. Word has length 22 [2022-02-24 01:59:46,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:46,776 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 751 transitions. [2022-02-24 01:59:46,776 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-02-24 01:59:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 751 transitions. [2022-02-24 01:59:46,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-24 01:59:46,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:46,779 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-02-24 01:59:46,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-24 01:59:46,779 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:46,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:46,780 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 1 times [2022-02-24 01:59:46,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:46,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1070624720] [2022-02-24 01:59:46,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:46,782 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:46,819 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:46,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1070624720] [2022-02-24 01:59:46,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1070624720] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:46,820 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:46,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:46,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404319176] [2022-02-24 01:59:46,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:46,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:46,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:46,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:46,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:46,821 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-02-24 01:59:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:46,905 INFO L93 Difference]: Finished difference Result 1181 states and 1697 transitions. [2022-02-24 01:59:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:46,906 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-02-24 01:59:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:46,908 INFO L225 Difference]: With dead ends: 1181 [2022-02-24 01:59:46,908 INFO L226 Difference]: Without dead ends: 683 [2022-02-24 01:59:46,909 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-02-24 01:59:46,910 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-02-24 01:59:46,910 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-02-24 01:59:46,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-02-24 01:59:46,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2022-02-24 01:59:46,953 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-02-24 01:59:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 951 transitions. [2022-02-24 01:59:46,955 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 951 transitions. Word has length 22 [2022-02-24 01:59:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:46,956 INFO L470 AbstractCegarLoop]: Abstraction has 681 states and 951 transitions. [2022-02-24 01:59:46,956 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-02-24 01:59:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 951 transitions. [2022-02-24 01:59:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-24 01:59:46,957 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:46,957 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-02-24 01:59:46,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-24 01:59:46,957 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:46,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:46,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 1 times [2022-02-24 01:59:46,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:46,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [553137714] [2022-02-24 01:59:46,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:46,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:46,959 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:46,978 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:46,978 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [553137714] [2022-02-24 01:59:46,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [553137714] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:46,978 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:46,978 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:46,978 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579813067] [2022-02-24 01:59:46,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:46,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:46,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:46,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:46,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:46,979 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-02-24 01:59:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:47,058 INFO L93 Difference]: Finished difference Result 1021 states and 1417 transitions. [2022-02-24 01:59:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:47,058 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-02-24 01:59:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:47,060 INFO L225 Difference]: With dead ends: 1021 [2022-02-24 01:59:47,060 INFO L226 Difference]: Without dead ends: 699 [2022-02-24 01:59:47,061 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-02-24 01:59:47,061 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-02-24 01:59:47,062 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-02-24 01:59:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-02-24 01:59:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-02-24 01:59:47,102 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-02-24 01:59:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 951 transitions. [2022-02-24 01:59:47,104 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 951 transitions. Word has length 23 [2022-02-24 01:59:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:47,104 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 951 transitions. [2022-02-24 01:59:47,104 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-02-24 01:59:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 951 transitions. [2022-02-24 01:59:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-24 01:59:47,105 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:47,105 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-02-24 01:59:47,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-24 01:59:47,105 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:47,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:47,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 1 times [2022-02-24 01:59:47,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:47,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227976106] [2022-02-24 01:59:47,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:47,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:47,107 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:47,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:47,130 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:47,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1227976106] [2022-02-24 01:59:47,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1227976106] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:47,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:47,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:47,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79883795] [2022-02-24 01:59:47,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:47,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:47,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:47,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:47,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:47,132 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-02-24 01:59:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:47,258 INFO L93 Difference]: Finished difference Result 1165 states and 1593 transitions. [2022-02-24 01:59:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:47,259 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-02-24 01:59:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:47,262 INFO L225 Difference]: With dead ends: 1165 [2022-02-24 01:59:47,262 INFO L226 Difference]: Without dead ends: 1163 [2022-02-24 01:59:47,263 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-02-24 01:59:47,264 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-02-24 01:59:47,264 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-02-24 01:59:47,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-02-24 01:59:47,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1033. [2022-02-24 01:59:47,324 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-02-24 01:59:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1367 transitions. [2022-02-24 01:59:47,327 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1367 transitions. Word has length 23 [2022-02-24 01:59:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:47,327 INFO L470 AbstractCegarLoop]: Abstraction has 1033 states and 1367 transitions. [2022-02-24 01:59:47,327 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-02-24 01:59:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1367 transitions. [2022-02-24 01:59:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-24 01:59:47,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:47,329 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-02-24 01:59:47,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-24 01:59:47,329 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:47,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 1 times [2022-02-24 01:59:47,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:47,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [198715477] [2022-02-24 01:59:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:47,332 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:47,361 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:47,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [198715477] [2022-02-24 01:59:47,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [198715477] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:47,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:47,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:47,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369604762] [2022-02-24 01:59:47,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:47,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:47,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:47,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:47,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:47,363 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-02-24 01:59:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:47,475 INFO L93 Difference]: Finished difference Result 2317 states and 3033 transitions. [2022-02-24 01:59:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:47,476 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-02-24 01:59:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:47,482 INFO L225 Difference]: With dead ends: 2317 [2022-02-24 01:59:47,482 INFO L226 Difference]: Without dead ends: 1323 [2022-02-24 01:59:47,483 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-02-24 01:59:47,484 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-02-24 01:59:47,484 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-02-24 01:59:47,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-02-24 01:59:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2022-02-24 01:59:47,588 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-02-24 01:59:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1671 transitions. [2022-02-24 01:59:47,591 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1671 transitions. Word has length 23 [2022-02-24 01:59:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:47,591 INFO L470 AbstractCegarLoop]: Abstraction has 1321 states and 1671 transitions. [2022-02-24 01:59:47,592 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-02-24 01:59:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1671 transitions. [2022-02-24 01:59:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-24 01:59:47,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:47,593 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-02-24 01:59:47,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-24 01:59:47,593 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:47,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:47,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 1 times [2022-02-24 01:59:47,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:47,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1667166864] [2022-02-24 01:59:47,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:47,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:47,595 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:47,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:47,621 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:47,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1667166864] [2022-02-24 01:59:47,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1667166864] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:47,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:47,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:47,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433086981] [2022-02-24 01:59:47,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:47,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:47,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:47,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:47,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:47,622 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-02-24 01:59:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:47,754 INFO L93 Difference]: Finished difference Result 1981 states and 2489 transitions. [2022-02-24 01:59:47,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:47,754 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-02-24 01:59:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:47,759 INFO L225 Difference]: With dead ends: 1981 [2022-02-24 01:59:47,759 INFO L226 Difference]: Without dead ends: 1355 [2022-02-24 01:59:47,760 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-02-24 01:59:47,761 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-02-24 01:59:47,761 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-02-24 01:59:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-02-24 01:59:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-02-24 01:59:47,840 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-02-24 01:59:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1671 transitions. [2022-02-24 01:59:47,843 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1671 transitions. Word has length 24 [2022-02-24 01:59:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:47,843 INFO L470 AbstractCegarLoop]: Abstraction has 1353 states and 1671 transitions. [2022-02-24 01:59:47,843 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-02-24 01:59:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1671 transitions. [2022-02-24 01:59:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-24 01:59:47,845 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:47,845 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-02-24 01:59:47,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-24 01:59:47,845 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 1 times [2022-02-24 01:59:47,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:47,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1340736780] [2022-02-24 01:59:47,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:47,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:47,847 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:47,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:47,868 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:47,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1340736780] [2022-02-24 01:59:47,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1340736780] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:47,868 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:47,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:47,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658761319] [2022-02-24 01:59:47,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:47,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:47,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:47,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:47,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:47,869 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-02-24 01:59:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:48,035 INFO L93 Difference]: Finished difference Result 2187 states and 2664 transitions. [2022-02-24 01:59:48,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:48,035 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-02-24 01:59:48,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:48,040 INFO L225 Difference]: With dead ends: 2187 [2022-02-24 01:59:48,040 INFO L226 Difference]: Without dead ends: 2185 [2022-02-24 01:59:48,041 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-02-24 01:59:48,041 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-02-24 01:59:48,041 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-02-24 01:59:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-02-24 01:59:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2057. [2022-02-24 01:59:48,161 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-02-24 01:59:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2471 transitions. [2022-02-24 01:59:48,166 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2471 transitions. Word has length 24 [2022-02-24 01:59:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:48,166 INFO L470 AbstractCegarLoop]: Abstraction has 2057 states and 2471 transitions. [2022-02-24 01:59:48,166 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-02-24 01:59:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2471 transitions. [2022-02-24 01:59:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-24 01:59:48,168 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:59:48,168 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-02-24 01:59:48,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-24 01:59:48,168 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:59:48,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:59:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 1 times [2022-02-24 01:59:48,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:59:48,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [337627144] [2022-02-24 01:59:48,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:59:48,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:59:48,170 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:59:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:48,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:59:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:59:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:59:48,185 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:59:48,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [337627144] [2022-02-24 01:59:48,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [337627144] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:59:48,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:59:48,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:59:48,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409262019] [2022-02-24 01:59:48,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:59:48,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:59:48,186 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:59:48,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:59:48,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:59:48,186 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-02-24 01:59:48,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:59:48,401 INFO L93 Difference]: Finished difference Result 4553 states and 5351 transitions. [2022-02-24 01:59:48,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:59:48,402 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-02-24 01:59:48,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:59:48,402 INFO L225 Difference]: With dead ends: 4553 [2022-02-24 01:59:48,402 INFO L226 Difference]: Without dead ends: 0 [2022-02-24 01:59:48,407 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-02-24 01:59:48,408 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-02-24 01:59:48,408 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-02-24 01:59:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-24 01:59:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-24 01:59:48,409 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-02-24 01:59:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-24 01:59:48,409 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-02-24 01:59:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:59:48,409 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-24 01:59:48,409 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-02-24 01:59:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-24 01:59:48,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-24 01:59:48,411 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-24 01:59:48,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-24 01:59:48,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-24 02:00:16,309 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-02-24 02:00:16,310 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-02-24 02:00:16,310 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-02-24 02:00:16,310 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-24 02:00:16,310 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-02-24 02:00:16,310 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-24 02:00:16,310 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-24 02:00:16,310 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-24 02:00:16,310 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-24 02:00:16,310 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-24 02:00:16,311 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-02-24 02:00:16,312 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2022-02-24 02:00:16,312 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-02-24 02:00:16,312 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-02-24 02:00:16,313 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-02-24 02:00:16,313 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-02-24 02:00:16,313 INFO L861 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-02-24 02:00:16,313 INFO L861 garLoopResultBuilder]: At program point L53(lines 53 55) the Hoare annotation is: true [2022-02-24 02:00:16,313 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-02-24 02:00:16,313 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-02-24 02:00:16,314 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2022-02-24 02:00:16,314 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-02-24 02:00:16,314 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) the Hoare annotation is: false [2022-02-24 02:00:16,314 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2022-02-24 02:00:16,315 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-02-24 02:00:16,315 INFO L861 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-02-24 02:00:16,315 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-02-24 02:00:16,315 INFO L854 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2022-02-24 02:00:16,315 INFO L854 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-02-24 02:00:16,315 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-02-24 02:00:16,315 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-02-24 02:00:16,315 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-02-24 02:00:16,315 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-02-24 02:00:16,316 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-02-24 02:00:16,316 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-02-24 02:00:16,316 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-02-24 02:00:16,316 INFO L861 garLoopResultBuilder]: At program point L34(lines 34 36) the Hoare annotation is: true [2022-02-24 02:00:16,317 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-02-24 02:00:16,317 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-02-24 02:00:16,319 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-02-24 02:00:16,320 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-24 02:00:16,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 02:00:16 BoogieIcfgContainer [2022-02-24 02:00:16,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-24 02:00:16,330 INFO L158 Benchmark]: Toolchain (without parser) took 32154.90ms. Allocated memory was 255.9MB in the beginning and 1.0GB in the end (delta: 791.7MB). Free memory was 199.2MB in the beginning and 692.0MB in the end (delta: -492.8MB). Peak memory consumption was 619.1MB. Max. memory is 8.0GB. [2022-02-24 02:00:16,330 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 215.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 02:00:16,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.25ms. Allocated memory was 255.9MB in the beginning and 399.5MB in the end (delta: 143.7MB). Free memory was 199.0MB in the beginning and 368.1MB in the end (delta: -169.1MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-02-24 02:00:16,331 INFO L158 Benchmark]: Boogie Preprocessor took 37.50ms. Allocated memory is still 399.5MB. Free memory was 368.1MB in the beginning and 366.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-24 02:00:16,332 INFO L158 Benchmark]: RCFGBuilder took 278.97ms. Allocated memory is still 399.5MB. Free memory was 366.5MB in the beginning and 354.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-24 02:00:16,333 INFO L158 Benchmark]: TraceAbstraction took 31577.30ms. Allocated memory was 399.5MB in the beginning and 1.0GB in the end (delta: 648.0MB). Free memory was 354.0MB in the beginning and 692.0MB in the end (delta: -338.1MB). Peak memory consumption was 630.8MB. Max. memory is 8.0GB. [2022-02-24 02:00:16,337 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.10ms. Allocated memory is still 255.9MB. Free memory is still 215.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.25ms. Allocated memory was 255.9MB in the beginning and 399.5MB in the end (delta: 143.7MB). Free memory was 199.0MB in the beginning and 368.1MB in the end (delta: -169.1MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.50ms. Allocated memory is still 399.5MB. Free memory was 368.1MB in the beginning and 366.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 278.97ms. Allocated memory is still 399.5MB. Free memory was 366.5MB in the beginning and 354.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 31577.30ms. Allocated memory was 399.5MB in the beginning and 1.0GB in the end (delta: 648.0MB). Free memory was 354.0MB in the beginning and 692.0MB in the end (delta: -338.1MB). Peak memory consumption was 630.8MB. 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: 31.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 27.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1693 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1693 mSDsluCounter, 1341 SdHoareTripleChecker+Invalid, 0.6s 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: 0.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 36 PreInvPairs, 2605 NumberOfFragments, 9766 HoareAnnotationTreeSize, 36 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 11.2s HoareSimplificationTime, 36 FomulaSimplificationsInter, 148195 FormulaSimplificationTreeSizeReductionInter, 16.6s 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-02-24 02:00:16,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...