/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 22:22:34,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 22:22:34,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 22:22:34,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 22:22:34,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 22:22:34,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 22:22:34,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 22:22:34,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 22:22:34,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 22:22:34,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 22:22:34,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 22:22:34,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 22:22:34,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 22:22:34,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 22:22:34,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 22:22:34,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 22:22:34,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 22:22:34,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 22:22:34,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 22:22:34,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 22:22:34,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 22:22:34,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 22:22:34,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 22:22:34,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 22:22:34,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 22:22:34,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 22:22:34,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 22:22:34,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 22:22:34,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 22:22:34,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 22:22:34,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 22:22:34,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 22:22:34,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 22:22:34,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 22:22:34,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 22:22:34,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 22:22:34,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 22:22:34,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 22:22:34,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 22:22:34,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 22:22:34,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 22:22:34,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 22:22:34,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 22:22:34,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 22:22:34,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 22:22:34,769 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 22:22:34,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 22:22:34,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 22:22:34,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 22:22:34,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 22:22:34,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 22:22:34,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 22:22:34,769 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 22:22:34,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 22:22:34,770 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 22:22:34,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 22:22:34,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 22:22:34,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 22:22:34,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 22:22:34,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 22:22:34,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 22:22:34,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 22:22:34,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 22:22:34,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 22:22:34,771 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 22:22:34,771 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 22:22:34,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 22:22:34,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 22:22:34,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 22:22:34,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 22:22:34,925 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 22:22:34,926 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2022-01-31 22:22:34,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473471aaf/3c295fc938ec419a8c005f919cfd8ee3/FLAG3c17ecdd5 [2022-01-31 22:22:35,386 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 22:22:35,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2022-01-31 22:22:35,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473471aaf/3c295fc938ec419a8c005f919cfd8ee3/FLAG3c17ecdd5 [2022-01-31 22:22:35,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473471aaf/3c295fc938ec419a8c005f919cfd8ee3 [2022-01-31 22:22:35,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 22:22:35,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 22:22:35,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 22:22:35,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 22:22:35,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 22:22:35,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:22:35" (1/1) ... [2022-01-31 22:22:35,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ada558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:35, skipping insertion in model container [2022-01-31 22:22:35,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:22:35" (1/1) ... [2022-01-31 22:22:35,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 22:22:35,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 22:22:35,588 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_6.c[2544,2557] [2022-01-31 22:22:35,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 22:22:35,596 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 22:22:35,620 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_6.c[2544,2557] [2022-01-31 22:22:35,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 22:22:35,630 INFO L208 MainTranslator]: Completed translation [2022-01-31 22:22:35,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:35 WrapperNode [2022-01-31 22:22:35,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 22:22:35,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 22:22:35,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 22:22:35,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 22:22:35,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:35" (1/1) ... [2022-01-31 22:22:35,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:35" (1/1) ... [2022-01-31 22:22:35,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:35" (1/1) ... [2022-01-31 22:22:35,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:35" (1/1) ... [2022-01-31 22:22:35,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:35" (1/1) ... [2022-01-31 22:22:35,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:35" (1/1) ... [2022-01-31 22:22:35,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:35" (1/1) ... [2022-01-31 22:22:35,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 22:22:35,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 22:22:35,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 22:22:35,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 22:22:35,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:35" (1/1) ... [2022-01-31 22:22:35,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 22:22:35,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 22:22:35,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 22:22:35,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 22:22:35,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 22:22:35,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 22:22:35,740 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 22:22:35,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 22:22:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 22:22:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 22:22:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 22:22:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 22:22:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 22:22:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 22:22:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 22:22:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 22:22:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 22:22:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 22:22:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 22:22:35,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 22:22:35,794 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 22:22:35,795 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 22:22:35,906 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 22:22:35,910 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 22:22:35,910 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 22:22:35,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:22:35 BoogieIcfgContainer [2022-01-31 22:22:35,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 22:22:35,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 22:22:35,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 22:22:35,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 22:22:35,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 10:22:35" (1/3) ... [2022-01-31 22:22:35,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bafc48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:22:35, skipping insertion in model container [2022-01-31 22:22:35,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:35" (2/3) ... [2022-01-31 22:22:35,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bafc48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:22:35, skipping insertion in model container [2022-01-31 22:22:35,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:22:35" (3/3) ... [2022-01-31 22:22:35,917 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2022-01-31 22:22:35,920 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 22:22:35,920 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 22:22:35,946 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 22:22:35,951 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-01-31 22:22:35,951 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 22:22:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 22:22:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 22:22:35,987 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:35,987 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:35,987 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:35,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:35,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 1 times [2022-01-31 22:22:36,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:36,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2108917517] [2022-01-31 22:22:36,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:36,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:36,063 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:36,221 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:36,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2108917517] [2022-01-31 22:22:36,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2108917517] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:36,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:36,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:36,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180892490] [2022-01-31 22:22:36,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:36,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:36,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:36,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:36,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:36,258 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:36,384 INFO L93 Difference]: Finished difference Result 64 states and 103 transitions. [2022-01-31 22:22:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:36,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-01-31 22:22:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:36,391 INFO L225 Difference]: With dead ends: 64 [2022-01-31 22:22:36,391 INFO L226 Difference]: Without dead ends: 49 [2022-01-31 22:22:36,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:36,395 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 106 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:36,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 65 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 22:22:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-01-31 22:22:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-01-31 22:22:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2022-01-31 22:22:36,425 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2022-01-31 22:22:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:36,425 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2022-01-31 22:22:36,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2022-01-31 22:22:36,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 22:22:36,426 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:36,426 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:36,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 22:22:36,426 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:36,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:36,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 1 times [2022-01-31 22:22:36,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:36,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [410980087] [2022-01-31 22:22:36,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:36,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:36,429 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:36,475 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:36,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [410980087] [2022-01-31 22:22:36,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [410980087] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:36,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:36,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:36,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207390768] [2022-01-31 22:22:36,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:36,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:36,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:36,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:36,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:36,478 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:36,530 INFO L93 Difference]: Finished difference Result 78 states and 133 transitions. [2022-01-31 22:22:36,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:36,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-01-31 22:22:36,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:36,531 INFO L225 Difference]: With dead ends: 78 [2022-01-31 22:22:36,531 INFO L226 Difference]: Without dead ends: 49 [2022-01-31 22:22:36,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:36,533 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:36,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-01-31 22:22:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-01-31 22:22:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-01-31 22:22:36,541 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 17 [2022-01-31 22:22:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:36,541 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-01-31 22:22:36,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-01-31 22:22:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 22:22:36,542 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:36,542 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:36,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 22:22:36,542 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:36,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:36,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 1 times [2022-01-31 22:22:36,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:36,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1686097992] [2022-01-31 22:22:36,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:36,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:36,545 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:36,576 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:36,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1686097992] [2022-01-31 22:22:36,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1686097992] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:36,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:36,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:36,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012553872] [2022-01-31 22:22:36,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:36,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:36,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:36,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:36,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:36,578 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:36,640 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-01-31 22:22:36,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:36,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 22:22:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:36,641 INFO L225 Difference]: With dead ends: 73 [2022-01-31 22:22:36,641 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 22:22:36,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:36,642 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:36,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:36,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 22:22:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-01-31 22:22:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-01-31 22:22:36,649 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 18 [2022-01-31 22:22:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:36,649 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-01-31 22:22:36,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-01-31 22:22:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 22:22:36,650 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:36,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:36,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 22:22:36,650 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:36,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 1 times [2022-01-31 22:22:36,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:36,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1319096096] [2022-01-31 22:22:36,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:36,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:36,653 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:36,680 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:36,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1319096096] [2022-01-31 22:22:36,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1319096096] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:36,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:36,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:36,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969143321] [2022-01-31 22:22:36,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:36,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:36,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:36,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:36,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:36,682 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:36,730 INFO L93 Difference]: Finished difference Result 130 states and 216 transitions. [2022-01-31 22:22:36,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:36,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 22:22:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:36,732 INFO L225 Difference]: With dead ends: 130 [2022-01-31 22:22:36,732 INFO L226 Difference]: Without dead ends: 89 [2022-01-31 22:22:36,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:36,733 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:36,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 55 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-31 22:22:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-01-31 22:22:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2022-01-31 22:22:36,743 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 18 [2022-01-31 22:22:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:36,743 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2022-01-31 22:22:36,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2022-01-31 22:22:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 22:22:36,744 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:36,744 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:36,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 22:22:36,744 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:36,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:36,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 1 times [2022-01-31 22:22:36,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:36,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [477680072] [2022-01-31 22:22:36,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:36,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:36,746 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:36,772 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:36,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [477680072] [2022-01-31 22:22:36,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [477680072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:36,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:36,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:36,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495525620] [2022-01-31 22:22:36,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:36,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:36,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:36,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:36,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:36,773 INFO L87 Difference]: Start difference. First operand 87 states and 141 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:36,820 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2022-01-31 22:22:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:36,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 22:22:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:36,821 INFO L225 Difference]: With dead ends: 111 [2022-01-31 22:22:36,821 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 22:22:36,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:36,822 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:36,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 80 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 22:22:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2022-01-31 22:22:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2022-01-31 22:22:36,832 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 18 [2022-01-31 22:22:36,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:36,833 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2022-01-31 22:22:36,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2022-01-31 22:22:36,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 22:22:36,833 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:36,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:36,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 22:22:36,834 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:36,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:36,834 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 1 times [2022-01-31 22:22:36,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:36,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910002665] [2022-01-31 22:22:36,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:36,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:36,836 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:36,879 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:36,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910002665] [2022-01-31 22:22:36,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [910002665] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:36,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:36,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:36,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911251873] [2022-01-31 22:22:36,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:36,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:36,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:36,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:36,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:36,881 INFO L87 Difference]: Start difference. First operand 87 states and 139 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:36,936 INFO L93 Difference]: Finished difference Result 155 states and 251 transitions. [2022-01-31 22:22:36,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:36,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 22:22:36,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:36,937 INFO L225 Difference]: With dead ends: 155 [2022-01-31 22:22:36,937 INFO L226 Difference]: Without dead ends: 153 [2022-01-31 22:22:36,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:36,940 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:36,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-01-31 22:22:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2022-01-31 22:22:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2022-01-31 22:22:36,959 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 19 [2022-01-31 22:22:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:36,959 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2022-01-31 22:22:36,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2022-01-31 22:22:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 22:22:36,960 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:36,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:36,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 22:22:36,960 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:36,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:36,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 1 times [2022-01-31 22:22:36,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:36,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [358737074] [2022-01-31 22:22:36,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:36,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:36,962 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:36,984 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:36,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [358737074] [2022-01-31 22:22:36,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [358737074] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:36,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:36,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:36,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589826671] [2022-01-31 22:22:36,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:36,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:36,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:36,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:36,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:36,985 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:37,040 INFO L93 Difference]: Finished difference Result 271 states and 435 transitions. [2022-01-31 22:22:37,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:37,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 22:22:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:37,041 INFO L225 Difference]: With dead ends: 271 [2022-01-31 22:22:37,041 INFO L226 Difference]: Without dead ends: 161 [2022-01-31 22:22:37,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-01-31 22:22:37,042 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:37,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:37,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-01-31 22:22:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-01-31 22:22:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2022-01-31 22:22:37,058 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 19 [2022-01-31 22:22:37,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:37,059 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2022-01-31 22:22:37,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2022-01-31 22:22:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 22:22:37,060 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:37,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:37,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 22:22:37,060 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:37,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:37,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 1 times [2022-01-31 22:22:37,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:37,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1670394131] [2022-01-31 22:22:37,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:37,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:37,062 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:37,083 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:37,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1670394131] [2022-01-31 22:22:37,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1670394131] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:37,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:37,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:37,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330685300] [2022-01-31 22:22:37,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:37,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:37,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:37,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:37,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:37,084 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:37,136 INFO L93 Difference]: Finished difference Result 241 states and 373 transitions. [2022-01-31 22:22:37,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:37,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-31 22:22:37,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:37,137 INFO L225 Difference]: With dead ends: 241 [2022-01-31 22:22:37,138 INFO L226 Difference]: Without dead ends: 167 [2022-01-31 22:22:37,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:37,138 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:37,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:37,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-01-31 22:22:37,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-01-31 22:22:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2022-01-31 22:22:37,159 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 20 [2022-01-31 22:22:37,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:37,159 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2022-01-31 22:22:37,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,159 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2022-01-31 22:22:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 22:22:37,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:37,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:37,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 22:22:37,160 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:37,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:37,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 1 times [2022-01-31 22:22:37,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:37,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1737776716] [2022-01-31 22:22:37,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:37,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:37,162 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:37,181 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:37,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1737776716] [2022-01-31 22:22:37,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1737776716] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:37,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:37,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:37,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127957967] [2022-01-31 22:22:37,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:37,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:37,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:37,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:37,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:37,182 INFO L87 Difference]: Start difference. First operand 165 states and 251 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:37,235 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2022-01-31 22:22:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:37,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-31 22:22:37,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:37,237 INFO L225 Difference]: With dead ends: 285 [2022-01-31 22:22:37,237 INFO L226 Difference]: Without dead ends: 283 [2022-01-31 22:22:37,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:37,237 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:37,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:37,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-01-31 22:22:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2022-01-31 22:22:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 347 transitions. [2022-01-31 22:22:37,254 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 347 transitions. Word has length 20 [2022-01-31 22:22:37,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:37,255 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 347 transitions. [2022-01-31 22:22:37,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 347 transitions. [2022-01-31 22:22:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 22:22:37,255 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:37,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:37,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 22:22:37,256 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 1 times [2022-01-31 22:22:37,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:37,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1449779815] [2022-01-31 22:22:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:37,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:37,257 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:37,275 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:37,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1449779815] [2022-01-31 22:22:37,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1449779815] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:37,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:37,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:37,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110753122] [2022-01-31 22:22:37,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:37,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:37,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:37,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:37,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:37,276 INFO L87 Difference]: Start difference. First operand 233 states and 347 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:37,333 INFO L93 Difference]: Finished difference Result 525 states and 781 transitions. [2022-01-31 22:22:37,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:37,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-31 22:22:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:37,334 INFO L225 Difference]: With dead ends: 525 [2022-01-31 22:22:37,334 INFO L226 Difference]: Without dead ends: 307 [2022-01-31 22:22:37,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:37,336 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:37,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-01-31 22:22:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-01-31 22:22:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 439 transitions. [2022-01-31 22:22:37,359 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 439 transitions. Word has length 20 [2022-01-31 22:22:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:37,359 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 439 transitions. [2022-01-31 22:22:37,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 439 transitions. [2022-01-31 22:22:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 22:22:37,360 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:37,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:37,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 22:22:37,360 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:37,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:37,360 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 1 times [2022-01-31 22:22:37,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:37,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1215792219] [2022-01-31 22:22:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:37,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:37,362 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:37,379 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:37,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1215792219] [2022-01-31 22:22:37,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1215792219] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:37,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:37,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:37,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963089987] [2022-01-31 22:22:37,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:37,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:37,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:37,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:37,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:37,381 INFO L87 Difference]: Start difference. First operand 305 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:37,441 INFO L93 Difference]: Finished difference Result 457 states and 653 transitions. [2022-01-31 22:22:37,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:37,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-01-31 22:22:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:37,442 INFO L225 Difference]: With dead ends: 457 [2022-01-31 22:22:37,442 INFO L226 Difference]: Without dead ends: 315 [2022-01-31 22:22:37,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:37,443 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:37,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:37,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-01-31 22:22:37,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2022-01-31 22:22:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 439 transitions. [2022-01-31 22:22:37,464 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 439 transitions. Word has length 21 [2022-01-31 22:22:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:37,464 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 439 transitions. [2022-01-31 22:22:37,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 439 transitions. [2022-01-31 22:22:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 22:22:37,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:37,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:37,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 22:22:37,465 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:37,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 1 times [2022-01-31 22:22:37,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:37,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [222666672] [2022-01-31 22:22:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:37,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:37,467 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:37,485 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:37,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [222666672] [2022-01-31 22:22:37,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [222666672] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:37,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:37,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:37,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613505939] [2022-01-31 22:22:37,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:37,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:37,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:37,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:37,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:37,486 INFO L87 Difference]: Start difference. First operand 313 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:37,577 INFO L93 Difference]: Finished difference Result 525 states and 737 transitions. [2022-01-31 22:22:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:37,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-01-31 22:22:37,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:37,578 INFO L225 Difference]: With dead ends: 525 [2022-01-31 22:22:37,579 INFO L226 Difference]: Without dead ends: 523 [2022-01-31 22:22:37,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:37,579 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:37,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:37,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-01-31 22:22:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 457. [2022-01-31 22:22:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 623 transitions. [2022-01-31 22:22:37,613 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 623 transitions. Word has length 21 [2022-01-31 22:22:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:37,613 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 623 transitions. [2022-01-31 22:22:37,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 623 transitions. [2022-01-31 22:22:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 22:22:37,614 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:37,614 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:37,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 22:22:37,614 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:37,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:37,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 1 times [2022-01-31 22:22:37,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:37,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1581320755] [2022-01-31 22:22:37,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:37,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:37,617 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:37,649 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:37,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1581320755] [2022-01-31 22:22:37,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1581320755] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:37,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:37,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:37,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205647546] [2022-01-31 22:22:37,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:37,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:37,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:37,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:37,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:37,650 INFO L87 Difference]: Start difference. First operand 457 states and 623 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:37,725 INFO L93 Difference]: Finished difference Result 1021 states and 1377 transitions. [2022-01-31 22:22:37,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:37,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-01-31 22:22:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:37,727 INFO L225 Difference]: With dead ends: 1021 [2022-01-31 22:22:37,727 INFO L226 Difference]: Without dead ends: 587 [2022-01-31 22:22:37,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:37,728 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:37,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 71 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-01-31 22:22:37,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-01-31 22:22:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 759 transitions. [2022-01-31 22:22:37,767 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 759 transitions. Word has length 21 [2022-01-31 22:22:37,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:37,767 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 759 transitions. [2022-01-31 22:22:37,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 759 transitions. [2022-01-31 22:22:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 22:22:37,768 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:37,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:37,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 22:22:37,769 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:37,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:37,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 1 times [2022-01-31 22:22:37,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:37,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [683844579] [2022-01-31 22:22:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:37,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:37,770 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:37,787 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:37,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [683844579] [2022-01-31 22:22:37,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [683844579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:37,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:37,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:37,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430025820] [2022-01-31 22:22:37,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:37,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:37,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:37,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:37,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:37,788 INFO L87 Difference]: Start difference. First operand 585 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:37,861 INFO L93 Difference]: Finished difference Result 877 states and 1129 transitions. [2022-01-31 22:22:37,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:37,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-31 22:22:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:37,863 INFO L225 Difference]: With dead ends: 877 [2022-01-31 22:22:37,863 INFO L226 Difference]: Without dead ends: 603 [2022-01-31 22:22:37,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:37,864 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:37,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-01-31 22:22:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-01-31 22:22:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 759 transitions. [2022-01-31 22:22:37,928 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 759 transitions. Word has length 22 [2022-01-31 22:22:37,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:37,928 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 759 transitions. [2022-01-31 22:22:37,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:37,928 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 759 transitions. [2022-01-31 22:22:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 22:22:37,929 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:37,929 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:37,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 22:22:37,930 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:37,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:37,930 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 1 times [2022-01-31 22:22:37,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:37,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [897664794] [2022-01-31 22:22:37,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:37,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:37,931 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:37,950 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:37,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [897664794] [2022-01-31 22:22:37,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [897664794] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:37,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:37,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:37,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192295534] [2022-01-31 22:22:37,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:37,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:37,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:37,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:37,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:37,951 INFO L87 Difference]: Start difference. First operand 601 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:38,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:38,036 INFO L93 Difference]: Finished difference Result 971 states and 1208 transitions. [2022-01-31 22:22:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:38,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-31 22:22:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:38,039 INFO L225 Difference]: With dead ends: 971 [2022-01-31 22:22:38,039 INFO L226 Difference]: Without dead ends: 969 [2022-01-31 22:22:38,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:38,040 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:38,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-01-31 22:22:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 905. [2022-01-31 22:22:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1111 transitions. [2022-01-31 22:22:38,092 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1111 transitions. Word has length 22 [2022-01-31 22:22:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:38,093 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 1111 transitions. [2022-01-31 22:22:38,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1111 transitions. [2022-01-31 22:22:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 22:22:38,094 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:38,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:38,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 22:22:38,094 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:38,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 1 times [2022-01-31 22:22:38,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:38,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [121777946] [2022-01-31 22:22:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:38,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:38,095 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:38,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:38,118 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:38,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [121777946] [2022-01-31 22:22:38,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [121777946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:38,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:38,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:38,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923158760] [2022-01-31 22:22:38,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:38,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:38,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:38,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:38,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:38,119 INFO L87 Difference]: Start difference. First operand 905 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:38,239 INFO L93 Difference]: Finished difference Result 1993 states and 2391 transitions. [2022-01-31 22:22:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:38,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-31 22:22:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:38,240 INFO L225 Difference]: With dead ends: 1993 [2022-01-31 22:22:38,240 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 22:22:38,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:38,243 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:38,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 22:22:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 22:22:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 22:22:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 22:22:38,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-01-31 22:22:38,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:38,244 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 22:22:38,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 22:22:38,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 22:22:38,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 22:22:38,246 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 22:22:38,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 22:22:38,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 22:22:45,473 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-01-31 22:22:45,473 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-01-31 22:22:45,473 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-01-31 22:22:45,473 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 22:22:45,473 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 22:22:45,473 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 22:22:45,473 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 22:22:45,474 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 22:22:45,474 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 22:22:45,474 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 22:22:45,474 INFO L854 garLoopResultBuilder]: At program point L60-1(lines 29 104) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-01-31 22:22:45,474 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2022-01-31 22:22:45,474 INFO L854 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse7 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse7 .cse3 .cse6 .cse5) (and .cse0 .cse7 .cse3 .cse6 .cse4))) [2022-01-31 22:22:45,474 INFO L854 garLoopResultBuilder]: At program point L52-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-01-31 22:22:45,474 INFO L854 garLoopResultBuilder]: At program point L94-1(lines 29 104) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2022-01-31 22:22:45,474 INFO L854 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (let ((.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk5~0 1))) (or (and .cse0 .cse1 (= main_~p6~0 0)) (and .cse0 .cse1 (= main_~lk6~0 1)))) [2022-01-31 22:22:45,474 INFO L854 garLoopResultBuilder]: At program point L79-1(lines 29 104) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse7 (= main_~p6~0 0)) (.cse3 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse5 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse2 .cse3) (and .cse5 .cse6 .cse1 .cse7) (and .cse0 .cse4 .cse6 .cse2) (and .cse5 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse7 .cse3) (and .cse4 .cse5 .cse6 .cse2) (and .cse0 .cse4 .cse6 .cse7) (and .cse4 .cse5 .cse7 .cse3))) [2022-01-31 22:22:45,474 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2022-01-31 22:22:45,474 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) the Hoare annotation is: false [2022-01-31 22:22:45,475 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2022-01-31 22:22:45,475 INFO L854 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~p3~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0)) (.cse4 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse6 .cse7 .cse5 .cse3 .cse4) (and .cse7 .cse8 .cse1 .cse2 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse1 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse2 .cse4) (and .cse7 .cse8 .cse1 .cse5 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse5 .cse4) (and .cse0 .cse8 .cse1 .cse5 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse5 .cse4))) [2022-01-31 22:22:45,475 INFO L861 garLoopResultBuilder]: At program point L105(lines 7 109) the Hoare annotation is: true [2022-01-31 22:22:45,475 INFO L861 garLoopResultBuilder]: At program point L31(lines 31 33) the Hoare annotation is: true [2022-01-31 22:22:45,475 INFO L854 garLoopResultBuilder]: At program point L64-1(lines 29 104) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-01-31 22:22:45,475 INFO L854 garLoopResultBuilder]: At program point L89-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~p5~0 0)) (.cse1 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-01-31 22:22:45,475 INFO L854 garLoopResultBuilder]: At program point L56-1(lines 29 104) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-01-31 22:22:45,475 INFO L861 garLoopResultBuilder]: At program point L48(lines 48 50) the Hoare annotation is: true [2022-01-31 22:22:45,475 INFO L854 garLoopResultBuilder]: At program point L48-2(lines 29 104) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-01-31 22:22:45,476 INFO L854 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse4 (= main_~p5~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse5))) [2022-01-31 22:22:45,476 INFO L854 garLoopResultBuilder]: At program point L74-1(lines 29 104) the Hoare annotation is: (let ((.cse8 (= main_~p4~0 0)) (.cse2 (= main_~p2~0 0)) (.cse6 (= main_~p5~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse7 (= main_~p6~0 0)) (.cse9 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse7) (and .cse8 .cse5 .cse6 .cse2 .cse7) (and .cse8 .cse6 .cse3 .cse4 .cse9) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse8 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse0 .cse7 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse7 .cse4 .cse9) (and .cse1 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse1 .cse6 .cse2 .cse7 .cse4) (and .cse1 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4 .cse9) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse1 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse7) (and .cse8 .cse0 .cse3 .cse4 .cse9) (and .cse1 .cse6 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse8 .cse0 .cse5 .cse7 .cse9) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse1 .cse6 .cse3 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse9))) [2022-01-31 22:22:45,476 INFO L861 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2022-01-31 22:22:45,476 INFO L854 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse8 (= main_~p5~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse10 (= main_~p2~0 0)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse11 (= main_~lk3~0 1)) (.cse9 (= main_~lk6~0 1)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse9 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse9 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse4 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse4 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse9 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse4 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse4) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse9 .cse6))) [2022-01-31 22:22:45,476 INFO L854 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2022-01-31 22:22:45,476 INFO L854 garLoopResultBuilder]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2022-01-31 22:22:45,476 INFO L854 garLoopResultBuilder]: At program point L84-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse4 (= main_~p5~0 0)) (.cse2 (= main_~p6~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse4 .cse3) (and .cse0 .cse4 .cse3) (and .cse1 .cse5 .cse2) (and .cse5 .cse4 .cse2) (and .cse1 .cse5 .cse3))) [2022-01-31 22:22:45,477 INFO L854 garLoopResultBuilder]: At program point L68-1(lines 29 104) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-01-31 22:22:45,478 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:45,479 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 22:22:45,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 10:22:45 BoogieIcfgContainer [2022-01-31 22:22:45,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 22:22:45,486 INFO L158 Benchmark]: Toolchain (without parser) took 10077.66ms. Allocated memory was 199.2MB in the beginning and 684.7MB in the end (delta: 485.5MB). Free memory was 147.9MB in the beginning and 516.6MB in the end (delta: -368.7MB). Peak memory consumption was 385.0MB. Max. memory is 8.0GB. [2022-01-31 22:22:45,487 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 199.2MB. Free memory is still 164.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 22:22:45,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.80ms. Allocated memory is still 199.2MB. Free memory was 147.7MB in the beginning and 172.0MB in the end (delta: -24.3MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-01-31 22:22:45,487 INFO L158 Benchmark]: Boogie Preprocessor took 24.32ms. Allocated memory is still 199.2MB. Free memory was 172.0MB in the beginning and 170.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 22:22:45,487 INFO L158 Benchmark]: RCFGBuilder took 255.45ms. Allocated memory is still 199.2MB. Free memory was 170.6MB in the beginning and 159.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-31 22:22:45,488 INFO L158 Benchmark]: TraceAbstraction took 9573.92ms. Allocated memory was 199.2MB in the beginning and 684.7MB in the end (delta: 485.5MB). Free memory was 159.1MB in the beginning and 516.6MB in the end (delta: -357.5MB). Peak memory consumption was 396.5MB. Max. memory is 8.0GB. [2022-01-31 22:22:45,489 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.08ms. Allocated memory is still 199.2MB. Free memory is still 164.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.80ms. Allocated memory is still 199.2MB. Free memory was 147.7MB in the beginning and 172.0MB in the end (delta: -24.3MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.32ms. Allocated memory is still 199.2MB. Free memory was 172.0MB in the beginning and 170.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.45ms. Allocated memory is still 199.2MB. Free memory was 170.6MB in the beginning and 159.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9573.92ms. Allocated memory was 199.2MB in the beginning and 684.7MB in the end (delta: 485.5MB). Free memory was 159.1MB in the beginning and 516.6MB in the end (delta: -357.5MB). Peak memory consumption was 396.5MB. 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: 107]: 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, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1224 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1224 mSDsluCounter, 1008 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 894 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=15, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 1162 NumberOfFragments, 4131 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 33 FomulaSimplificationsInter, 38507 FormulaSimplificationTreeSizeReductionInter, 4.8s 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: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-01-31 22:22:45,539 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...