/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-24 04:29:41,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 04:29:41,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 04:29:41,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 04:29:41,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 04:29:41,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 04:29:41,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 04:29:41,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 04:29:41,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 04:29:41,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 04:29:41,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 04:29:41,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 04:29:41,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 04:29:41,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 04:29:41,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 04:29:41,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 04:29:41,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 04:29:41,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 04:29:41,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 04:29:41,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 04:29:41,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 04:29:41,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 04:29:41,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 04:29:41,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 04:29:41,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 04:29:41,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 04:29:41,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 04:29:41,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 04:29:41,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 04:29:41,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 04:29:41,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 04:29:41,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 04:29:41,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 04:29:41,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 04:29:41,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 04:29:41,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 04:29:41,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 04:29:41,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 04:29:41,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 04:29:41,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 04:29:41,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 04:29:41,978 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-02-24 04:29:41,985 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 04:29:41,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 04:29:41,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 04:29:41,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 04:29:41,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 04:29:41,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 04:29:41,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 04:29:41,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 04:29:41,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 04:29:41,987 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 04:29:41,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 04:29:41,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 04:29:41,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 04:29:41,987 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-24 04:29:41,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 04:29:41,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 04:29:41,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 04:29:41,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-24 04:29:41,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 04:29:41,988 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-02-24 04:29:41,988 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-24 04:29:42,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 04:29:42,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 04:29:42,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 04:29:42,183 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 04:29:42,184 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 04:29:42,184 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-02-24 04:29:42,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228981690/02dc7ab17fc3488c978d564bc3b4ce3e/FLAG340f9a390 [2022-02-24 04:29:42,529 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 04:29:42,530 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2022-02-24 04:29:42,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228981690/02dc7ab17fc3488c978d564bc3b4ce3e/FLAG340f9a390 [2022-02-24 04:29:42,959 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228981690/02dc7ab17fc3488c978d564bc3b4ce3e [2022-02-24 04:29:42,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 04:29:42,962 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-24 04:29:42,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 04:29:42,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 04:29:42,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 04:29:42,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 04:29:42" (1/1) ... [2022-02-24 04:29:42,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b873e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:29:42, skipping insertion in model container [2022-02-24 04:29:42,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 04:29:42" (1/1) ... [2022-02-24 04:29:42,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 04:29:42,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 04:29:43,158 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-02-24 04:29:43,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 04:29:43,165 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 04:29:43,189 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-02-24 04:29:43,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 04:29:43,201 INFO L208 MainTranslator]: Completed translation [2022-02-24 04:29:43,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:29:43 WrapperNode [2022-02-24 04:29:43,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 04:29:43,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 04:29:43,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 04:29:43,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 04:29:43,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:29:43" (1/1) ... [2022-02-24 04:29:43,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:29:43" (1/1) ... [2022-02-24 04:29:43,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:29:43" (1/1) ... [2022-02-24 04:29:43,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:29:43" (1/1) ... [2022-02-24 04:29:43,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:29:43" (1/1) ... [2022-02-24 04:29:43,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:29:43" (1/1) ... [2022-02-24 04:29:43,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:29:43" (1/1) ... [2022-02-24 04:29:43,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 04:29:43,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 04:29:43,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 04:29:43,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 04:29:43,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:29:43" (1/1) ... [2022-02-24 04:29:43,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 04:29:43,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 04:29:43,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-24 04:29:43,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-24 04:29:43,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 04:29:43,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 04:29:43,302 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 04:29:43,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 04:29:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 04:29:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 04:29:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 04:29:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 04:29:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-24 04:29:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 04:29:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 04:29:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 04:29:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 04:29:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 04:29:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 04:29:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 04:29:43,355 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 04:29:43,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 04:29:43,491 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 04:29:43,496 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 04:29:43,496 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-24 04:29:43,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 04:29:43 BoogieIcfgContainer [2022-02-24 04:29:43,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 04:29:43,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 04:29:43,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 04:29:43,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 04:29:43,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 04:29:42" (1/3) ... [2022-02-24 04:29:43,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb2ff13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 04:29:43, skipping insertion in model container [2022-02-24 04:29:43,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:29:43" (2/3) ... [2022-02-24 04:29:43,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb2ff13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 04:29:43, skipping insertion in model container [2022-02-24 04:29:43,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 04:29:43" (3/3) ... [2022-02-24 04:29:43,515 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2022-02-24 04:29:43,519 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-24 04:29:43,519 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-24 04:29:43,550 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 04:29:43,556 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=QVASR [2022-02-24 04:29:43,556 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-24 04:29:43,575 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-02-24 04:29:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-24 04:29:43,580 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:43,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:43,580 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:43,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 1 times [2022-02-24 04:29:43,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:43,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2120202768] [2022-02-24 04:29:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:43,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:43,636 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:43,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:43,811 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:43,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2120202768] [2022-02-24 04:29:43,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2120202768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:43,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:43,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:43,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028269995] [2022-02-24 04:29:43,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:43,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:43,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:43,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:43,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:43,845 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-02-24 04:29:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:43,978 INFO L93 Difference]: Finished difference Result 64 states and 103 transitions. [2022-02-24 04:29:43,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:43,981 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-02-24 04:29:43,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:43,993 INFO L225 Difference]: With dead ends: 64 [2022-02-24 04:29:43,993 INFO L226 Difference]: Without dead ends: 49 [2022-02-24 04:29:43,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:43,999 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-02-24 04:29:44,000 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-02-24 04:29:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-24 04:29:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-02-24 04:29:44,030 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-02-24 04:29:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2022-02-24 04:29:44,033 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2022-02-24 04:29:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:44,034 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2022-02-24 04:29:44,034 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-02-24 04:29:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2022-02-24 04:29:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-24 04:29:44,035 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:44,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:44,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 04:29:44,036 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:44,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 1 times [2022-02-24 04:29:44,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:44,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1249534060] [2022-02-24 04:29:44,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:44,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:44,041 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:44,099 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:44,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1249534060] [2022-02-24 04:29:44,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1249534060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:44,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:44,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:44,100 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40037817] [2022-02-24 04:29:44,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:44,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:44,100 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:44,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:44,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:44,101 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-02-24 04:29:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:44,182 INFO L93 Difference]: Finished difference Result 78 states and 133 transitions. [2022-02-24 04:29:44,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:44,183 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-02-24 04:29:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:44,184 INFO L225 Difference]: With dead ends: 78 [2022-02-24 04:29:44,184 INFO L226 Difference]: Without dead ends: 49 [2022-02-24 04:29:44,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:44,190 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-02-24 04:29:44,190 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-02-24 04:29:44,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-24 04:29:44,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-02-24 04:29:44,201 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-02-24 04:29:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-02-24 04:29:44,202 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 17 [2022-02-24 04:29:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:44,202 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-02-24 04:29:44,202 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-02-24 04:29:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-02-24 04:29:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-24 04:29:44,203 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:44,203 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:44,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 04:29:44,204 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:44,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:44,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 1 times [2022-02-24 04:29:44,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:44,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2057985612] [2022-02-24 04:29:44,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:44,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:44,209 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:44,272 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:44,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2057985612] [2022-02-24 04:29:44,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2057985612] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:44,273 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:44,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:44,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175789296] [2022-02-24 04:29:44,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:44,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:44,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:44,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:44,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:44,275 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-02-24 04:29:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:44,336 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-02-24 04:29:44,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:44,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-24 04:29:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:44,338 INFO L225 Difference]: With dead ends: 73 [2022-02-24 04:29:44,338 INFO L226 Difference]: Without dead ends: 52 [2022-02-24 04:29:44,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:44,343 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-02-24 04:29:44,344 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-02-24 04:29:44,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-24 04:29:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-02-24 04:29:44,356 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-02-24 04:29:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-02-24 04:29:44,357 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 18 [2022-02-24 04:29:44,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:44,357 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-02-24 04:29:44,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-02-24 04:29:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-24 04:29:44,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:44,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:44,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 04:29:44,359 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:44,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 1 times [2022-02-24 04:29:44,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:44,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2068891500] [2022-02-24 04:29:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:44,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:44,361 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:44,401 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:44,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2068891500] [2022-02-24 04:29:44,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2068891500] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:44,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:44,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:44,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653825120] [2022-02-24 04:29:44,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:44,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:44,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:44,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:44,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:44,403 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-02-24 04:29:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:44,464 INFO L93 Difference]: Finished difference Result 130 states and 216 transitions. [2022-02-24 04:29:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:44,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-24 04:29:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:44,466 INFO L225 Difference]: With dead ends: 130 [2022-02-24 04:29:44,466 INFO L226 Difference]: Without dead ends: 89 [2022-02-24 04:29:44,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:44,467 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-02-24 04:29:44,467 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-02-24 04:29:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-24 04:29:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-02-24 04:29:44,477 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-02-24 04:29:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2022-02-24 04:29:44,478 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 18 [2022-02-24 04:29:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:44,478 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2022-02-24 04:29:44,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2022-02-24 04:29:44,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-24 04:29:44,479 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:44,479 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:44,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 04:29:44,479 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:44,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:44,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 1 times [2022-02-24 04:29:44,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:44,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1537306135] [2022-02-24 04:29:44,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:44,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:44,481 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:44,528 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:44,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1537306135] [2022-02-24 04:29:44,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1537306135] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:44,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:44,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:44,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34093218] [2022-02-24 04:29:44,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:44,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:44,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:44,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:44,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:44,530 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-02-24 04:29:44,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:44,586 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2022-02-24 04:29:44,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:44,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-24 04:29:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:44,589 INFO L225 Difference]: With dead ends: 111 [2022-02-24 04:29:44,589 INFO L226 Difference]: Without dead ends: 109 [2022-02-24 04:29:44,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:44,590 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-02-24 04:29:44,591 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-02-24 04:29:44,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-24 04:29:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2022-02-24 04:29:44,619 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-02-24 04:29:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2022-02-24 04:29:44,620 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 18 [2022-02-24 04:29:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:44,620 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2022-02-24 04:29:44,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2022-02-24 04:29:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-24 04:29:44,621 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:44,621 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:44,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 04:29:44,621 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:44,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:44,622 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 1 times [2022-02-24 04:29:44,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:44,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1636812181] [2022-02-24 04:29:44,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:44,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:44,623 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:44,669 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:44,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1636812181] [2022-02-24 04:29:44,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1636812181] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:44,669 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:44,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:44,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605549966] [2022-02-24 04:29:44,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:44,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:44,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:44,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:44,670 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-02-24 04:29:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:44,730 INFO L93 Difference]: Finished difference Result 155 states and 251 transitions. [2022-02-24 04:29:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:44,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-24 04:29:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:44,732 INFO L225 Difference]: With dead ends: 155 [2022-02-24 04:29:44,732 INFO L226 Difference]: Without dead ends: 153 [2022-02-24 04:29:44,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-02-24 04:29:44,734 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-02-24 04:29:44,736 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-02-24 04:29:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-02-24 04:29:44,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2022-02-24 04:29:44,753 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-02-24 04:29:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2022-02-24 04:29:44,757 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 19 [2022-02-24 04:29:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:44,757 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2022-02-24 04:29:44,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2022-02-24 04:29:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-24 04:29:44,762 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:44,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:44,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-24 04:29:44,763 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:44,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:44,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 1 times [2022-02-24 04:29:44,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:44,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1001080610] [2022-02-24 04:29:44,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:44,765 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:44,813 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:44,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1001080610] [2022-02-24 04:29:44,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1001080610] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:44,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:44,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:44,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963869527] [2022-02-24 04:29:44,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:44,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:44,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:44,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:44,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:44,815 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-02-24 04:29:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:44,872 INFO L93 Difference]: Finished difference Result 271 states and 435 transitions. [2022-02-24 04:29:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:44,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-24 04:29:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:44,874 INFO L225 Difference]: With dead ends: 271 [2022-02-24 04:29:44,874 INFO L226 Difference]: Without dead ends: 161 [2022-02-24 04:29:44,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:44,875 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-02-24 04:29:44,875 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-02-24 04:29:44,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-02-24 04:29:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-02-24 04:29:44,884 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-02-24 04:29:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2022-02-24 04:29:44,885 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 19 [2022-02-24 04:29:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:44,885 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2022-02-24 04:29:44,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2022-02-24 04:29:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-24 04:29:44,886 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:44,886 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:44,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-24 04:29:44,886 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:44,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:44,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 1 times [2022-02-24 04:29:44,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:44,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1373517489] [2022-02-24 04:29:44,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:44,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:44,888 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:44,908 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:44,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1373517489] [2022-02-24 04:29:44,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1373517489] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:44,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:44,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:44,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258325327] [2022-02-24 04:29:44,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:44,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:44,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:44,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:44,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:44,909 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-02-24 04:29:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:44,964 INFO L93 Difference]: Finished difference Result 241 states and 373 transitions. [2022-02-24 04:29:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:44,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-24 04:29:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:44,967 INFO L225 Difference]: With dead ends: 241 [2022-02-24 04:29:44,968 INFO L226 Difference]: Without dead ends: 167 [2022-02-24 04:29:44,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:44,974 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-02-24 04:29:44,975 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-02-24 04:29:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-02-24 04:29:44,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-02-24 04:29:44,984 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-02-24 04:29:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2022-02-24 04:29:44,985 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 20 [2022-02-24 04:29:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:44,985 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2022-02-24 04:29:44,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2022-02-24 04:29:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-24 04:29:44,985 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:44,985 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:44,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-24 04:29:44,986 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:44,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:44,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 1 times [2022-02-24 04:29:44,986 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:44,986 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [649977658] [2022-02-24 04:29:44,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:44,988 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:45,025 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:45,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [649977658] [2022-02-24 04:29:45,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [649977658] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:45,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:45,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:45,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41156411] [2022-02-24 04:29:45,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:45,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:45,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:45,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:45,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:45,026 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-02-24 04:29:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:45,082 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2022-02-24 04:29:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:45,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-24 04:29:45,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:45,084 INFO L225 Difference]: With dead ends: 285 [2022-02-24 04:29:45,084 INFO L226 Difference]: Without dead ends: 283 [2022-02-24 04:29:45,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:45,085 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-02-24 04:29:45,086 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-02-24 04:29:45,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-02-24 04:29:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2022-02-24 04:29:45,099 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-02-24 04:29:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 347 transitions. [2022-02-24 04:29:45,100 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 347 transitions. Word has length 20 [2022-02-24 04:29:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:45,100 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 347 transitions. [2022-02-24 04:29:45,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 347 transitions. [2022-02-24 04:29:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-24 04:29:45,101 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:45,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:45,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-24 04:29:45,101 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:45,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:45,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 1 times [2022-02-24 04:29:45,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:45,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1070711754] [2022-02-24 04:29:45,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:45,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:45,103 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:45,141 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:45,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1070711754] [2022-02-24 04:29:45,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1070711754] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:45,142 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:45,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:45,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655654192] [2022-02-24 04:29:45,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:45,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:45,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:45,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:45,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:45,143 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-02-24 04:29:45,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:45,210 INFO L93 Difference]: Finished difference Result 525 states and 781 transitions. [2022-02-24 04:29:45,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:45,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-24 04:29:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:45,212 INFO L225 Difference]: With dead ends: 525 [2022-02-24 04:29:45,212 INFO L226 Difference]: Without dead ends: 307 [2022-02-24 04:29:45,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:45,213 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-02-24 04:29:45,213 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-02-24 04:29:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-02-24 04:29:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-02-24 04:29:45,228 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-02-24 04:29:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 439 transitions. [2022-02-24 04:29:45,229 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 439 transitions. Word has length 20 [2022-02-24 04:29:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:45,229 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 439 transitions. [2022-02-24 04:29:45,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 439 transitions. [2022-02-24 04:29:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-24 04:29:45,230 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:45,230 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:45,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-24 04:29:45,231 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:45,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:45,231 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 1 times [2022-02-24 04:29:45,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:45,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807604373] [2022-02-24 04:29:45,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:45,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:45,232 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:45,260 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:45,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807604373] [2022-02-24 04:29:45,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [807604373] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:45,260 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:45,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:45,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788847739] [2022-02-24 04:29:45,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:45,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:45,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:45,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:45,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:45,261 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-02-24 04:29:45,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:45,310 INFO L93 Difference]: Finished difference Result 457 states and 653 transitions. [2022-02-24 04:29:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:45,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-24 04:29:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:45,311 INFO L225 Difference]: With dead ends: 457 [2022-02-24 04:29:45,311 INFO L226 Difference]: Without dead ends: 315 [2022-02-24 04:29:45,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:45,312 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-02-24 04:29:45,312 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-02-24 04:29:45,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-02-24 04:29:45,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2022-02-24 04:29:45,329 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-02-24 04:29:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 439 transitions. [2022-02-24 04:29:45,330 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 439 transitions. Word has length 21 [2022-02-24 04:29:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:45,330 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 439 transitions. [2022-02-24 04:29:45,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 439 transitions. [2022-02-24 04:29:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-24 04:29:45,331 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:45,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:45,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-24 04:29:45,331 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:45,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 1 times [2022-02-24 04:29:45,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:45,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2120558405] [2022-02-24 04:29:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:45,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:45,333 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:45,360 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:45,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2120558405] [2022-02-24 04:29:45,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2120558405] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:45,361 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:45,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:45,361 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910388291] [2022-02-24 04:29:45,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:45,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:45,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:45,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:45,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:45,362 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-02-24 04:29:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:45,429 INFO L93 Difference]: Finished difference Result 525 states and 737 transitions. [2022-02-24 04:29:45,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:45,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-24 04:29:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:45,431 INFO L225 Difference]: With dead ends: 525 [2022-02-24 04:29:45,431 INFO L226 Difference]: Without dead ends: 523 [2022-02-24 04:29:45,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:45,432 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-02-24 04:29:45,432 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-02-24 04:29:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-02-24 04:29:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 457. [2022-02-24 04:29:45,459 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-02-24 04:29:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 623 transitions. [2022-02-24 04:29:45,460 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 623 transitions. Word has length 21 [2022-02-24 04:29:45,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:45,461 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 623 transitions. [2022-02-24 04:29:45,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 623 transitions. [2022-02-24 04:29:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-24 04:29:45,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:45,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:45,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-24 04:29:45,462 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:45,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 1 times [2022-02-24 04:29:45,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:45,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [256831453] [2022-02-24 04:29:45,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:45,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:45,465 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:45,493 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:45,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [256831453] [2022-02-24 04:29:45,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [256831453] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:45,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:45,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:45,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303841161] [2022-02-24 04:29:45,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:45,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:45,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:45,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:45,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:45,494 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-02-24 04:29:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:45,584 INFO L93 Difference]: Finished difference Result 1021 states and 1377 transitions. [2022-02-24 04:29:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:45,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-24 04:29:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:45,586 INFO L225 Difference]: With dead ends: 1021 [2022-02-24 04:29:45,586 INFO L226 Difference]: Without dead ends: 587 [2022-02-24 04:29:45,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:45,587 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-02-24 04:29:45,587 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-02-24 04:29:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-02-24 04:29:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-02-24 04:29:45,618 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-02-24 04:29:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 759 transitions. [2022-02-24 04:29:45,619 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 759 transitions. Word has length 21 [2022-02-24 04:29:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:45,620 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 759 transitions. [2022-02-24 04:29:45,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 759 transitions. [2022-02-24 04:29:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-24 04:29:45,621 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:45,621 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:45,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-24 04:29:45,621 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:45,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:45,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 1 times [2022-02-24 04:29:45,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:45,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1045352918] [2022-02-24 04:29:45,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:45,623 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:45,640 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:45,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1045352918] [2022-02-24 04:29:45,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1045352918] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:45,641 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:45,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:45,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420763864] [2022-02-24 04:29:45,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:45,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:45,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:45,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:45,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:45,642 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-02-24 04:29:45,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:45,709 INFO L93 Difference]: Finished difference Result 877 states and 1129 transitions. [2022-02-24 04:29:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:45,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-24 04:29:45,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:45,711 INFO L225 Difference]: With dead ends: 877 [2022-02-24 04:29:45,711 INFO L226 Difference]: Without dead ends: 603 [2022-02-24 04:29:45,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:45,712 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-02-24 04:29:45,712 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-02-24 04:29:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-02-24 04:29:45,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-02-24 04:29:45,744 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-02-24 04:29:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 759 transitions. [2022-02-24 04:29:45,745 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 759 transitions. Word has length 22 [2022-02-24 04:29:45,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:45,745 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 759 transitions. [2022-02-24 04:29:45,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 759 transitions. [2022-02-24 04:29:45,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-24 04:29:45,746 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:45,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:45,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-24 04:29:45,747 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:45,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:45,747 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 1 times [2022-02-24 04:29:45,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:45,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1957313551] [2022-02-24 04:29:45,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:45,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:45,748 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:45,766 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:45,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1957313551] [2022-02-24 04:29:45,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1957313551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:45,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:45,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:45,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583510974] [2022-02-24 04:29:45,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:45,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:45,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:45,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:45,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:45,767 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-02-24 04:29:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:45,867 INFO L93 Difference]: Finished difference Result 971 states and 1208 transitions. [2022-02-24 04:29:45,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:45,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-24 04:29:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:45,870 INFO L225 Difference]: With dead ends: 971 [2022-02-24 04:29:45,870 INFO L226 Difference]: Without dead ends: 969 [2022-02-24 04:29:45,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:45,871 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-02-24 04:29:45,871 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-02-24 04:29:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-02-24 04:29:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 905. [2022-02-24 04:29:45,922 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-02-24 04:29:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1111 transitions. [2022-02-24 04:29:45,924 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1111 transitions. Word has length 22 [2022-02-24 04:29:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:45,924 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 1111 transitions. [2022-02-24 04:29:45,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1111 transitions. [2022-02-24 04:29:45,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-24 04:29:45,926 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:29:45,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:45,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-24 04:29:45,926 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:29:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:29:45,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 1 times [2022-02-24 04:29:45,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:29:45,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [609455535] [2022-02-24 04:29:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:29:45,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:29:45,928 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:29:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:29:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:29:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:29:45,952 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:29:45,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [609455535] [2022-02-24 04:29:45,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [609455535] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:29:45,952 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:29:45,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:29:45,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873358761] [2022-02-24 04:29:45,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:29:45,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:29:45,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:29:45,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:29:45,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:29:45,953 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-02-24 04:29:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:29:46,047 INFO L93 Difference]: Finished difference Result 1993 states and 2391 transitions. [2022-02-24 04:29:46,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:29:46,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-24 04:29:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:29:46,048 INFO L225 Difference]: With dead ends: 1993 [2022-02-24 04:29:46,048 INFO L226 Difference]: Without dead ends: 0 [2022-02-24 04:29:46,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:29:46,070 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-02-24 04:29:46,070 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-02-24 04:29:46,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-24 04:29:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-24 04:29:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-24 04:29:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-24 04:29:46,071 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-02-24 04:29:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:29:46,071 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-24 04:29:46,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 04:29:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-24 04:29:46,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-24 04:29:46,073 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-24 04:29:46,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-24 04:29:46,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-24 04:29:54,570 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-02-24 04:29:54,570 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-02-24 04:29:54,570 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-02-24 04:29:54,571 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-24 04:29:54,571 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-24 04:29:54,571 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-24 04:29:54,571 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-24 04:29:54,571 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-24 04:29:54,571 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-24 04:29:54,571 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-24 04:29:54,572 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-02-24 04:29:54,572 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2022-02-24 04:29:54,572 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-02-24 04:29:54,572 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-02-24 04:29:54,573 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-02-24 04:29:54,573 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-02-24 04:29:54,573 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-02-24 04:29:54,573 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2022-02-24 04:29:54,573 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) the Hoare annotation is: false [2022-02-24 04:29:54,573 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2022-02-24 04:29:54,573 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-02-24 04:29:54,573 INFO L861 garLoopResultBuilder]: At program point L105(lines 7 109) the Hoare annotation is: true [2022-02-24 04:29:54,573 INFO L861 garLoopResultBuilder]: At program point L31(lines 31 33) the Hoare annotation is: true [2022-02-24 04:29:54,574 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-02-24 04:29:54,574 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-02-24 04:29:54,574 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-02-24 04:29:54,574 INFO L861 garLoopResultBuilder]: At program point L48(lines 48 50) the Hoare annotation is: true [2022-02-24 04:29:54,574 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-02-24 04:29:54,575 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-02-24 04:29:54,575 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-02-24 04:29:54,575 INFO L861 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2022-02-24 04:29:54,575 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-02-24 04:29:54,575 INFO L854 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2022-02-24 04:29:54,575 INFO L854 garLoopResultBuilder]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2022-02-24 04:29:54,575 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-02-24 04:29:54,575 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-02-24 04:29:54,578 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:29:54,579 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-24 04:29:54,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 04:29:54 BoogieIcfgContainer [2022-02-24 04:29:54,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-24 04:29:54,585 INFO L158 Benchmark]: Toolchain (without parser) took 11623.36ms. Allocated memory was 192.9MB in the beginning and 658.5MB in the end (delta: 465.6MB). Free memory was 144.5MB in the beginning and 365.4MB in the end (delta: -220.9MB). Peak memory consumption was 375.0MB. Max. memory is 8.0GB. [2022-02-24 04:29:54,585 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 04:29:54,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.62ms. Allocated memory is still 192.9MB. Free memory was 144.3MB in the beginning and 169.0MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-24 04:29:54,585 INFO L158 Benchmark]: Boogie Preprocessor took 38.46ms. Allocated memory is still 192.9MB. Free memory was 169.0MB in the beginning and 167.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-24 04:29:54,586 INFO L158 Benchmark]: RCFGBuilder took 255.95ms. Allocated memory is still 192.9MB. Free memory was 167.4MB in the beginning and 156.5MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-24 04:29:54,586 INFO L158 Benchmark]: TraceAbstraction took 11086.57ms. Allocated memory was 192.9MB in the beginning and 658.5MB in the end (delta: 465.6MB). Free memory was 156.1MB in the beginning and 365.4MB in the end (delta: -209.4MB). Peak memory consumption was 387.1MB. Max. memory is 8.0GB. [2022-02-24 04:29:54,587 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.09ms. Allocated memory is still 192.9MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.62ms. Allocated memory is still 192.9MB. Free memory was 144.3MB in the beginning and 169.0MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.46ms. Allocated memory is still 192.9MB. Free memory was 169.0MB in the beginning and 167.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.95ms. Allocated memory is still 192.9MB. Free memory was 167.4MB in the beginning and 156.5MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11086.57ms. Allocated memory was 192.9MB in the beginning and 658.5MB in the end (delta: 465.6MB). Free memory was 156.1MB in the beginning and 365.4MB in the end (delta: -209.4MB). Peak memory consumption was 387.1MB. 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: 11.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1224 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1224 mSDsluCounter, 1008 SdHoareTripleChecker+Invalid, 0.5s 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.8s HoareSimplificationTime, 33 FomulaSimplificationsInter, 38507 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 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-02-24 04:29:54,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...