./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3713b25a83a921fe666aac85c13dc353e68d0c4544ef354673bb4c8722689bd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:31:08,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:31:08,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:31:08,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:31:08,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:31:08,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:31:08,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:31:08,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:31:08,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:31:08,207 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:31:08,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:31:08,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:31:08,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:31:08,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:31:08,210 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:31:08,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:31:08,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:31:08,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:31:08,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:31:08,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:31:08,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:31:08,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:31:08,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:31:08,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:31:08,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:31:08,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:31:08,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:31:08,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:31:08,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:31:08,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:31:08,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:31:08,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:31:08,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:31:08,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:31:08,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:31:08,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:31:08,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:31:08,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:31:08,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:31:08,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:31:08,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:31:08,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:31:08,222 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3713b25a83a921fe666aac85c13dc353e68d0c4544ef354673bb4c8722689bd [2024-11-16 16:31:08,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:31:08,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:31:08,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:31:08,505 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:31:08,505 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:31:08,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i [2024-11-16 16:31:10,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:31:10,289 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:31:10,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i [2024-11-16 16:31:10,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3615836/27e63a96eb6741b88b8337756fba5d44/FLAGcea438fa9 [2024-11-16 16:31:10,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3615836/27e63a96eb6741b88b8337756fba5d44 [2024-11-16 16:31:10,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:31:10,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:31:10,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:31:10,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:31:10,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:31:10,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:10,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748d0f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10, skipping insertion in model container [2024-11-16 16:31:10,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:10,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:31:10,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i[915,928] [2024-11-16 16:31:10,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:31:10,921 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:31:10,932 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i[915,928] [2024-11-16 16:31:10,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:31:10,974 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:31:10,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10 WrapperNode [2024-11-16 16:31:10,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:31:10,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:31:10,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:31:10,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:31:10,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:10,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:11,037 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-16 16:31:11,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:31:11,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:31:11,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:31:11,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:31:11,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:11,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:11,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:11,136 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]. [2024-11-16 16:31:11,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:11,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:11,155 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:11,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:11,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:11,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:11,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:31:11,172 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:31:11,173 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:31:11,173 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:31:11,174 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10" (1/1) ... [2024-11-16 16:31:11,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:31:11,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:31:11,202 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) [2024-11-16 16:31:11,204 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 [2024-11-16 16:31:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:31:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:31:11,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:31:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:31:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:31:11,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:31:11,305 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:31:11,306 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:31:11,631 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~bitwise16#1;havoc property_#t~bitwise17#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short22#1; [2024-11-16 16:31:11,670 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-16 16:31:11,670 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:31:11,710 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:31:11,711 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-16 16:31:11,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:31:11 BoogieIcfgContainer [2024-11-16 16:31:11,712 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:31:11,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:31:11,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:31:11,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:31:11,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:31:10" (1/3) ... [2024-11-16 16:31:11,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc8d002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:31:11, skipping insertion in model container [2024-11-16 16:31:11,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:10" (2/3) ... [2024-11-16 16:31:11,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc8d002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:31:11, skipping insertion in model container [2024-11-16 16:31:11,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:31:11" (3/3) ... [2024-11-16 16:31:11,725 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-32.i [2024-11-16 16:31:11,741 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:31:11,742 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:31:11,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:31:11,812 INFO L333 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, 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;@6161bef0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:31:11,812 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:31:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 64 states have internal predecessors, (90), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:31:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 16:31:11,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:11,827 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:11,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:11,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:11,831 INFO L85 PathProgramCache]: Analyzing trace with hash -636506636, now seen corresponding path program 1 times [2024-11-16 16:31:11,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:11,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825865279] [2024-11-16 16:31:11,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:11,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:12,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:12,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825865279] [2024-11-16 16:31:12,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825865279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:12,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:12,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:31:12,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462502062] [2024-11-16 16:31:12,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:12,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:31:12,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:12,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:31:12,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:31:12,175 INFO L87 Difference]: Start difference. First operand has 82 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 64 states have internal predecessors, (90), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 16:31:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:12,224 INFO L93 Difference]: Finished difference Result 156 states and 253 transitions. [2024-11-16 16:31:12,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:31:12,228 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 112 [2024-11-16 16:31:12,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:12,237 INFO L225 Difference]: With dead ends: 156 [2024-11-16 16:31:12,237 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 16:31:12,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:31:12,247 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:12,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:31:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 16:31:12,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-16 16:31:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:31:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2024-11-16 16:31:12,287 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 112 [2024-11-16 16:31:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:12,288 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2024-11-16 16:31:12,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 16:31:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-11-16 16:31:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 16:31:12,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:12,291 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:12,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:31:12,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:12,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:12,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2011315700, now seen corresponding path program 1 times [2024-11-16 16:31:12,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:12,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772945987] [2024-11-16 16:31:12,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:12,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:12,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:12,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772945987] [2024-11-16 16:31:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772945987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:12,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:12,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:31:12,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394485539] [2024-11-16 16:31:12,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:12,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:31:12,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:12,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:31:12,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:31:12,878 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:13,137 INFO L93 Difference]: Finished difference Result 233 states and 348 transitions. [2024-11-16 16:31:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:31:13,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-11-16 16:31:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:13,140 INFO L225 Difference]: With dead ends: 233 [2024-11-16 16:31:13,141 INFO L226 Difference]: Without dead ends: 159 [2024-11-16 16:31:13,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:31:13,146 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 130 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:13,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 384 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:31:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-16 16:31:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 120. [2024-11-16 16:31:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 16:31:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 180 transitions. [2024-11-16 16:31:13,179 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 180 transitions. Word has length 112 [2024-11-16 16:31:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:13,180 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 180 transitions. [2024-11-16 16:31:13,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 180 transitions. [2024-11-16 16:31:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 16:31:13,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:13,182 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:13,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:31:13,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:13,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1733146063, now seen corresponding path program 1 times [2024-11-16 16:31:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:13,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160953282] [2024-11-16 16:31:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:13,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:13,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:13,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160953282] [2024-11-16 16:31:13,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160953282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:13,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:13,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:31:13,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231371738] [2024-11-16 16:31:13,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:13,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:31:13,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:13,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:31:13,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:31:13,520 INFO L87 Difference]: Start difference. First operand 120 states and 180 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:13,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:13,599 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2024-11-16 16:31:13,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:31:13,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-11-16 16:31:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:13,604 INFO L225 Difference]: With dead ends: 277 [2024-11-16 16:31:13,604 INFO L226 Difference]: Without dead ends: 203 [2024-11-16 16:31:13,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:31:13,610 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 74 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:13,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 191 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:31:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-16 16:31:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2024-11-16 16:31:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 148 states have (on average 1.3918918918918919) internal successors, (206), 148 states have internal predecessors, (206), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 16:31:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 302 transitions. [2024-11-16 16:31:13,650 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 302 transitions. Word has length 113 [2024-11-16 16:31:13,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:13,654 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 302 transitions. [2024-11-16 16:31:13,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 302 transitions. [2024-11-16 16:31:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 16:31:13,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:13,657 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:13,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:31:13,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:13,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash 12511474, now seen corresponding path program 1 times [2024-11-16 16:31:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:13,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591849546] [2024-11-16 16:31:13,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:13,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:14,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:14,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591849546] [2024-11-16 16:31:14,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591849546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:14,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:14,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 16:31:14,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355363275] [2024-11-16 16:31:14,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:14,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 16:31:14,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:14,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 16:31:14,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 16:31:14,338 INFO L87 Difference]: Start difference. First operand 200 states and 302 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:14,663 INFO L93 Difference]: Finished difference Result 441 states and 654 transitions. [2024-11-16 16:31:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 16:31:14,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-11-16 16:31:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:14,667 INFO L225 Difference]: With dead ends: 441 [2024-11-16 16:31:14,667 INFO L226 Difference]: Without dead ends: 290 [2024-11-16 16:31:14,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:31:14,670 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 170 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:14,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 290 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:31:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-16 16:31:14,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 256. [2024-11-16 16:31:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 204 states have (on average 1.4068627450980393) internal successors, (287), 204 states have internal predecessors, (287), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 16:31:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 383 transitions. [2024-11-16 16:31:14,703 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 383 transitions. Word has length 113 [2024-11-16 16:31:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:14,704 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 383 transitions. [2024-11-16 16:31:14,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 383 transitions. [2024-11-16 16:31:14,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 16:31:14,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:14,706 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:14,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 16:31:14,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:14,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:14,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1505520695, now seen corresponding path program 1 times [2024-11-16 16:31:14,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:14,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828951273] [2024-11-16 16:31:14,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:14,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:15,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:15,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828951273] [2024-11-16 16:31:15,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828951273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:15,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:15,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:31:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046578837] [2024-11-16 16:31:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:15,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:31:15,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:15,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:31:15,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:31:15,058 INFO L87 Difference]: Start difference. First operand 256 states and 383 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:15,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:15,197 INFO L93 Difference]: Finished difference Result 513 states and 768 transitions. [2024-11-16 16:31:15,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:31:15,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-11-16 16:31:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:15,201 INFO L225 Difference]: With dead ends: 513 [2024-11-16 16:31:15,201 INFO L226 Difference]: Without dead ends: 324 [2024-11-16 16:31:15,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 16:31:15,204 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 102 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:15,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 334 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:31:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-16 16:31:15,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 274. [2024-11-16 16:31:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 222 states have (on average 1.4189189189189189) internal successors, (315), 222 states have internal predecessors, (315), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 16:31:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 411 transitions. [2024-11-16 16:31:15,239 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 411 transitions. Word has length 114 [2024-11-16 16:31:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:15,239 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 411 transitions. [2024-11-16 16:31:15,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 411 transitions. [2024-11-16 16:31:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 16:31:15,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:15,245 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:15,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 16:31:15,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:15,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash -659987787, now seen corresponding path program 1 times [2024-11-16 16:31:15,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:15,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876862931] [2024-11-16 16:31:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:15,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:15,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876862931] [2024-11-16 16:31:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876862931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:15,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:15,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:31:15,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070964441] [2024-11-16 16:31:15,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:15,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:31:15,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:15,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:31:15,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:31:15,429 INFO L87 Difference]: Start difference. First operand 274 states and 411 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:15,573 INFO L93 Difference]: Finished difference Result 550 states and 818 transitions. [2024-11-16 16:31:15,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:31:15,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-11-16 16:31:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:15,577 INFO L225 Difference]: With dead ends: 550 [2024-11-16 16:31:15,578 INFO L226 Difference]: Without dead ends: 418 [2024-11-16 16:31:15,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:31:15,581 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 136 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:15,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 341 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:31:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-16 16:31:15,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 357. [2024-11-16 16:31:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 288 states have (on average 1.3993055555555556) internal successors, (403), 288 states have internal predecessors, (403), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-16 16:31:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 531 transitions. [2024-11-16 16:31:15,628 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 531 transitions. Word has length 114 [2024-11-16 16:31:15,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:15,629 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 531 transitions. [2024-11-16 16:31:15,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 531 transitions. [2024-11-16 16:31:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 16:31:15,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:15,633 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:15,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 16:31:15,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:15,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:15,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1301988984, now seen corresponding path program 1 times [2024-11-16 16:31:15,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:15,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943412668] [2024-11-16 16:31:15,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:15,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:15,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:15,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943412668] [2024-11-16 16:31:15,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943412668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:15,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:15,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:31:15,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502969759] [2024-11-16 16:31:15,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:15,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:31:15,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:15,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:31:15,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:31:15,821 INFO L87 Difference]: Start difference. First operand 357 states and 531 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:15,988 INFO L93 Difference]: Finished difference Result 747 states and 1109 transitions. [2024-11-16 16:31:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:31:15,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-16 16:31:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:15,992 INFO L225 Difference]: With dead ends: 747 [2024-11-16 16:31:15,992 INFO L226 Difference]: Without dead ends: 450 [2024-11-16 16:31:15,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:31:15,996 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 93 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:15,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 386 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:31:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-16 16:31:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 397. [2024-11-16 16:31:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 328 states have (on average 1.399390243902439) internal successors, (459), 328 states have internal predecessors, (459), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-16 16:31:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 587 transitions. [2024-11-16 16:31:16,028 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 587 transitions. Word has length 117 [2024-11-16 16:31:16,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:16,029 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 587 transitions. [2024-11-16 16:31:16,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 587 transitions. [2024-11-16 16:31:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 16:31:16,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:16,032 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:16,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 16:31:16,033 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:16,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash -306855649, now seen corresponding path program 1 times [2024-11-16 16:31:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:16,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845876348] [2024-11-16 16:31:16,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:16,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:17,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:17,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845876348] [2024-11-16 16:31:17,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845876348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:17,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:17,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 16:31:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941592668] [2024-11-16 16:31:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:17,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 16:31:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:17,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 16:31:17,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:31:17,637 INFO L87 Difference]: Start difference. First operand 397 states and 587 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:19,279 INFO L93 Difference]: Finished difference Result 895 states and 1319 transitions. [2024-11-16 16:31:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:31:19,280 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-16 16:31:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:19,285 INFO L225 Difference]: With dead ends: 895 [2024-11-16 16:31:19,285 INFO L226 Difference]: Without dead ends: 598 [2024-11-16 16:31:19,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:31:19,288 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 56 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:19,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 658 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 16:31:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-16 16:31:19,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 506. [2024-11-16 16:31:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 437 states have (on average 1.402745995423341) internal successors, (613), 437 states have internal predecessors, (613), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-16 16:31:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 741 transitions. [2024-11-16 16:31:19,323 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 741 transitions. Word has length 118 [2024-11-16 16:31:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:19,324 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 741 transitions. [2024-11-16 16:31:19,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 741 transitions. [2024-11-16 16:31:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 16:31:19,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:19,326 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:19,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 16:31:19,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:19,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:19,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1200696160, now seen corresponding path program 1 times [2024-11-16 16:31:19,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:19,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020125444] [2024-11-16 16:31:19,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:20,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:20,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020125444] [2024-11-16 16:31:20,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020125444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:20,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:20,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 16:31:20,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909405224] [2024-11-16 16:31:20,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:20,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 16:31:20,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:20,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 16:31:20,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:31:20,674 INFO L87 Difference]: Start difference. First operand 506 states and 741 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:22,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:22,641 INFO L93 Difference]: Finished difference Result 1062 states and 1548 transitions. [2024-11-16 16:31:22,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:31:22,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-16 16:31:22,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:22,647 INFO L225 Difference]: With dead ends: 1062 [2024-11-16 16:31:22,647 INFO L226 Difference]: Without dead ends: 684 [2024-11-16 16:31:22,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:31:22,649 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 56 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:22,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 776 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 16:31:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-11-16 16:31:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 506. [2024-11-16 16:31:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 437 states have (on average 1.402745995423341) internal successors, (613), 437 states have internal predecessors, (613), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-16 16:31:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 741 transitions. [2024-11-16 16:31:22,679 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 741 transitions. Word has length 118 [2024-11-16 16:31:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:22,679 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 741 transitions. [2024-11-16 16:31:22,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 741 transitions. [2024-11-16 16:31:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 16:31:22,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:22,681 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:22,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 16:31:22,681 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:22,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash -55859173, now seen corresponding path program 1 times [2024-11-16 16:31:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:22,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275843989] [2024-11-16 16:31:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:22,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:22,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:23,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:23,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275843989] [2024-11-16 16:31:23,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275843989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:23,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:23,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 16:31:23,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045761713] [2024-11-16 16:31:23,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:23,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 16:31:23,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:23,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 16:31:23,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 16:31:23,009 INFO L87 Difference]: Start difference. First operand 506 states and 741 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:23,377 INFO L93 Difference]: Finished difference Result 1070 states and 1553 transitions. [2024-11-16 16:31:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:31:23,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-16 16:31:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:23,381 INFO L225 Difference]: With dead ends: 1070 [2024-11-16 16:31:23,382 INFO L226 Difference]: Without dead ends: 692 [2024-11-16 16:31:23,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-16 16:31:23,384 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 177 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:23,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 602 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:31:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2024-11-16 16:31:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 542. [2024-11-16 16:31:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 473 states have (on average 1.397463002114165) internal successors, (661), 473 states have internal predecessors, (661), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-16 16:31:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 789 transitions. [2024-11-16 16:31:23,417 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 789 transitions. Word has length 119 [2024-11-16 16:31:23,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:23,418 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 789 transitions. [2024-11-16 16:31:23,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 789 transitions. [2024-11-16 16:31:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 16:31:23,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:23,420 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:23,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 16:31:23,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:23,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash 26728314, now seen corresponding path program 1 times [2024-11-16 16:31:23,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:23,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64741367] [2024-11-16 16:31:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:23,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:23,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64741367] [2024-11-16 16:31:23,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64741367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:23,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:23,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 16:31:23,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85800087] [2024-11-16 16:31:23,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:23,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 16:31:23,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:23,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 16:31:23,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 16:31:23,649 INFO L87 Difference]: Start difference. First operand 542 states and 789 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:24,005 INFO L93 Difference]: Finished difference Result 1128 states and 1637 transitions. [2024-11-16 16:31:24,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 16:31:24,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-16 16:31:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:24,012 INFO L225 Difference]: With dead ends: 1128 [2024-11-16 16:31:24,013 INFO L226 Difference]: Without dead ends: 750 [2024-11-16 16:31:24,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-16 16:31:24,015 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 179 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:24,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 895 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:31:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-11-16 16:31:24,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 664. [2024-11-16 16:31:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 577 states have (on average 1.3812824956672443) internal successors, (797), 579 states have internal predecessors, (797), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-16 16:31:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 957 transitions. [2024-11-16 16:31:24,073 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 957 transitions. Word has length 119 [2024-11-16 16:31:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:24,073 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 957 transitions. [2024-11-16 16:31:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 957 transitions. [2024-11-16 16:31:24,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 16:31:24,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:24,075 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:24,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 16:31:24,075 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:24,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:24,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1615887521, now seen corresponding path program 1 times [2024-11-16 16:31:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:24,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779195579] [2024-11-16 16:31:24,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:24,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:24,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779195579] [2024-11-16 16:31:24,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779195579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:24,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:24,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 16:31:24,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820169447] [2024-11-16 16:31:24,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:24,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:31:24,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:24,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:31:24,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:31:24,487 INFO L87 Difference]: Start difference. First operand 664 states and 957 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:24,764 INFO L93 Difference]: Finished difference Result 879 states and 1255 transitions. [2024-11-16 16:31:24,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 16:31:24,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-11-16 16:31:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:24,771 INFO L225 Difference]: With dead ends: 879 [2024-11-16 16:31:24,772 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 16:31:24,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:31:24,773 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 67 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:24,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 713 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:31:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 16:31:24,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 871. [2024-11-16 16:31:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 749 states have (on average 1.3644859813084111) internal successors, (1022), 754 states have internal predecessors, (1022), 112 states have call successors, (112), 9 states have call predecessors, (112), 9 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-16 16:31:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1246 transitions. [2024-11-16 16:31:24,838 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1246 transitions. Word has length 120 [2024-11-16 16:31:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:24,839 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1246 transitions. [2024-11-16 16:31:24,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1246 transitions. [2024-11-16 16:31:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 16:31:24,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:24,842 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:24,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 16:31:24,842 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:24,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash -611442773, now seen corresponding path program 1 times [2024-11-16 16:31:24,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:24,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943225387] [2024-11-16 16:31:24,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:24,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:24,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:24,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943225387] [2024-11-16 16:31:24,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943225387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:24,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:24,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:31:24,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150699811] [2024-11-16 16:31:24,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:24,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:31:24,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:24,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:31:24,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:31:24,947 INFO L87 Difference]: Start difference. First operand 871 states and 1246 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:25,055 INFO L93 Difference]: Finished difference Result 1917 states and 2735 transitions. [2024-11-16 16:31:25,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:31:25,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-11-16 16:31:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:25,064 INFO L225 Difference]: With dead ends: 1917 [2024-11-16 16:31:25,065 INFO L226 Difference]: Without dead ends: 1260 [2024-11-16 16:31:25,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:31:25,069 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 54 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:25,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 195 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:31:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2024-11-16 16:31:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1252. [2024-11-16 16:31:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1101 states have (on average 1.3505903723887376) internal successors, (1487), 1111 states have internal predecessors, (1487), 132 states have call successors, (132), 18 states have call predecessors, (132), 18 states have return successors, (132), 122 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-16 16:31:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1751 transitions. [2024-11-16 16:31:25,164 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1751 transitions. Word has length 120 [2024-11-16 16:31:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:25,164 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1751 transitions. [2024-11-16 16:31:25,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1751 transitions. [2024-11-16 16:31:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 16:31:25,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:25,167 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:25,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 16:31:25,167 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:25,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1695309088, now seen corresponding path program 1 times [2024-11-16 16:31:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:25,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070650779] [2024-11-16 16:31:25,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:25,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:26,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070650779] [2024-11-16 16:31:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070650779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:26,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:26,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 16:31:26,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476516485] [2024-11-16 16:31:26,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:26,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:31:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:31:26,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:31:26,217 INFO L87 Difference]: Start difference. First operand 1252 states and 1751 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:27,713 INFO L93 Difference]: Finished difference Result 2818 states and 3908 transitions. [2024-11-16 16:31:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 16:31:27,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-11-16 16:31:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:27,724 INFO L225 Difference]: With dead ends: 2818 [2024-11-16 16:31:27,724 INFO L226 Difference]: Without dead ends: 1888 [2024-11-16 16:31:27,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:31:27,727 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 42 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:27,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 682 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 16:31:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2024-11-16 16:31:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1872. [2024-11-16 16:31:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1682 states have (on average 1.3216409036860879) internal successors, (2223), 1705 states have internal predecessors, (2223), 158 states have call successors, (158), 31 states have call predecessors, (158), 31 states have return successors, (158), 135 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-16 16:31:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2539 transitions. [2024-11-16 16:31:27,901 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2539 transitions. Word has length 120 [2024-11-16 16:31:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:27,901 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 2539 transitions. [2024-11-16 16:31:27,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2539 transitions. [2024-11-16 16:31:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 16:31:27,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:27,904 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:27,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 16:31:27,904 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:27,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1184774911, now seen corresponding path program 1 times [2024-11-16 16:31:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:27,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714287059] [2024-11-16 16:31:27,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:27,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:28,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:28,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714287059] [2024-11-16 16:31:28,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714287059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:28,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:28,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 16:31:28,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747882514] [2024-11-16 16:31:28,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:28,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:31:28,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:28,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:31:28,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:31:28,683 INFO L87 Difference]: Start difference. First operand 1872 states and 2539 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:29,789 INFO L93 Difference]: Finished difference Result 3885 states and 5306 transitions. [2024-11-16 16:31:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 16:31:29,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-11-16 16:31:29,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:29,802 INFO L225 Difference]: With dead ends: 3885 [2024-11-16 16:31:29,803 INFO L226 Difference]: Without dead ends: 2503 [2024-11-16 16:31:29,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:31:29,808 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 67 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:29,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 807 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 16:31:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2024-11-16 16:31:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2237. [2024-11-16 16:31:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2020 states have (on average 1.3173267326732674) internal successors, (2661), 2044 states have internal predecessors, (2661), 180 states have call successors, (180), 36 states have call predecessors, (180), 36 states have return successors, (180), 156 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-16 16:31:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3021 transitions. [2024-11-16 16:31:30,057 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3021 transitions. Word has length 120 [2024-11-16 16:31:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:30,057 INFO L471 AbstractCegarLoop]: Abstraction has 2237 states and 3021 transitions. [2024-11-16 16:31:30,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3021 transitions. [2024-11-16 16:31:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 16:31:30,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:30,062 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:30,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 16:31:30,062 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:30,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:30,063 INFO L85 PathProgramCache]: Analyzing trace with hash -953067144, now seen corresponding path program 1 times [2024-11-16 16:31:30,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:30,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896169170] [2024-11-16 16:31:30,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:30,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:30,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:30,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896169170] [2024-11-16 16:31:30,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896169170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:30,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:30,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 16:31:30,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702620371] [2024-11-16 16:31:30,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:30,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 16:31:30,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:30,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 16:31:30,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 16:31:30,263 INFO L87 Difference]: Start difference. First operand 2237 states and 3021 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:30,711 INFO L93 Difference]: Finished difference Result 4417 states and 6013 transitions. [2024-11-16 16:31:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 16:31:30,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-11-16 16:31:30,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:30,725 INFO L225 Difference]: With dead ends: 4417 [2024-11-16 16:31:30,725 INFO L226 Difference]: Without dead ends: 2813 [2024-11-16 16:31:30,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 16:31:30,729 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 64 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:30,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 515 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:31:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2024-11-16 16:31:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2668. [2024-11-16 16:31:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2405 states have (on average 1.3093555093555094) internal successors, (3149), 2438 states have internal predecessors, (3149), 214 states have call successors, (214), 48 states have call predecessors, (214), 48 states have return successors, (214), 181 states have call predecessors, (214), 214 states have call successors, (214) [2024-11-16 16:31:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 3577 transitions. [2024-11-16 16:31:31,033 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 3577 transitions. Word has length 120 [2024-11-16 16:31:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:31,033 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 3577 transitions. [2024-11-16 16:31:31,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 3577 transitions. [2024-11-16 16:31:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 16:31:31,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:31,037 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:31,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 16:31:31,037 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:31,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2104028796, now seen corresponding path program 1 times [2024-11-16 16:31:31,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:31,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842383455] [2024-11-16 16:31:31,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:31,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:31,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:31,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842383455] [2024-11-16 16:31:31,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842383455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:31,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:31,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:31:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170072181] [2024-11-16 16:31:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:31,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:31:31,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:31,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:31:31,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:31:31,122 INFO L87 Difference]: Start difference. First operand 2668 states and 3577 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:31,359 INFO L93 Difference]: Finished difference Result 4583 states and 6181 transitions. [2024-11-16 16:31:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:31:31,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-11-16 16:31:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:31,370 INFO L225 Difference]: With dead ends: 4583 [2024-11-16 16:31:31,370 INFO L226 Difference]: Without dead ends: 2401 [2024-11-16 16:31:31,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:31:31,375 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 53 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:31,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 251 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:31:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2024-11-16 16:31:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2186. [2024-11-16 16:31:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 1962 states have (on average 1.2772680937818552) internal successors, (2506), 1984 states have internal predecessors, (2506), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-16 16:31:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 2866 transitions. [2024-11-16 16:31:31,570 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 2866 transitions. Word has length 120 [2024-11-16 16:31:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:31,571 INFO L471 AbstractCegarLoop]: Abstraction has 2186 states and 2866 transitions. [2024-11-16 16:31:31,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2866 transitions. [2024-11-16 16:31:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 16:31:31,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:31,574 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:31,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 16:31:31,575 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:31,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1488678520, now seen corresponding path program 1 times [2024-11-16 16:31:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:31,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577738915] [2024-11-16 16:31:31,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:31,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:31,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:31,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577738915] [2024-11-16 16:31:31,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577738915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:31,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:31,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 16:31:31,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534271009] [2024-11-16 16:31:31,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:31,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 16:31:31,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:31,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 16:31:31,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:31:31,973 INFO L87 Difference]: Start difference. First operand 2186 states and 2866 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:32,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:32,525 INFO L93 Difference]: Finished difference Result 4318 states and 5697 transitions. [2024-11-16 16:31:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 16:31:32,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-16 16:31:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:32,536 INFO L225 Difference]: With dead ends: 4318 [2024-11-16 16:31:32,536 INFO L226 Difference]: Without dead ends: 2519 [2024-11-16 16:31:32,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-16 16:31:32,541 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 143 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:32,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 733 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 16:31:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2024-11-16 16:31:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2173. [2024-11-16 16:31:32,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 1949 states have (on average 1.2734735761929195) internal successors, (2482), 1971 states have internal predecessors, (2482), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-16 16:31:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 2842 transitions. [2024-11-16 16:31:32,740 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 2842 transitions. Word has length 121 [2024-11-16 16:31:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:32,741 INFO L471 AbstractCegarLoop]: Abstraction has 2173 states and 2842 transitions. [2024-11-16 16:31:32,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 2842 transitions. [2024-11-16 16:31:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 16:31:32,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:32,743 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:32,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 16:31:32,743 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:32,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:32,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1386420962, now seen corresponding path program 1 times [2024-11-16 16:31:32,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:32,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871356927] [2024-11-16 16:31:32,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:32,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:33,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:33,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871356927] [2024-11-16 16:31:33,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871356927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:33,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:33,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 16:31:33,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730672905] [2024-11-16 16:31:33,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:33,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 16:31:33,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:33,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 16:31:33,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:31:33,323 INFO L87 Difference]: Start difference. First operand 2173 states and 2842 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:34,105 INFO L93 Difference]: Finished difference Result 4268 states and 5625 transitions. [2024-11-16 16:31:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 16:31:34,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-16 16:31:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:34,116 INFO L225 Difference]: With dead ends: 4268 [2024-11-16 16:31:34,116 INFO L226 Difference]: Without dead ends: 2568 [2024-11-16 16:31:34,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-16 16:31:34,121 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 185 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:34,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 635 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 16:31:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2024-11-16 16:31:34,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2183. [2024-11-16 16:31:34,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1959 states have (on average 1.2720775906074528) internal successors, (2492), 1981 states have internal predecessors, (2492), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-16 16:31:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 2852 transitions. [2024-11-16 16:31:34,327 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 2852 transitions. Word has length 121 [2024-11-16 16:31:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:34,328 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 2852 transitions. [2024-11-16 16:31:34,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2852 transitions. [2024-11-16 16:31:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 16:31:34,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:34,330 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:34,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 16:31:34,330 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:34,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:34,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1920574826, now seen corresponding path program 1 times [2024-11-16 16:31:34,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:34,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349124541] [2024-11-16 16:31:34,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:31:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:31:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:31:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:31:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:31:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:31:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:31:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-11-16 16:31:34,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:34,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349124541] [2024-11-16 16:31:34,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349124541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:31:34,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809647058] [2024-11-16 16:31:34,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:34,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:31:34,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:31:34,552 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 16:31:34,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 16:31:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:34,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 16:31:34,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:31:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 194 proven. 9 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-11-16 16:31:34,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:31:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 12 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-11-16 16:31:35,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809647058] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 16:31:35,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 16:31:35,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2024-11-16 16:31:35,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353377817] [2024-11-16 16:31:35,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 16:31:35,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 16:31:35,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:35,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 16:31:35,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-16 16:31:35,067 INFO L87 Difference]: Start difference. First operand 2183 states and 2852 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-16 16:31:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:35,570 INFO L93 Difference]: Finished difference Result 4436 states and 5751 transitions. [2024-11-16 16:31:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 16:31:35,571 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 121 [2024-11-16 16:31:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:35,582 INFO L225 Difference]: With dead ends: 4436 [2024-11-16 16:31:35,582 INFO L226 Difference]: Without dead ends: 2299 [2024-11-16 16:31:35,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2024-11-16 16:31:35,587 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 302 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:35,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 292 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:31:35,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2024-11-16 16:31:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2215. [2024-11-16 16:31:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 1983 states have (on average 1.2561775088250127) internal successors, (2491), 2005 states have internal predecessors, (2491), 180 states have call successors, (180), 51 states have call predecessors, (180), 51 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-16 16:31:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 2851 transitions. [2024-11-16 16:31:35,828 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 2851 transitions. Word has length 121 [2024-11-16 16:31:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:35,829 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 2851 transitions. [2024-11-16 16:31:35,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-16 16:31:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2851 transitions. [2024-11-16 16:31:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 16:31:35,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:35,831 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:35,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 16:31:36,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:31:36,033 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:36,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash -637848941, now seen corresponding path program 1 times [2024-11-16 16:31:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:36,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884654185] [2024-11-16 16:31:36,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:31:36,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [877425907] [2024-11-16 16:31:36,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:36,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:31:36,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:31:36,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 16:31:36,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 16:31:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:31:36,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 16:31:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:31:36,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 16:31:36,419 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 16:31:36,420 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:31:36,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 16:31:36,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-16 16:31:36,626 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:36,711 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:31:36,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:31:36 BoogieIcfgContainer [2024-11-16 16:31:36,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:31:36,715 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:31:36,715 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:31:36,716 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:31:36,716 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:31:11" (3/4) ... [2024-11-16 16:31:36,718 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 16:31:36,719 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:31:36,720 INFO L158 Benchmark]: Toolchain (without parser) took 26068.39ms. Allocated memory was 176.2MB in the beginning and 597.7MB in the end (delta: 421.5MB). Free memory was 107.2MB in the beginning and 261.1MB in the end (delta: -153.9MB). Peak memory consumption was 269.3MB. Max. memory is 16.1GB. [2024-11-16 16:31:36,720 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory was 66.2MB in the beginning and 66.0MB in the end (delta: 111.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:31:36,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.34ms. Allocated memory is still 176.2MB. Free memory was 107.0MB in the beginning and 92.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 16:31:36,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.57ms. Allocated memory is still 176.2MB. Free memory was 92.2MB in the beginning and 88.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 16:31:36,721 INFO L158 Benchmark]: Boogie Preprocessor took 132.21ms. Allocated memory is still 176.2MB. Free memory was 88.2MB in the beginning and 143.4MB in the end (delta: -55.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 16:31:36,721 INFO L158 Benchmark]: IcfgBuilder took 540.10ms. Allocated memory is still 176.2MB. Free memory was 143.4MB in the beginning and 116.9MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 16:31:36,722 INFO L158 Benchmark]: TraceAbstraction took 24998.22ms. Allocated memory was 176.2MB in the beginning and 597.7MB in the end (delta: 421.5MB). Free memory was 116.9MB in the beginning and 262.2MB in the end (delta: -145.3MB). Peak memory consumption was 278.0MB. Max. memory is 16.1GB. [2024-11-16 16:31:36,722 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 597.7MB. Free memory was 262.2MB in the beginning and 261.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:31:36,727 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.17ms. Allocated memory is still 104.9MB. Free memory was 66.2MB in the beginning and 66.0MB in the end (delta: 111.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.34ms. Allocated memory is still 176.2MB. Free memory was 107.0MB in the beginning and 92.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.57ms. Allocated memory is still 176.2MB. Free memory was 92.2MB in the beginning and 88.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.21ms. Allocated memory is still 176.2MB. Free memory was 88.2MB in the beginning and 143.4MB in the end (delta: -55.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 540.10ms. Allocated memory is still 176.2MB. Free memory was 143.4MB in the beginning and 116.9MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 24998.22ms. Allocated memory was 176.2MB in the beginning and 597.7MB in the end (delta: 421.5MB). Free memory was 116.9MB in the beginning and 262.2MB in the end (delta: -145.3MB). Peak memory consumption was 278.0MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 597.7MB. Free memory was 262.2MB in the beginning and 261.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_3 = 128; [L24] unsigned short int var_1_4 = 4; [L25] unsigned short int var_1_5 = 0; [L26] signed short int var_1_6 = 0; [L27] unsigned char var_1_7 = 1; [L28] signed short int var_1_8 = -2; [L29] signed short int var_1_9 = 500; [L30] unsigned long int var_1_10 = 10; [L31] unsigned char var_1_11 = 2; [L32] unsigned char var_1_12 = 64; [L33] unsigned long int var_1_13 = 1; [L34] unsigned long int last_1_var_1_10 = 10; [L35] unsigned long int last_1_var_1_13 = 1; VAL [isInitial=0, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L87] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L97] RET updateLastVariables() [L98] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L63] var_1_4 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L64] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L66] var_1_5 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L69] var_1_7 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L71] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-2, var_1_9=500] [L71] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-2, var_1_9=500] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=500] [L73] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=500] [L74] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=500] [L74] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=500] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L76] RET assume_abort_if_not(var_1_9 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L79] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L80] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L80] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=258, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=258, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L82] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=258, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L83] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=258, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=258, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L83] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=258, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L98] RET updateVariables() [L99] CALL step() [L39] COND FALSE !(last_1_var_1_13 >= -50) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=258, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L42] EXPR var_1_11 & var_1_12 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=258, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L42] signed long int stepLocal_0 = var_1_11 & var_1_12; [L43] COND TRUE \read(var_1_7) [L44] var_1_13 = ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=-1, var_1_9=2] [L50] COND TRUE \read(var_1_7) [L51] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=-1, var_1_9=2] [L53] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=-1, var_1_9=2] [L53] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=-1, var_1_9=2] [L53] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=-1, var_1_9=2] [L53] COND TRUE (var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5)) [L54] var_1_10 = ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=1, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=-1, var_1_9=2] [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=-1, var_1_9=2] [L90] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=-1, var_1_9=2] [L90] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=-1, var_1_9=2] [L90] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=-1, var_1_9=2] [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=-1, var_1_9=2] [L90] EXPR ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=-1, var_1_9=2] [L90-L91] return ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=-1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=2, var_1_12=258, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=65537, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=-1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.8s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2163 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2150 mSDsluCounter, 9786 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7457 mSDsCounter, 464 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3334 IncrementalHoareTripleChecker+Invalid, 3798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 464 mSolverCounterUnsat, 2329 mSDtfsCounter, 3334 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1085 GetRequests, 937 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2668occurred in iteration=16, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 2216 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 2717 NumberOfCodeBlocks, 2717 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2572 ConstructedInterpolants, 0 QuantifiedInterpolants, 9721 SizeOfPredicates, 1 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 10530/10560 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 16:31:36,780 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3713b25a83a921fe666aac85c13dc353e68d0c4544ef354673bb4c8722689bd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:31:38,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:31:38,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 16:31:38,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:31:38,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:31:38,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:31:38,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:31:38,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:31:38,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:31:38,980 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:31:38,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:31:38,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:31:38,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:31:38,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:31:38,982 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:31:38,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:31:38,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:31:38,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:31:38,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:31:38,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:31:38,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:31:38,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:31:38,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:31:38,986 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 16:31:38,987 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 16:31:38,995 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:31:38,995 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 16:31:38,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:31:38,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:31:38,996 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:31:38,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:31:38,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:31:38,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:31:38,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:31:38,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:31:38,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:31:38,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:31:38,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:31:39,000 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 16:31:39,001 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 16:31:39,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:31:39,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:31:39,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:31:39,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:31:39,003 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3713b25a83a921fe666aac85c13dc353e68d0c4544ef354673bb4c8722689bd [2024-11-16 16:31:39,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:31:39,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:31:39,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:31:39,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:31:39,335 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:31:39,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i [2024-11-16 16:31:40,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:31:41,025 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:31:41,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i [2024-11-16 16:31:41,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef45b574d/222849f34af3414aac5a63bbac5c4233/FLAG48420f3c9 [2024-11-16 16:31:41,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef45b574d/222849f34af3414aac5a63bbac5c4233 [2024-11-16 16:31:41,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:31:41,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:31:41,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:31:41,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:31:41,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:31:41,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d82af04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41, skipping insertion in model container [2024-11-16 16:31:41,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:31:41,587 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i[915,928] [2024-11-16 16:31:41,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:31:41,661 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:31:41,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i[915,928] [2024-11-16 16:31:41,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:31:41,730 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:31:41,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41 WrapperNode [2024-11-16 16:31:41,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:31:41,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:31:41,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:31:41,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:31:41,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,783 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-11-16 16:31:41,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:31:41,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:31:41,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:31:41,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:31:41,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,819 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]. [2024-11-16 16:31:41,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:31:41,846 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:31:41,846 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:31:41,846 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:31:41,847 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41" (1/1) ... [2024-11-16 16:31:41,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:31:41,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:31:41,911 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) [2024-11-16 16:31:41,947 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 [2024-11-16 16:31:42,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:31:42,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 16:31:42,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:31:42,003 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:31:42,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:31:42,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:31:42,086 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:31:42,089 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:31:42,359 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 16:31:42,360 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:31:42,376 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:31:42,376 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:31:42,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:31:42 BoogieIcfgContainer [2024-11-16 16:31:42,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:31:42,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:31:42,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:31:42,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:31:42,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:31:41" (1/3) ... [2024-11-16 16:31:42,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93d90c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:31:42, skipping insertion in model container [2024-11-16 16:31:42,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:41" (2/3) ... [2024-11-16 16:31:42,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93d90c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:31:42, skipping insertion in model container [2024-11-16 16:31:42,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:31:42" (3/3) ... [2024-11-16 16:31:42,385 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-32.i [2024-11-16 16:31:42,400 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:31:42,400 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:31:42,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:31:42,464 INFO L333 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, 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;@6ac25898, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:31:42,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:31:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:31:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 16:31:42,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:42,482 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:42,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:42,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1502000455, now seen corresponding path program 1 times [2024-11-16 16:31:42,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:31:42,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908635697] [2024-11-16 16:31:42,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:42,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:31:42,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:31:42,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:31:42,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 16:31:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:42,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 16:31:42,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:31:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-16 16:31:42,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:31:42,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:31:42,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908635697] [2024-11-16 16:31:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908635697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:42,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:42,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:31:42,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367994337] [2024-11-16 16:31:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:42,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:31:42,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:31:42,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:31:42,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:31:42,809 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 16:31:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:42,839 INFO L93 Difference]: Finished difference Result 96 states and 159 transitions. [2024-11-16 16:31:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:31:42,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-16 16:31:42,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:42,849 INFO L225 Difference]: With dead ends: 96 [2024-11-16 16:31:42,849 INFO L226 Difference]: Without dead ends: 47 [2024-11-16 16:31:42,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:31:42,857 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:42,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:31:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-16 16:31:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-16 16:31:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:31:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2024-11-16 16:31:42,906 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 104 [2024-11-16 16:31:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:42,907 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-11-16 16:31:42,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 16:31:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2024-11-16 16:31:42,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 16:31:42,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:42,913 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:42,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 16:31:43,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:31:43,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:43,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash -85375673, now seen corresponding path program 1 times [2024-11-16 16:31:43,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:31:43,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831128683] [2024-11-16 16:31:43,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:43,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:31:43,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:31:43,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:31:43,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 16:31:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:43,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 16:31:43,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:31:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:31:43,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:31:43,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:31:43,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831128683] [2024-11-16 16:31:43,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831128683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:43,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:43,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:31:43,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483369931] [2024-11-16 16:31:43,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:43,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:31:43,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:31:43,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:31:43,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:31:43,537 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:43,683 INFO L93 Difference]: Finished difference Result 146 states and 208 transitions. [2024-11-16 16:31:43,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:31:43,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-16 16:31:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:43,690 INFO L225 Difference]: With dead ends: 146 [2024-11-16 16:31:43,691 INFO L226 Difference]: Without dead ends: 102 [2024-11-16 16:31:43,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:31:43,693 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 49 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:43,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 194 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:31:43,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-16 16:31:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2024-11-16 16:31:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 16:31:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-11-16 16:31:43,719 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 104 [2024-11-16 16:31:43,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:43,720 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-11-16 16:31:43,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:31:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-11-16 16:31:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 16:31:43,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:43,722 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:43,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 16:31:43,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:31:43,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:43,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash -281889178, now seen corresponding path program 1 times [2024-11-16 16:31:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:31:43,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041164705] [2024-11-16 16:31:43,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:43,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:31:43,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:31:43,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:31:43,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 16:31:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:44,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 16:31:44,045 INFO L278 TraceCheckSpWp]: Computing forward predicates...