./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_floatingpointinfluence_no-floats_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_floatingpointinfluence_no-floats_file-64.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 bbe8ef4a6bc225ccf8ff0d5c1205da91d942b24e606bb225cf4da24e4664ed51 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:05:54,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:05:54,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:05:54,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:05:54,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:05:54,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:05:54,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:05:54,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:05:54,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:05:54,789 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:05:54,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:05:54,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:05:54,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:05:54,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:05:54,791 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:05:54,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:05:54,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:05:54,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:05:54,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:05:54,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:05:54,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:05:54,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:05:54,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:05:54,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:05:54,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:05:54,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:05:54,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:05:54,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:05:54,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:05:54,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:05:54,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:05:54,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:05:54,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:05:54,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:05:54,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:05:54,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:05:54,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:05:54,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:05:54,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:05:54,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:05:54,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:05:54,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:05:54,805 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 -> bbe8ef4a6bc225ccf8ff0d5c1205da91d942b24e606bb225cf4da24e4664ed51 [2024-10-14 11:05:55,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:05:55,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:05:55,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:05:55,118 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:05:55,119 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:05:55,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-64.i [2024-10-14 11:05:56,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:05:56,901 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:05:56,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-64.i [2024-10-14 11:05:56,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c55922d/914b7b4d40ee4d8487b9409845fa8a81/FLAGda2c3891b [2024-10-14 11:05:56,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c55922d/914b7b4d40ee4d8487b9409845fa8a81 [2024-10-14 11:05:56,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:05:56,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:05:56,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:05:56,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:05:56,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:05:56,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:05:56" (1/1) ... [2024-10-14 11:05:56,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749c3c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:56, skipping insertion in model container [2024-10-14 11:05:56,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:05:56" (1/1) ... [2024-10-14 11:05:56,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:05:57,120 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_floatingpointinfluence_no-floats_file-64.i[916,929] [2024-10-14 11:05:57,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:05:57,188 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:05:57,204 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_floatingpointinfluence_no-floats_file-64.i[916,929] [2024-10-14 11:05:57,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:05:57,243 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:05:57,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57 WrapperNode [2024-10-14 11:05:57,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:05:57,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:05:57,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:05:57,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:05:57,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57" (1/1) ... [2024-10-14 11:05:57,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57" (1/1) ... [2024-10-14 11:05:57,295 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-10-14 11:05:57,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:05:57,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:05:57,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:05:57,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:05:57,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57" (1/1) ... [2024-10-14 11:05:57,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57" (1/1) ... [2024-10-14 11:05:57,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57" (1/1) ... [2024-10-14 11:05:57,345 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-14 11:05:57,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57" (1/1) ... [2024-10-14 11:05:57,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57" (1/1) ... [2024-10-14 11:05:57,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57" (1/1) ... [2024-10-14 11:05:57,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57" (1/1) ... [2024-10-14 11:05:57,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57" (1/1) ... [2024-10-14 11:05:57,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57" (1/1) ... [2024-10-14 11:05:57,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:05:57,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:05:57,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:05:57,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:05:57,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57" (1/1) ... [2024-10-14 11:05:57,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:05:57,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:05:57,418 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-14 11:05:57,430 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-14 11:05:57,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:05:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:05:57,478 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:05:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:05:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:05:57,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:05:57,551 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:05:57,554 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:05:57,953 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 11:05:57,954 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:05:57,995 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:05:58,000 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:05:58,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:05:58 BoogieIcfgContainer [2024-10-14 11:05:58,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:05:58,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:05:58,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:05:58,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:05:58,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:05:56" (1/3) ... [2024-10-14 11:05:58,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704d0696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:05:58, skipping insertion in model container [2024-10-14 11:05:58,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:57" (2/3) ... [2024-10-14 11:05:58,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704d0696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:05:58, skipping insertion in model container [2024-10-14 11:05:58,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:05:58" (3/3) ... [2024-10-14 11:05:58,013 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-64.i [2024-10-14 11:05:58,036 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:05:58,037 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:05:58,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:05:58,132 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;@3b37641e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:05:58,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:05:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 11:05:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 11:05:58,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:05:58,158 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:05:58,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:05:58,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:05:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1782830846, now seen corresponding path program 1 times [2024-10-14 11:05:58,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:05:58,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628108591] [2024-10-14 11:05:58,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:05:58,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:05:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:05:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:05:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:05:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:05:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:05:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:05:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:05:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:05:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:05:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:05:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:05:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:05:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:05:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:05:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:05:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:05:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:05:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:05:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:05:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:05:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 11:05:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 11:05:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 11:05:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 11:05:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 11:05:58,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:05:58,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628108591] [2024-10-14 11:05:58,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628108591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:05:58,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:05:58,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:05:58,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607773624] [2024-10-14 11:05:58,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:05:58,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:05:58,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:05:58,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:05:58,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:05:58,664 INFO L87 Difference]: Start difference. First operand has 66 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 11:05:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:05:58,710 INFO L93 Difference]: Finished difference Result 129 states and 232 transitions. [2024-10-14 11:05:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:05:58,712 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 144 [2024-10-14 11:05:58,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:05:58,721 INFO L225 Difference]: With dead ends: 129 [2024-10-14 11:05:58,722 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 11:05:58,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-14 11:05:58,732 INFO L432 NwaCegarLoop]: 96 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, 96 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-14 11:05:58,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:05:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 11:05:58,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 11:05:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 11:05:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 99 transitions. [2024-10-14 11:05:58,776 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 99 transitions. Word has length 144 [2024-10-14 11:05:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:05:58,777 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 99 transitions. [2024-10-14 11:05:58,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 11:05:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 99 transitions. [2024-10-14 11:05:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 11:05:58,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:05:58,784 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:05:58,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:05:58,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:05:58,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:05:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1058367484, now seen corresponding path program 1 times [2024-10-14 11:05:58,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:05:58,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859307765] [2024-10-14 11:05:58,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:05:58,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:05:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:59,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:05:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:59,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:05:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:59,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:05:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:59,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:05:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:59,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:05:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:59,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:05:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:59,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:05:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:59,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:05:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:59,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:05:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:59,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:05:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:59,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:05:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:59,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:05:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:59,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:06:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:00,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:00,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:06:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:00,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:00,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:06:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:00,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:06:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:00,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:06:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:00,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:06:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 11:06:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 11:06:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:00,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 11:06:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:00,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 11:06:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 11:06:00,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:00,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859307765] [2024-10-14 11:06:00,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859307765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:00,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:00,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:06:00,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059299257] [2024-10-14 11:06:00,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:00,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:06:00,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:00,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:06:00,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:06:00,114 INFO L87 Difference]: Start difference. First operand 64 states and 99 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 11:06:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:00,816 INFO L93 Difference]: Finished difference Result 214 states and 330 transitions. [2024-10-14 11:06:00,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:06:00,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 144 [2024-10-14 11:06:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:00,822 INFO L225 Difference]: With dead ends: 214 [2024-10-14 11:06:00,822 INFO L226 Difference]: Without dead ends: 151 [2024-10-14 11:06:00,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-14 11:06:00,825 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 120 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:00,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 473 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 11:06:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-14 11:06:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 116. [2024-10-14 11:06:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 11:06:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2024-10-14 11:06:00,870 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 181 transitions. Word has length 144 [2024-10-14 11:06:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:00,872 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 181 transitions. [2024-10-14 11:06:00,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 11:06:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 181 transitions. [2024-10-14 11:06:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 11:06:00,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:00,876 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:06:00,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:06:00,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:00,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1778417375, now seen corresponding path program 1 times [2024-10-14 11:06:00,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:00,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113312211] [2024-10-14 11:06:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:00,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:06:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:06:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:06:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:06:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:06:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:06:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:06:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:06:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:06:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 11:06:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 11:06:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 11:06:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 11:06:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 11:06:01,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:01,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113312211] [2024-10-14 11:06:01,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113312211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:01,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:01,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:06:01,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271332017] [2024-10-14 11:06:01,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:01,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:06:01,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:01,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:06:01,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:06:01,347 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 11:06:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:01,526 INFO L93 Difference]: Finished difference Result 225 states and 348 transitions. [2024-10-14 11:06:01,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:06:01,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 145 [2024-10-14 11:06:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:01,529 INFO L225 Difference]: With dead ends: 225 [2024-10-14 11:06:01,529 INFO L226 Difference]: Without dead ends: 162 [2024-10-14 11:06:01,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:06:01,531 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 81 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:01,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 398 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:06:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-14 11:06:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2024-10-14 11:06:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 92 states have (on average 1.315217391304348) internal successors, (121), 93 states have internal predecessors, (121), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-14 11:06:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 243 transitions. [2024-10-14 11:06:01,583 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 243 transitions. Word has length 145 [2024-10-14 11:06:01,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:01,584 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 243 transitions. [2024-10-14 11:06:01,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 11:06:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 243 transitions. [2024-10-14 11:06:01,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-14 11:06:01,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:01,590 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:06:01,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:06:01,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:01,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:01,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1333461375, now seen corresponding path program 1 times [2024-10-14 11:06:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:01,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963370546] [2024-10-14 11:06:01,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:01,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:06:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:06:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:06:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:06:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:06:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:06:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:06:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:06:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:06:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 11:06:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 11:06:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 11:06:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 11:06:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 11:06:02,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:02,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963370546] [2024-10-14 11:06:02,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963370546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:02,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:02,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:06:02,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556490099] [2024-10-14 11:06:02,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:02,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:06:02,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:02,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:06:02,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:06:02,075 INFO L87 Difference]: Start difference. First operand 157 states and 243 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 11:06:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:02,164 INFO L93 Difference]: Finished difference Result 165 states and 250 transitions. [2024-10-14 11:06:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:06:02,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 146 [2024-10-14 11:06:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:02,169 INFO L225 Difference]: With dead ends: 165 [2024-10-14 11:06:02,169 INFO L226 Difference]: Without dead ends: 163 [2024-10-14 11:06:02,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:06:02,171 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 73 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:02,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 517 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:06:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-14 11:06:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-14 11:06:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 97 states have (on average 1.288659793814433) internal successors, (125), 98 states have internal predecessors, (125), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-14 11:06:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 247 transitions. [2024-10-14 11:06:02,228 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 247 transitions. Word has length 146 [2024-10-14 11:06:02,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:02,229 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 247 transitions. [2024-10-14 11:06:02,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 11:06:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 247 transitions. [2024-10-14 11:06:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-14 11:06:02,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:02,233 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:06:02,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:06:02,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:02,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:02,236 INFO L85 PathProgramCache]: Analyzing trace with hash 200543315, now seen corresponding path program 1 times [2024-10-14 11:06:02,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:02,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842341459] [2024-10-14 11:06:02,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:02,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:06:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:06:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:06:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:06:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:06:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:02,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:06:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:03,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:06:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:03,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:06:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:03,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:06:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:03,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 11:06:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:03,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 11:06:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:03,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 11:06:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:03,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 11:06:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 11:06:03,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:03,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842341459] [2024-10-14 11:06:03,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842341459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:03,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:03,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 11:06:03,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946324737] [2024-10-14 11:06:03,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:03,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:06:03,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:03,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:06:03,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:06:03,020 INFO L87 Difference]: Start difference. First operand 163 states and 247 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 11:06:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:03,766 INFO L93 Difference]: Finished difference Result 313 states and 470 transitions. [2024-10-14 11:06:03,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 11:06:03,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 146 [2024-10-14 11:06:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:03,769 INFO L225 Difference]: With dead ends: 313 [2024-10-14 11:06:03,769 INFO L226 Difference]: Without dead ends: 203 [2024-10-14 11:06:03,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:06:03,771 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 62 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:03,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 469 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 11:06:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-14 11:06:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 163. [2024-10-14 11:06:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 97 states have (on average 1.288659793814433) internal successors, (125), 98 states have internal predecessors, (125), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-14 11:06:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 247 transitions. [2024-10-14 11:06:03,806 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 247 transitions. Word has length 146 [2024-10-14 11:06:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:03,807 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 247 transitions. [2024-10-14 11:06:03,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 11:06:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 247 transitions. [2024-10-14 11:06:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-10-14 11:06:03,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:03,811 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 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, 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] [2024-10-14 11:06:03,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:06:03,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:03,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash -908630002, now seen corresponding path program 1 times [2024-10-14 11:06:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:03,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235691761] [2024-10-14 11:06:03,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:03,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:06:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:06:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:06:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:06:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:06:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:06:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:06:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:06:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:06:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 11:06:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 11:06:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 11:06:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 11:06:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:06:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:06:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:06:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 11:06:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:06:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 11:06:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 11:06:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:04,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 11:06:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 11:06:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 11:06:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-14 11:06:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-14 11:06:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-14 11:06:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-14 11:06:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-10-14 11:06:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-14 11:06:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-14 11:06:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-14 11:06:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-14 11:06:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-14 11:06:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-14 11:06:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-14 11:06:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-14 11:06:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-14 11:06:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 45 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-10-14 11:06:05,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:05,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235691761] [2024-10-14 11:06:05,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235691761] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:06:05,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801203047] [2024-10-14 11:06:05,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:05,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:06:05,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:06:05,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:06:05,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 11:06:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:05,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 11:06:05,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:06:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 2349 proven. 1 refuted. 0 times theorem prover too weak. 2208 trivial. 0 not checked. [2024-10-14 11:06:05,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:06:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 45 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-10-14 11:06:06,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801203047] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:06:06,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 11:06:06,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-14 11:06:06,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298861297] [2024-10-14 11:06:06,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 11:06:06,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 11:06:06,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:06,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 11:06:06,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:06:06,391 INFO L87 Difference]: Start difference. First operand 163 states and 247 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2024-10-14 11:06:07,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:07,232 INFO L93 Difference]: Finished difference Result 295 states and 443 transitions. [2024-10-14 11:06:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:06:07,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) Word has length 289 [2024-10-14 11:06:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:07,234 INFO L225 Difference]: With dead ends: 295 [2024-10-14 11:06:07,234 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 11:06:07,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 670 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:06:07,238 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 90 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:07,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 223 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 11:06:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 11:06:07,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 11:06:07,240 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-14 11:06:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 11:06:07,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 289 [2024-10-14 11:06:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:07,241 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 11:06:07,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2024-10-14 11:06:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 11:06:07,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 11:06:07,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:06:07,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 11:06:07,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 11:06:07,450 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 11:06:07,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 11:06:08,286 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:06:08,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:06:08 BoogieIcfgContainer [2024-10-14 11:06:08,311 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:06:08,312 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:06:08,312 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:06:08,312 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:06:08,313 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:05:58" (3/4) ... [2024-10-14 11:06:08,315 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 11:06:08,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 11:06:08,325 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-14 11:06:08,326 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 11:06:08,326 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 11:06:08,327 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 11:06:08,448 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 11:06:08,449 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 11:06:08,449 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:06:08,449 INFO L158 Benchmark]: Toolchain (without parser) took 11522.04ms. Allocated memory was 155.2MB in the beginning and 260.0MB in the end (delta: 104.9MB). Free memory was 99.3MB in the beginning and 122.1MB in the end (delta: -22.8MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. [2024-10-14 11:06:08,450 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 155.2MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:06:08,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.88ms. Allocated memory is still 155.2MB. Free memory was 98.9MB in the beginning and 85.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 11:06:08,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.43ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 82.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:06:08,450 INFO L158 Benchmark]: Boogie Preprocessor took 75.09ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 79.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:06:08,451 INFO L158 Benchmark]: RCFGBuilder took 629.26ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 79.3MB in the beginning and 180.6MB in the end (delta: -101.4MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-10-14 11:06:08,451 INFO L158 Benchmark]: TraceAbstraction took 10307.98ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 179.6MB in the beginning and 128.4MB in the end (delta: 51.2MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. [2024-10-14 11:06:08,451 INFO L158 Benchmark]: Witness Printer took 136.87ms. Allocated memory is still 260.0MB. Free memory was 128.4MB in the beginning and 122.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:06:08,452 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.12ms. Allocated memory is still 155.2MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.88ms. Allocated memory is still 155.2MB. Free memory was 98.9MB in the beginning and 85.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.43ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 82.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.09ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 79.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 629.26ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 79.3MB in the beginning and 180.6MB in the end (delta: -101.4MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10307.98ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 179.6MB in the beginning and 128.4MB in the end (delta: 51.2MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. * Witness Printer took 136.87ms. Allocated memory is still 260.0MB. Free memory was 128.4MB in the beginning and 122.1MB 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, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 6, TraceHistogramMax: 48, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 426 mSDsluCounter, 2176 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1496 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 862 IncrementalHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 680 mSDtfsCounter, 862 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 985 GetRequests, 947 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=4, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 80 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1303 NumberOfCodeBlocks, 1303 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 5919 SizeOfPredicates, 19 NumberOfNonLiveVariables, 573 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 19191/19194 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: 118]: Loop Invariant Derived loop invariant: (((((var_1_16 == 10) && (0 <= 0)) && (10 <= last_1_var_1_16)) && (0 == var_1_10)) || ((var_1_16 == var_1_18) && (0 == var_1_10))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (0 == var_1_10) Ensures: (0 == var_1_10) RESULT: Ultimate proved your program to be correct! [2024-10-14 11:06:08,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE