./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-59.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 d3b03823011e7472edac4d496fa9649145126d89af08fba6213c0cfdb5c29eb5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:07:29,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:07:29,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:07:29,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:07:29,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:07:29,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:07:29,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:07:29,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:07:29,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:07:29,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:07:29,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:07:29,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:07:29,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:07:29,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:07:29,143 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:07:29,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:07:29,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:07:29,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:07:29,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:07:29,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:07:29,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:07:29,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:07:29,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:07:29,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:07:29,150 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:07:29,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:07:29,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:07:29,151 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:07:29,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:07:29,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:07:29,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:07:29,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:07:29,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:07:29,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:07:29,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:07:29,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:07:29,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:07:29,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:07:29,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:07:29,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:07:29,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:07:29,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:07:29,154 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 -> d3b03823011e7472edac4d496fa9649145126d89af08fba6213c0cfdb5c29eb5 [2024-10-24 11:07:29,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:07:29,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:07:29,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:07:29,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:07:29,391 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:07:29,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-59.i [2024-10-24 11:07:30,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:07:30,871 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:07:30,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-59.i [2024-10-24 11:07:30,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4acf5523e/2de50ea78f404ba7bc9651aba4124d05/FLAGcd0696270 [2024-10-24 11:07:31,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4acf5523e/2de50ea78f404ba7bc9651aba4124d05 [2024-10-24 11:07:31,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:07:31,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:07:31,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:07:31,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:07:31,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:07:31,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6979d51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31, skipping insertion in model container [2024-10-24 11:07:31,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:07:31,427 WARN L248 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_variablewrapping_normal_file-59.i[913,926] [2024-10-24 11:07:31,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:07:31,494 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:07:31,506 WARN L248 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_variablewrapping_normal_file-59.i[913,926] [2024-10-24 11:07:31,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:07:31,547 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:07:31,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31 WrapperNode [2024-10-24 11:07:31,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:07:31,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:07:31,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:07:31,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:07:31,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,576 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-24 11:07:31,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:07:31,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:07:31,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:07:31,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:07:31,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,614 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-10-24 11:07:31,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:07:31,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:07:31,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:07:31,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:07:31,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31" (1/1) ... [2024-10-24 11:07:31,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:07:31,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:07:31,675 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-10-24 11:07:31,678 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-10-24 11:07:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:07:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:07:31,726 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:07:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:07:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:07:31,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:07:31,786 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:07:31,789 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:07:32,015 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 11:07:32,016 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:07:32,076 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:07:32,077 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:07:32,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:07:32 BoogieIcfgContainer [2024-10-24 11:07:32,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:07:32,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:07:32,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:07:32,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:07:32,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:07:31" (1/3) ... [2024-10-24 11:07:32,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46efd6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:07:32, skipping insertion in model container [2024-10-24 11:07:32,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:07:31" (2/3) ... [2024-10-24 11:07:32,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46efd6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:07:32, skipping insertion in model container [2024-10-24 11:07:32,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:07:32" (3/3) ... [2024-10-24 11:07:32,085 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-59.i [2024-10-24 11:07:32,097 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:07:32,097 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:07:32,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:07:32,161 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;@5fc8463e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:07:32,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:07:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:07:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:07:32,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:07:32,179 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:07:32,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:07:32,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:07:32,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1523944797, now seen corresponding path program 1 times [2024-10-24 11:07:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:07:32,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211522538] [2024-10-24 11:07:32,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:07:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:07:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:07:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:07:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:07:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:07:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:07:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:07:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:07:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:07:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:07:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:07:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:07:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:07:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:07:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:07:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:07:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:07:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 11:07:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:07:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:07:32,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:07:32,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211522538] [2024-10-24 11:07:32,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211522538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:07:32,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:07:32,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:07:32,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115689652] [2024-10-24 11:07:32,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:07:32,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:07:32,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:07:32,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:07:32,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:07:32,638 INFO L87 Difference]: Start difference. First operand has 46 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:07:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:07:32,706 INFO L93 Difference]: Finished difference Result 89 states and 160 transitions. [2024-10-24 11:07:32,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:07:32,708 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 107 [2024-10-24 11:07:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:07:32,714 INFO L225 Difference]: With dead ends: 89 [2024-10-24 11:07:32,714 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 11:07:32,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-10-24 11:07:32,721 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:07:32,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:07:32,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 11:07:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 11:07:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:07:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2024-10-24 11:07:32,765 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 107 [2024-10-24 11:07:32,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:07:32,766 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 67 transitions. [2024-10-24 11:07:32,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:07:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2024-10-24 11:07:32,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:07:32,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:07:32,769 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:07:32,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:07:32,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:07:32,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:07:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1823148387, now seen corresponding path program 1 times [2024-10-24 11:07:32,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:07:32,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010397800] [2024-10-24 11:07:32,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:07:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:07:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:07:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:07:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:07:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:07:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:07:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:07:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:07:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:07:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:07:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:07:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:07:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:07:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:07:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:07:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:07:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:07:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 11:07:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:07:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:07:33,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:07:33,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010397800] [2024-10-24 11:07:33,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010397800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:07:33,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:07:33,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:07:33,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648636751] [2024-10-24 11:07:33,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:07:33,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:07:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:07:33,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:07:33,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:07:33,162 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:07:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:07:33,289 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2024-10-24 11:07:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:07:33,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 107 [2024-10-24 11:07:33,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:07:33,292 INFO L225 Difference]: With dead ends: 131 [2024-10-24 11:07:33,292 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 11:07:33,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-10-24 11:07:33,294 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:07:33,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 169 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:07:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 11:07:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2024-10-24 11:07:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:07:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2024-10-24 11:07:33,324 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 107 [2024-10-24 11:07:33,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:07:33,325 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2024-10-24 11:07:33,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:07:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2024-10-24 11:07:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:07:33,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:07:33,328 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:07:33,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:07:33,328 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:07:33,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:07:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2108675400, now seen corresponding path program 1 times [2024-10-24 11:07:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:07:33,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927327676] [2024-10-24 11:07:33,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:07:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:07:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:07:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:07:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:07:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:07:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:07:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:07:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:07:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:07:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:07:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:07:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:07:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:07:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:07:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:07:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:07:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:07:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 11:07:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:07:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:07:39,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:07:39,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927327676] [2024-10-24 11:07:39,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927327676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:07:39,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:07:39,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:07:39,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369829122] [2024-10-24 11:07:39,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:07:39,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:07:39,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:07:39,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:07:39,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:07:39,517 INFO L87 Difference]: Start difference. First operand 79 states and 120 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:07:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:07:39,836 INFO L93 Difference]: Finished difference Result 95 states and 140 transitions. [2024-10-24 11:07:39,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:07:39,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 108 [2024-10-24 11:07:39,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:07:39,839 INFO L225 Difference]: With dead ends: 95 [2024-10-24 11:07:39,839 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:07:39,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:07:39,840 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:07:39,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 158 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:07:39,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:07:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2024-10-24 11:07:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:07:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2024-10-24 11:07:39,864 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 108 [2024-10-24 11:07:39,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:07:39,865 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2024-10-24 11:07:39,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:07:39,865 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2024-10-24 11:07:39,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:07:39,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:07:39,867 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:07:39,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:07:39,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:07:39,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:07:39,869 INFO L85 PathProgramCache]: Analyzing trace with hash 704969848, now seen corresponding path program 1 times [2024-10-24 11:07:39,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:07:39,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588153711] [2024-10-24 11:07:39,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:07:39,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:07:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:07:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:07:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:07:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:07:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:07:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:07:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:07:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:07:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:07:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:07:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:07:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:07:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:07:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:07:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:07:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:07:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 11:07:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:07:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:07:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:07:43,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588153711] [2024-10-24 11:07:43,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588153711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:07:43,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:07:43,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:07:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200867394] [2024-10-24 11:07:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:07:43,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:07:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:07:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:07:43,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:07:43,997 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:07:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:07:44,724 INFO L93 Difference]: Finished difference Result 93 states and 138 transitions. [2024-10-24 11:07:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:07:44,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2024-10-24 11:07:44,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:07:44,729 INFO L225 Difference]: With dead ends: 93 [2024-10-24 11:07:44,729 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:07:44,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:07:44,734 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 12 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:07:44,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 247 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:07:44,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:07:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2024-10-24 11:07:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:07:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 128 transitions. [2024-10-24 11:07:44,768 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 128 transitions. Word has length 109 [2024-10-24 11:07:44,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:07:44,770 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 128 transitions. [2024-10-24 11:07:44,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:07:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 128 transitions. [2024-10-24 11:07:44,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-24 11:07:44,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:07:44,783 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:07:44,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:07:44,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:07:44,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:07:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash 857893907, now seen corresponding path program 1 times [2024-10-24 11:07:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:07:44,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614814959] [2024-10-24 11:07:44,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:07:44,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:07:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:07:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:07:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:07:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:07:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:07:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:07:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:07:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:07:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:07:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:07:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:07:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:07:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:07:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:07:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:07:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:07:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 11:07:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:07:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 11:07:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 11:07:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 11:07:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:07:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:07:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 11:07:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 11:07:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 11:07:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 11:07:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 11:07:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-24 11:07:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 11:07:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 11:07:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 11:07:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 11:07:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 11:07:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-24 11:07:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 11:07:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2554 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2549 trivial. 0 not checked. [2024-10-24 11:07:46,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:07:46,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614814959] [2024-10-24 11:07:46,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614814959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:07:46,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:07:46,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:07:46,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679163871] [2024-10-24 11:07:46,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:07:46,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:07:46,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:07:46,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:07:46,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:07:46,373 INFO L87 Difference]: Start difference. First operand 84 states and 128 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:07:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:07:46,751 INFO L93 Difference]: Finished difference Result 107 states and 158 transitions. [2024-10-24 11:07:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:07:46,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 216 [2024-10-24 11:07:46,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:07:46,753 INFO L225 Difference]: With dead ends: 107 [2024-10-24 11:07:46,753 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 11:07:46,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:07:46,754 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:07:46,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 244 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:07:46,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 11:07:46,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2024-10-24 11:07:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:07:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 128 transitions. [2024-10-24 11:07:46,768 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 128 transitions. Word has length 216 [2024-10-24 11:07:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:07:46,768 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 128 transitions. [2024-10-24 11:07:46,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:07:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 128 transitions. [2024-10-24 11:07:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-24 11:07:46,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:07:46,770 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:07:46,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:07:46,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:07:46,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:07:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash 585449229, now seen corresponding path program 1 times [2024-10-24 11:07:46,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:07:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053795556] [2024-10-24 11:07:46,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:07:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:07:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:07:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:07:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:07:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:07:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:07:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:07:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:07:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:07:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:07:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:07:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:07:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:07:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:07:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:07:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:07:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:07:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 11:07:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:07:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 11:07:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 11:07:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 11:07:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:07:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:07:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 11:07:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 11:07:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 11:07:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 11:07:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 11:07:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-24 11:07:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 11:07:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 11:07:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 11:07:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 11:07:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 11:07:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-24 11:07:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 11:07:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:07:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2554 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2549 trivial. 0 not checked. [2024-10-24 11:07:48,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:07:48,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053795556] [2024-10-24 11:07:48,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053795556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:07:48,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:07:48,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:07:48,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542219903] [2024-10-24 11:07:48,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:07:48,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:07:48,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:07:48,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:07:48,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:07:48,395 INFO L87 Difference]: Start difference. First operand 84 states and 128 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:07:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:07:48,897 INFO L93 Difference]: Finished difference Result 105 states and 156 transitions. [2024-10-24 11:07:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:07:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 217 [2024-10-24 11:07:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:07:48,898 INFO L225 Difference]: With dead ends: 105 [2024-10-24 11:07:48,898 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 11:07:48,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:07:48,899 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 35 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:07:48,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 245 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:07:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 11:07:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 11:07:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 11:07:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 11:07:48,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 217 [2024-10-24 11:07:48,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:07:48,900 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 11:07:48,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:07:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 11:07:48,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 11:07:48,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:07:48,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:07:48,905 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 11:07:48,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 11:07:48,935 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:07:48,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:07:48 BoogieIcfgContainer [2024-10-24 11:07:48,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:07:48,951 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:07:48,951 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:07:48,952 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:07:48,952 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:07:32" (3/4) ... [2024-10-24 11:07:48,954 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 11:07:48,957 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 11:07:48,963 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-24 11:07:48,964 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 11:07:48,964 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 11:07:48,964 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 11:07:49,046 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 11:07:49,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 11:07:49,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:07:49,054 INFO L158 Benchmark]: Toolchain (without parser) took 17774.32ms. Allocated memory was 199.2MB in the beginning and 979.4MB in the end (delta: 780.1MB). Free memory was 128.5MB in the beginning and 644.4MB in the end (delta: -515.9MB). Peak memory consumption was 266.1MB. Max. memory is 16.1GB. [2024-10-24 11:07:49,055 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 136.3MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:07:49,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.85ms. Allocated memory is still 199.2MB. Free memory was 128.1MB in the beginning and 114.2MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:07:49,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.23ms. Allocated memory is still 199.2MB. Free memory was 114.2MB in the beginning and 112.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:07:49,055 INFO L158 Benchmark]: Boogie Preprocessor took 55.24ms. Allocated memory is still 199.2MB. Free memory was 112.5MB in the beginning and 110.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:07:49,056 INFO L158 Benchmark]: RCFGBuilder took 444.52ms. Allocated memory is still 199.2MB. Free memory was 110.0MB in the beginning and 91.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:07:49,056 INFO L158 Benchmark]: TraceAbstraction took 16871.89ms. Allocated memory was 199.2MB in the beginning and 979.4MB in the end (delta: 780.1MB). Free memory was 90.7MB in the beginning and 650.7MB in the end (delta: -560.0MB). Peak memory consumption was 222.0MB. Max. memory is 16.1GB. [2024-10-24 11:07:49,056 INFO L158 Benchmark]: Witness Printer took 101.39ms. Allocated memory is still 979.4MB. Free memory was 650.7MB in the beginning and 644.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:07:49,059 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.13ms. Allocated memory is still 136.3MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.85ms. Allocated memory is still 199.2MB. Free memory was 128.1MB in the beginning and 114.2MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.23ms. Allocated memory is still 199.2MB. Free memory was 114.2MB in the beginning and 112.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.24ms. Allocated memory is still 199.2MB. Free memory was 112.5MB in the beginning and 110.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 444.52ms. Allocated memory is still 199.2MB. Free memory was 110.0MB in the beginning and 91.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16871.89ms. Allocated memory was 199.2MB in the beginning and 979.4MB in the end (delta: 780.1MB). Free memory was 90.7MB in the beginning and 650.7MB in the end (delta: -560.0MB). Peak memory consumption was 222.0MB. Max. memory is 16.1GB. * Witness Printer took 101.39ms. Allocated memory is still 979.4MB. Free memory was 650.7MB in the beginning and 644.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 6, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 1127 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 779 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 634 IncrementalHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 348 mSDtfsCounter, 634 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 864 NumberOfCodeBlocks, 864 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 858 ConstructedInterpolants, 0 QuantifiedInterpolants, 3187 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 7556/7556 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (last_1_var_1_1 == \old(last_1_var_1_1))) && (last_1_var_1_7 == \old(last_1_var_1_7))) && (last_1_var_1_12 == \old(last_1_var_1_12))) RESULT: Ultimate proved your program to be correct! [2024-10-24 11:07:49,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE