./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_fillercode_fillercodestructure_filler-ps-co_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_fillercode_fillercodestructure_filler-ps-co_file-95.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 16939203a06add21b495801307204d763da69843ccd8efdd13c6ae87cd9ca6cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:10:32,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:10:32,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:10:32,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:10:32,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:10:32,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:10:32,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:10:32,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:10:32,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:10:32,431 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:10:32,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:10:32,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:10:32,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:10:32,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:10:32,433 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:10:32,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:10:32,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:10:32,438 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:10:32,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:10:32,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:10:32,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:10:32,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:10:32,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:10:32,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:10:32,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:10:32,441 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:10:32,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:10:32,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:10:32,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:10:32,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:10:32,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:10:32,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:10:32,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:10:32,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:10:32,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:10:32,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:10:32,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:10:32,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:10:32,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:10:32,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:10:32,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:10:32,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:10:32,446 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 -> 16939203a06add21b495801307204d763da69843ccd8efdd13c6ae87cd9ca6cf [2024-10-13 03:10:32,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:10:32,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:10:32,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:10:32,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:10:32,758 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:10:32,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-95.i [2024-10-13 03:10:34,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:10:34,634 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:10:34,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-95.i [2024-10-13 03:10:34,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6822fa1c8/7caa742d043040b9abd1daa4f61d21a3/FLAG8afca3929 [2024-10-13 03:10:34,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6822fa1c8/7caa742d043040b9abd1daa4f61d21a3 [2024-10-13 03:10:34,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:10:34,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:10:34,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:10:34,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:10:34,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:10:34,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:10:34" (1/1) ... [2024-10-13 03:10:34,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36db0d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:34, skipping insertion in model container [2024-10-13 03:10:34,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:10:34" (1/1) ... [2024-10-13 03:10:34,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:10:34,917 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_fillercode_fillercodestructure_filler-ps-co_file-95.i[919,932] [2024-10-13 03:10:35,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:10:35,070 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:10:35,083 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_fillercode_fillercodestructure_filler-ps-co_file-95.i[919,932] [2024-10-13 03:10:35,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:10:35,173 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:10:35,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35 WrapperNode [2024-10-13 03:10:35,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:10:35,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:10:35,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:10:35,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:10:35,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35" (1/1) ... [2024-10-13 03:10:35,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35" (1/1) ... [2024-10-13 03:10:35,268 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2024-10-13 03:10:35,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:10:35,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:10:35,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:10:35,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:10:35,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35" (1/1) ... [2024-10-13 03:10:35,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35" (1/1) ... [2024-10-13 03:10:35,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35" (1/1) ... [2024-10-13 03:10:35,329 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-13 03:10:35,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35" (1/1) ... [2024-10-13 03:10:35,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35" (1/1) ... [2024-10-13 03:10:35,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35" (1/1) ... [2024-10-13 03:10:35,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35" (1/1) ... [2024-10-13 03:10:35,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35" (1/1) ... [2024-10-13 03:10:35,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35" (1/1) ... [2024-10-13 03:10:35,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:10:35,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:10:35,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:10:35,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:10:35,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35" (1/1) ... [2024-10-13 03:10:35,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:10:35,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:10:35,416 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-13 03:10:35,419 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-13 03:10:35,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:10:35,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:10:35,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:10:35,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:10:35,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:10:35,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:10:35,563 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:10:35,566 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:10:36,104 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 03:10:36,104 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:10:36,145 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:10:36,146 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:10:36,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:10:36 BoogieIcfgContainer [2024-10-13 03:10:36,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:10:36,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:10:36,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:10:36,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:10:36,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:10:34" (1/3) ... [2024-10-13 03:10:36,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c1b3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:10:36, skipping insertion in model container [2024-10-13 03:10:36,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:35" (2/3) ... [2024-10-13 03:10:36,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c1b3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:10:36, skipping insertion in model container [2024-10-13 03:10:36,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:10:36" (3/3) ... [2024-10-13 03:10:36,158 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-95.i [2024-10-13 03:10:36,177 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:10:36,177 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:10:36,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:10:36,259 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;@308ec469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:10:36,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:10:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 03:10:36,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-13 03:10:36,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:10:36,281 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:10:36,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:10:36,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:10:36,287 INFO L85 PathProgramCache]: Analyzing trace with hash 824086884, now seen corresponding path program 1 times [2024-10-13 03:10:36,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:10:36,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310897974] [2024-10-13 03:10:36,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:10:36,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:10:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:10:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 03:10:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 03:10:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 03:10:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:10:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:10:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:10:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:10:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:10:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:10:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:10:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:10:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:10:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:10:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:10:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:10:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:10:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:10:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:10:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:10:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:10:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:10:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:10:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:10:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:10:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:10:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:10:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 03:10:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 03:10:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 03:10:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 03:10:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 03:10:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 03:10:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-13 03:10:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 03:10:36,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:10:36,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310897974] [2024-10-13 03:10:36,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310897974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:10:36,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:10:36,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:10:36,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520560034] [2024-10-13 03:10:36,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:10:36,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:10:36,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:10:36,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:10:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:10:36,985 INFO L87 Difference]: Start difference. First operand has 101 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 03:10:37,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:10:37,036 INFO L93 Difference]: Finished difference Result 198 states and 356 transitions. [2024-10-13 03:10:37,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:10:37,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 214 [2024-10-13 03:10:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:10:37,048 INFO L225 Difference]: With dead ends: 198 [2024-10-13 03:10:37,049 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 03:10:37,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-13 03:10:37,063 INFO L432 NwaCegarLoop]: 152 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, 152 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-13 03:10:37,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:10:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 03:10:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-13 03:10:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 03:10:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 155 transitions. [2024-10-13 03:10:37,116 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 155 transitions. Word has length 214 [2024-10-13 03:10:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:10:37,117 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 155 transitions. [2024-10-13 03:10:37,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 03:10:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2024-10-13 03:10:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-13 03:10:37,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:10:37,127 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:10:37,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:10:37,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:10:37,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:10:37,129 INFO L85 PathProgramCache]: Analyzing trace with hash -320549732, now seen corresponding path program 1 times [2024-10-13 03:10:37,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:10:37,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400058815] [2024-10-13 03:10:37,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:10:37,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:10:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:10:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 03:10:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 03:10:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 03:10:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:10:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:10:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:10:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:10:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:10:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:10:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:10:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:10:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:10:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:10:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:10:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:10:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:10:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:10:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:10:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:10:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:10:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:10:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:37,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:10:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:38,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:10:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:38,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:10:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:38,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:10:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:38,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:10:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:38,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 03:10:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:38,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 03:10:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:38,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 03:10:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:38,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 03:10:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:38,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 03:10:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:38,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 03:10:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:38,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-13 03:10:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 03:10:38,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:10:38,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400058815] [2024-10-13 03:10:38,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400058815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:10:38,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:10:38,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:10:38,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50729768] [2024-10-13 03:10:38,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:10:38,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:10:38,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:10:38,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:10:38,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:10:38,103 INFO L87 Difference]: Start difference. First operand 98 states and 155 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 03:10:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:10:38,459 INFO L93 Difference]: Finished difference Result 293 states and 464 transitions. [2024-10-13 03:10:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:10:38,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2024-10-13 03:10:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:10:38,468 INFO L225 Difference]: With dead ends: 293 [2024-10-13 03:10:38,469 INFO L226 Difference]: Without dead ends: 196 [2024-10-13 03:10:38,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:10:38,476 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 114 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:10:38,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 410 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:10:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-13 03:10:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2024-10-13 03:10:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 108 states have internal predecessors, (150), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 03:10:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 286 transitions. [2024-10-13 03:10:38,541 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 286 transitions. Word has length 214 [2024-10-13 03:10:38,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:10:38,543 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 286 transitions. [2024-10-13 03:10:38,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 03:10:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 286 transitions. [2024-10-13 03:10:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-13 03:10:38,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:10:38,550 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:10:38,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:10:38,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:10:38,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:10:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash 72477278, now seen corresponding path program 1 times [2024-10-13 03:10:38,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:10:38,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125774550] [2024-10-13 03:10:38,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:10:38,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:10:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat