/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:41:12,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:41:12,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 20:41:12,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:41:12,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:41:12,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:41:12,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:41:12,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:41:12,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:41:12,988 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:41:13,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:41:13,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:41:13,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:41:13,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:41:13,005 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:41:13,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:41:13,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:41:13,006 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:41:13,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:41:13,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:41:13,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:41:13,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:41:13,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:41:13,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:41:13,008 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:41:13,008 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:41:13,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:41:13,008 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:41:13,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:41:13,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:41:13,009 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:41:13,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:41:13,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:41:13,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:41:13,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:41:13,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:41:13,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:41:13,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:41:13,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:41:13,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:41:13,011 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:41:13,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:41:13,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:41:13,011 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 20:41:13,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:41:13,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:41:13,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:41:13,219 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:41:13,219 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:41:13,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i [2023-12-15 20:41:14,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:41:14,435 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:41:14,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i [2023-12-15 20:41:14,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0bdc939e/1946d7937a964798801a6e33aa6c5edf/FLAGe38317550 [2023-12-15 20:41:14,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0bdc939e/1946d7937a964798801a6e33aa6c5edf [2023-12-15 20:41:14,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:41:14,455 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:41:14,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:41:14,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:41:14,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:41:14,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de26392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14, skipping insertion in model container [2023-12-15 20:41:14,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,489 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:41:14,577 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i[917,930] [2023-12-15 20:41:14,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:41:14,607 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:41:14,615 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i[917,930] [2023-12-15 20:41:14,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:41:14,654 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:41:14,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14 WrapperNode [2023-12-15 20:41:14,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:41:14,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:41:14,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:41:14,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:41:14,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,685 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2023-12-15 20:41:14,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:41:14,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:41:14,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:41:14,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:41:14,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,710 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:41:14,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:41:14,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:41:14,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:41:14,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:41:14,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14" (1/1) ... [2023-12-15 20:41:14,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:41:14,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:41:14,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 20:41:14,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 20:41:14,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:41:14,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:41:14,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:41:14,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:41:14,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:41:14,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:41:14,930 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:41:14,932 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:41:15,173 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:41:15,213 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:41:15,213 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:41:15,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:41:15 BoogieIcfgContainer [2023-12-15 20:41:15,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:41:15,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:41:15,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:41:15,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:41:15,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:41:14" (1/3) ... [2023-12-15 20:41:15,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f0303d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:41:15, skipping insertion in model container [2023-12-15 20:41:15,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:41:14" (2/3) ... [2023-12-15 20:41:15,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f0303d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:41:15, skipping insertion in model container [2023-12-15 20:41:15,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:41:15" (3/3) ... [2023-12-15 20:41:15,229 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-90.i [2023-12-15 20:41:15,242 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:41:15,266 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:41:15,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:41:15,307 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f611bf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:41:15,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:41:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 20:41:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 20:41:15,318 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:41:15,318 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:41:15,319 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:41:15,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:41:15,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1356584365, now seen corresponding path program 1 times [2023-12-15 20:41:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:41:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304009783] [2023-12-15 20:41:15,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:41:15,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:41:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:41:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:41:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:41:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:41:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:41:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:41:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:41:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:41:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:41:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:41:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:41:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:41:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:41:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:41:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:41:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:41:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:41:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:41:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:41:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:41:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 20:41:15,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:41:15,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304009783] [2023-12-15 20:41:15,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304009783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:41:15,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:41:15,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:41:15,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059611213] [2023-12-15 20:41:15,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:41:15,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:41:15,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:41:15,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:41:15,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:41:15,694 INFO L87 Difference]: Start difference. First operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 20:41:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:41:15,744 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2023-12-15 20:41:15,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:41:15,746 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 120 [2023-12-15 20:41:15,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:41:15,751 INFO L225 Difference]: With dead ends: 99 [2023-12-15 20:41:15,751 INFO L226 Difference]: Without dead ends: 49 [2023-12-15 20:41:15,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:41:15,755 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:41:15,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:41:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-15 20:41:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-15 20:41:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 20:41:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2023-12-15 20:41:15,795 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 120 [2023-12-15 20:41:15,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:41:15,796 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2023-12-15 20:41:15,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 20:41:15,796 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2023-12-15 20:41:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 20:41:15,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:41:15,799 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:41:15,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:41:15,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:41:15,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:41:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash -997376595, now seen corresponding path program 1 times [2023-12-15 20:41:15,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:41:15,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931133904] [2023-12-15 20:41:15,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:41:15,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:41:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:41:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:41:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:41:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:41:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:41:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:41:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:41:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:41:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:41:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:41:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:41:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:41:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:41:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:41:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:41:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:41:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:41:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:41:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:41:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:41:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:19,510 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 20:41:19,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:41:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931133904] [2023-12-15 20:41:19,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931133904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:41:19,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:41:19,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:41:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864601547] [2023-12-15 20:41:19,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:41:19,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:41:19,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:41:19,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:41:19,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:41:19,512 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:41:20,003 INFO L93 Difference]: Finished difference Result 95 states and 132 transitions. [2023-12-15 20:41:20,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 20:41:20,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-12-15 20:41:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:41:20,005 INFO L225 Difference]: With dead ends: 95 [2023-12-15 20:41:20,005 INFO L226 Difference]: Without dead ends: 93 [2023-12-15 20:41:20,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-15 20:41:20,006 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 87 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:41:20,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 304 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:41:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-15 20:41:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2023-12-15 20:41:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-15 20:41:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2023-12-15 20:41:20,022 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 120 [2023-12-15 20:41:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:41:20,022 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2023-12-15 20:41:20,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2023-12-15 20:41:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 20:41:20,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:41:20,024 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:41:20,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:41:20,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:41:20,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:41:20,025 INFO L85 PathProgramCache]: Analyzing trace with hash -997317013, now seen corresponding path program 1 times [2023-12-15 20:41:20,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:41:20,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265718827] [2023-12-15 20:41:20,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:41:20,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:41:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:41:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:41:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:41:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:41:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:41:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:41:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:41:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:41:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:41:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:41:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:41:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:41:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:41:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:41:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:41:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:41:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:41:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:41:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:41:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:41:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 20:41:21,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:41:21,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265718827] [2023-12-15 20:41:21,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265718827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:41:21,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:41:21,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:41:21,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558432593] [2023-12-15 20:41:21,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:41:21,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:41:21,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:41:21,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:41:21,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:41:21,216 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:41:21,742 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2023-12-15 20:41:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 20:41:21,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-12-15 20:41:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:41:21,745 INFO L225 Difference]: With dead ends: 93 [2023-12-15 20:41:21,745 INFO L226 Difference]: Without dead ends: 91 [2023-12-15 20:41:21,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-15 20:41:21,748 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 84 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:41:21,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 311 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:41:21,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-15 20:41:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2023-12-15 20:41:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-15 20:41:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2023-12-15 20:41:21,772 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 120 [2023-12-15 20:41:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:41:21,773 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2023-12-15 20:41:21,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:21,774 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2023-12-15 20:41:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 20:41:21,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:41:21,780 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:41:21,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:41:21,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:41:21,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:41:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1054634897, now seen corresponding path program 1 times [2023-12-15 20:41:21,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:41:21,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611109487] [2023-12-15 20:41:21,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:41:21,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:41:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:41:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:41:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:41:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:41:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:41:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:41:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:41:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:41:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:41:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:41:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:41:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:41:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:41:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:41:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:41:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:41:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:41:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:41:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:41:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:41:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 20:41:23,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:41:23,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611109487] [2023-12-15 20:41:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611109487] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:41:23,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:41:23,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:41:23,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102276865] [2023-12-15 20:41:23,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:41:23,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:41:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:41:23,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:41:23,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:41:23,805 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:41:24,266 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2023-12-15 20:41:24,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 20:41:24,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-12-15 20:41:24,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:41:24,269 INFO L225 Difference]: With dead ends: 123 [2023-12-15 20:41:24,269 INFO L226 Difference]: Without dead ends: 121 [2023-12-15 20:41:24,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:41:24,270 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 90 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:41:24,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 247 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:41:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-15 20:41:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2023-12-15 20:41:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-15 20:41:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2023-12-15 20:41:24,287 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 120 [2023-12-15 20:41:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:41:24,288 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2023-12-15 20:41:24,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2023-12-15 20:41:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 20:41:24,289 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:41:24,289 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:41:24,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:41:24,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:41:24,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:41:24,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1054575315, now seen corresponding path program 1 times [2023-12-15 20:41:24,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:41:24,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492313704] [2023-12-15 20:41:24,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:41:24,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:41:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:41:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:41:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:41:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:41:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:41:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:41:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:41:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:41:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:41:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:41:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:41:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:41:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:41:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:41:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:41:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:41:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:41:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:41:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:41:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:41:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 20:41:25,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:41:25,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492313704] [2023-12-15 20:41:25,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492313704] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:41:25,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:41:25,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:41:25,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628040737] [2023-12-15 20:41:25,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:41:25,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:41:25,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:41:25,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:41:25,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:41:25,323 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:41:25,723 INFO L93 Difference]: Finished difference Result 115 states and 159 transitions. [2023-12-15 20:41:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 20:41:25,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-12-15 20:41:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:41:25,725 INFO L225 Difference]: With dead ends: 115 [2023-12-15 20:41:25,725 INFO L226 Difference]: Without dead ends: 113 [2023-12-15 20:41:25,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-15 20:41:25,726 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 84 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:41:25,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 280 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:41:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-15 20:41:25,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2023-12-15 20:41:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 60 states have internal predecessors, (69), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-15 20:41:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2023-12-15 20:41:25,742 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 120 [2023-12-15 20:41:25,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:41:25,742 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2023-12-15 20:41:25,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2023-12-15 20:41:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 20:41:25,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:41:25,743 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:41:25,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 20:41:25,744 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:41:25,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:41:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1148591013, now seen corresponding path program 1 times [2023-12-15 20:41:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:41:25,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777668769] [2023-12-15 20:41:25,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:41:25,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:41:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:41:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:41:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:41:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:41:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:41:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:41:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:41:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:41:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:41:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:41:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:41:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:41:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:41:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:41:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:41:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:41:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:41:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:41:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:41:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:41:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 20:41:27,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:41:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777668769] [2023-12-15 20:41:27,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777668769] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:41:27,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:41:27,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:41:27,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052165779] [2023-12-15 20:41:27,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:41:27,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:41:27,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:41:27,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:41:27,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:41:27,963 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:28,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:41:28,874 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2023-12-15 20:41:28,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 20:41:28,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-15 20:41:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:41:28,876 INFO L225 Difference]: With dead ends: 148 [2023-12-15 20:41:28,876 INFO L226 Difference]: Without dead ends: 146 [2023-12-15 20:41:28,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2023-12-15 20:41:28,876 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 120 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 20:41:28,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 331 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 20:41:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-15 20:41:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 65. [2023-12-15 20:41:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 20:41:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2023-12-15 20:41:28,886 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 121 [2023-12-15 20:41:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:41:28,887 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2023-12-15 20:41:28,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2023-12-15 20:41:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 20:41:28,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:41:28,887 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:41:28,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 20:41:28,888 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:41:28,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:41:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1091392293, now seen corresponding path program 1 times [2023-12-15 20:41:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:41:28,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708513312] [2023-12-15 20:41:28,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:41:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:41:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:41:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:41:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:41:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:41:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:41:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:41:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:41:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:41:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:41:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:41:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:41:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:41:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:41:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:41:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:41:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:41:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:41:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:41:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:41:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:41:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 20:41:30,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:41:30,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708513312] [2023-12-15 20:41:30,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708513312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:41:30,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:41:30,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:41:30,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675354928] [2023-12-15 20:41:30,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:41:30,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:41:30,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:41:30,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:41:30,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:41:30,062 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:41:30,893 INFO L93 Difference]: Finished difference Result 126 states and 171 transitions. [2023-12-15 20:41:30,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 20:41:30,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-15 20:41:30,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:41:30,894 INFO L225 Difference]: With dead ends: 126 [2023-12-15 20:41:30,894 INFO L226 Difference]: Without dead ends: 124 [2023-12-15 20:41:30,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2023-12-15 20:41:30,895 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 119 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 20:41:30,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 314 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 20:41:30,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-15 20:41:30,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 64. [2023-12-15 20:41:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 20:41:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2023-12-15 20:41:30,905 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 121 [2023-12-15 20:41:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:41:30,905 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2023-12-15 20:41:30,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2023-12-15 20:41:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 20:41:30,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:41:30,906 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:41:30,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 20:41:30,906 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:41:30,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:41:30,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1371368921, now seen corresponding path program 1 times [2023-12-15 20:41:30,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:41:30,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518923139] [2023-12-15 20:41:30,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:41:30,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:41:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:41:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:41:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:41:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:41:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:41:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:41:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:41:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:41:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:41:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:41:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:41:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:41:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:41:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:41:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:41:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:41:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:41:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:41:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:41:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:41:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 20:41:32,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:41:32,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518923139] [2023-12-15 20:41:32,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518923139] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:41:32,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:41:32,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:41:32,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900525656] [2023-12-15 20:41:32,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:41:32,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:41:32,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:41:32,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:41:32,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:41:32,625 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:41:33,118 INFO L93 Difference]: Finished difference Result 129 states and 174 transitions. [2023-12-15 20:41:33,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 20:41:33,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-15 20:41:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:41:33,119 INFO L225 Difference]: With dead ends: 129 [2023-12-15 20:41:33,119 INFO L226 Difference]: Without dead ends: 127 [2023-12-15 20:41:33,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-12-15 20:41:33,120 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 145 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:41:33,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 251 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:41:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-15 20:41:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 62. [2023-12-15 20:41:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 20:41:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2023-12-15 20:41:33,131 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 121 [2023-12-15 20:41:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:41:33,131 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2023-12-15 20:41:33,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2023-12-15 20:41:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 20:41:33,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:41:33,132 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:41:33,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 20:41:33,132 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:41:33,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:41:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1371309339, now seen corresponding path program 1 times [2023-12-15 20:41:33,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:41:33,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122906666] [2023-12-15 20:41:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:41:33,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:41:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:41:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:41:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:41:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:41:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:41:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:41:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:41:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:41:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:41:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:41:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:41:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:41:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:41:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:41:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:41:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:41:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:41:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:41:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:41:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:41:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 20:41:34,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:41:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122906666] [2023-12-15 20:41:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122906666] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:41:34,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:41:34,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:41:34,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947014414] [2023-12-15 20:41:34,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:41:34,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:41:34,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:41:34,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:41:34,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:41:34,251 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:34,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:41:34,663 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2023-12-15 20:41:34,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 20:41:34,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-15 20:41:34,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:41:34,664 INFO L225 Difference]: With dead ends: 125 [2023-12-15 20:41:34,664 INFO L226 Difference]: Without dead ends: 123 [2023-12-15 20:41:34,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-12-15 20:41:34,665 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 131 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:41:34,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 252 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:41:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-15 20:41:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 62. [2023-12-15 20:41:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 20:41:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2023-12-15 20:41:34,685 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 121 [2023-12-15 20:41:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:41:34,685 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2023-12-15 20:41:34,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2023-12-15 20:41:34,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 20:41:34,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:41:34,687 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:41:34,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 20:41:34,687 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:41:34,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:41:34,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1428567641, now seen corresponding path program 1 times [2023-12-15 20:41:34,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:41:34,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006034889] [2023-12-15 20:41:34,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:41:34,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:41:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:41:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:41:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:41:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:41:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:41:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:41:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:41:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:41:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:41:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:41:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:41:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:41:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:41:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:41:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:41:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:41:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:41:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:41:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:41:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:41:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:41:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 20:41:35,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:41:35,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006034889] [2023-12-15 20:41:35,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006034889] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:41:35,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:41:35,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:41:35,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126652573] [2023-12-15 20:41:35,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:41:35,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:41:35,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:41:35,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:41:35,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:41:35,802 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:41:36,365 INFO L93 Difference]: Finished difference Result 119 states and 163 transitions. [2023-12-15 20:41:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 20:41:36,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-15 20:41:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:41:36,366 INFO L225 Difference]: With dead ends: 119 [2023-12-15 20:41:36,366 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 20:41:36,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-12-15 20:41:36,367 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 104 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:41:36,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 321 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:41:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 20:41:36,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 20:41:36,367 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) [2023-12-15 20:41:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 20:41:36,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2023-12-15 20:41:36,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:41:36,368 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 20:41:36,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 20:41:36,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 20:41:36,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 20:41:36,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:41:36,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 20:41:36,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 20:41:37,217 INFO L902 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: true [2023-12-15 20:41:37,217 INFO L902 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: true [2023-12-15 20:41:37,217 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-12-15 20:41:37,217 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 20:41:37,217 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-15 20:41:37,218 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-15 20:41:37,218 INFO L902 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: true [2023-12-15 20:41:37,218 INFO L902 garLoopResultBuilder]: At program point L102-1(line 102) the Hoare annotation is: true [2023-12-15 20:41:37,218 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 71) no Hoare annotation was computed. [2023-12-15 20:41:37,218 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-12-15 20:41:37,218 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-15 20:41:37,218 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-15 20:41:37,218 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-12-15 20:41:37,218 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 42 72) no Hoare annotation was computed. [2023-12-15 20:41:37,218 INFO L899 garLoopResultBuilder]: For program point L103(lines 73 104) no Hoare annotation was computed. [2023-12-15 20:41:37,218 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-15 20:41:37,218 INFO L895 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-15 20:41:37,218 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-12-15 20:41:37,218 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-12-15 20:41:37,218 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 20:41:37,218 INFO L902 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: true [2023-12-15 20:41:37,218 INFO L902 garLoopResultBuilder]: At program point L96-1(line 96) the Hoare annotation is: true [2023-12-15 20:41:37,218 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2023-12-15 20:41:37,219 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-12-15 20:41:37,219 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-12-15 20:41:37,219 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-12-15 20:41:37,219 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-15 20:41:37,219 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-15 20:41:37,219 INFO L902 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: true [2023-12-15 20:41:37,219 INFO L902 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: true [2023-12-15 20:41:37,219 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-15 20:41:37,219 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-12-15 20:41:37,219 INFO L902 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: true [2023-12-15 20:41:37,219 INFO L902 garLoopResultBuilder]: At program point L99-1(line 99) the Hoare annotation is: true [2023-12-15 20:41:37,219 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 20:41:37,219 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-12-15 20:41:37,219 INFO L899 garLoopResultBuilder]: For program point L58(lines 42 72) no Hoare annotation was computed. [2023-12-15 20:41:37,219 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-15 20:41:37,219 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-15 20:41:37,219 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 72) no Hoare annotation was computed. [2023-12-15 20:41:37,219 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2023-12-15 20:41:37,219 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 61) no Hoare annotation was computed. [2023-12-15 20:41:37,220 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-15 20:41:37,220 INFO L895 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-15 20:41:37,220 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-15 20:41:37,220 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-12-15 20:41:37,220 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-12-15 20:41:37,220 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-15 20:41:37,220 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-15 20:41:37,220 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-15 20:41:37,220 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-15 20:41:37,223 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:41:37,225 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:41:37,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:41:37 BoogieIcfgContainer [2023-12-15 20:41:37,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:41:37,235 INFO L158 Benchmark]: Toolchain (without parser) took 22780.20ms. Allocated memory was 220.2MB in the beginning and 627.0MB in the end (delta: 406.8MB). Free memory was 175.1MB in the beginning and 459.3MB in the end (delta: -284.2MB). Peak memory consumption was 357.9MB. Max. memory is 8.0GB. [2023-12-15 20:41:37,235 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 220.2MB. Free memory is still 177.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:41:37,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.67ms. Allocated memory is still 220.2MB. Free memory was 174.7MB in the beginning and 162.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:41:37,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.50ms. Allocated memory is still 220.2MB. Free memory was 162.0MB in the beginning and 159.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 20:41:37,236 INFO L158 Benchmark]: Boogie Preprocessor took 41.41ms. Allocated memory is still 220.2MB. Free memory was 159.7MB in the beginning and 156.9MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:41:37,236 INFO L158 Benchmark]: RCFGBuilder took 473.39ms. Allocated memory is still 220.2MB. Free memory was 156.9MB in the beginning and 139.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 20:41:37,237 INFO L158 Benchmark]: TraceAbstraction took 22019.53ms. Allocated memory was 220.2MB in the beginning and 627.0MB in the end (delta: 406.8MB). Free memory was 138.4MB in the beginning and 459.3MB in the end (delta: -320.9MB). Peak memory consumption was 321.2MB. Max. memory is 8.0GB. [2023-12-15 20:41:37,238 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48ms. Allocated memory is still 220.2MB. Free memory is still 177.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.67ms. Allocated memory is still 220.2MB. Free memory was 174.7MB in the beginning and 162.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.50ms. Allocated memory is still 220.2MB. Free memory was 162.0MB in the beginning and 159.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.41ms. Allocated memory is still 220.2MB. Free memory was 159.7MB in the beginning and 156.9MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 473.39ms. Allocated memory is still 220.2MB. Free memory was 156.9MB in the beginning and 139.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 22019.53ms. Allocated memory was 220.2MB in the beginning and 627.0MB in the end (delta: 406.8MB). Free memory was 138.4MB in the beginning and 459.3MB in the end (delta: -320.9MB). Peak memory consumption was 321.2MB. 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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 964 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 2683 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1748 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1719 IncrementalHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 935 mSDtfsCounter, 1719 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=4, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 313 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 79 PreInvPairs, 122 NumberOfFragments, 176 HoareAnnotationTreeSize, 79 FormulaSimplifications, 21337882 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 22 FormulaSimplificationsInter, 39099 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1195 ConstructedInterpolants, 0 QuantifiedInterpolants, 9268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 7600/7600 InterpolantCoveringCapability, 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: 117]: Loop Invariant Derived loop invariant: ((var_1_8 + ((var_1_6 / 4294967296) * 4294967296)) == (((var_1_8 / 4294967296) * 4294967296) + var_1_6)) RESULT: Ultimate proved your program to be correct! [2023-12-15 20:41:37,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...