./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-pe-ci_file-66.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-pe-ci_file-66.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 e9f5cbcd9b5e7070eed068152e26dc672bc2b60288a251274726ceb1bf0c8d9b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:39:24,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:39:24,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:39:24,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:39:24,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:39:24,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:39:24,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:39:24,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:39:24,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:39:24,586 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:39:24,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:39:24,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:39:24,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:39:24,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:39:24,590 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:39:24,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:39:24,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:39:24,591 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:39:24,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:39:24,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:39:24,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:39:24,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:39:24,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:39:24,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:39:24,594 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:39:24,595 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:39:24,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:39:24,595 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:39:24,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:39:24,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:39:24,599 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:39:24,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:39:24,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:39:24,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:39:24,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:39:24,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:39:24,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:39:24,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:39:24,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:39:24,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:39:24,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:39:24,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:39:24,603 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 -> e9f5cbcd9b5e7070eed068152e26dc672bc2b60288a251274726ceb1bf0c8d9b [2024-10-13 01:39:24,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:39:24,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:39:24,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:39:24,900 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:39:24,900 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:39:24,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2024-10-13 01:39:26,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:39:26,706 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:39:26,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2024-10-13 01:39:26,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c0e539a/c9c9894597db4b19b9a0f06798d3a8b8/FLAG27626b7a4 [2024-10-13 01:39:26,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c0e539a/c9c9894597db4b19b9a0f06798d3a8b8 [2024-10-13 01:39:26,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:39:26,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:39:26,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:39:26,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:39:26,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:39:26,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:39:26" (1/1) ... [2024-10-13 01:39:26,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672ccbb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:26, skipping insertion in model container [2024-10-13 01:39:26,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:39:26" (1/1) ... [2024-10-13 01:39:26,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:39:26,947 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-pe-ci_file-66.i[919,932] [2024-10-13 01:39:27,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:39:27,031 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:39:27,043 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-pe-ci_file-66.i[919,932] [2024-10-13 01:39:27,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:39:27,100 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:39:27,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27 WrapperNode [2024-10-13 01:39:27,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:39:27,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:39:27,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:39:27,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:39:27,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27" (1/1) ... [2024-10-13 01:39:27,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27" (1/1) ... [2024-10-13 01:39:27,161 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-10-13 01:39:27,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:39:27,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:39:27,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:39:27,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:39:27,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27" (1/1) ... [2024-10-13 01:39:27,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27" (1/1) ... [2024-10-13 01:39:27,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27" (1/1) ... [2024-10-13 01:39:27,201 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 01:39:27,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27" (1/1) ... [2024-10-13 01:39:27,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27" (1/1) ... [2024-10-13 01:39:27,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27" (1/1) ... [2024-10-13 01:39:27,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27" (1/1) ... [2024-10-13 01:39:27,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27" (1/1) ... [2024-10-13 01:39:27,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27" (1/1) ... [2024-10-13 01:39:27,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:39:27,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:39:27,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:39:27,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:39:27,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27" (1/1) ... [2024-10-13 01:39:27,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:39:27,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:39:27,270 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 01:39:27,276 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 01:39:27,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:39:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:39:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:39:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:39:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:39:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:39:27,434 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:39:27,444 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:39:27,871 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 01:39:27,871 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:39:27,958 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:39:27,959 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:39:27,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:39:27 BoogieIcfgContainer [2024-10-13 01:39:27,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:39:27,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:39:27,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:39:27,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:39:27,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:39:26" (1/3) ... [2024-10-13 01:39:27,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c54c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:39:27, skipping insertion in model container [2024-10-13 01:39:27,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:39:27" (2/3) ... [2024-10-13 01:39:27,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c54c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:39:27, skipping insertion in model container [2024-10-13 01:39:27,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:39:27" (3/3) ... [2024-10-13 01:39:27,971 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2024-10-13 01:39:27,988 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:39:27,988 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:39:28,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:39:28,072 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;@39f4d5a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:39:28,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:39:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 51 states have internal predecessors, (78), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 01:39:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 01:39:28,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:39:28,094 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:39:28,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:39:28,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:39:28,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1319692166, now seen corresponding path program 1 times [2024-10-13 01:39:28,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:39:28,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997512719] [2024-10-13 01:39:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:39:28,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:39:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:39:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:39:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:39:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:39:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:39:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:39:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:39:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:39:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:39:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:39:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:39:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:39:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:39:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:39:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:39:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:39:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:39:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:39:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:39:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 01:39:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:39:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:39:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:39:28,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:39:28,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997512719] [2024-10-13 01:39:28,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997512719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:39:28,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:39:28,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:39:28,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566460684] [2024-10-13 01:39:28,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:39:28,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:39:28,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:39:28,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:39:28,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:39:28,651 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 51 states have internal predecessors, (78), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 01:39:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:39:28,703 INFO L93 Difference]: Finished difference Result 147 states and 264 transitions. [2024-10-13 01:39:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:39:28,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2024-10-13 01:39:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:39:28,717 INFO L225 Difference]: With dead ends: 147 [2024-10-13 01:39:28,718 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 01:39:28,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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 01:39:28,727 INFO L432 NwaCegarLoop]: 114 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, 114 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 01:39:28,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:39:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 01:39:28,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-13 01:39:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.489795918367347) internal successors, (73), 49 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 01:39:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 117 transitions. [2024-10-13 01:39:28,778 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 117 transitions. Word has length 145 [2024-10-13 01:39:28,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:39:28,779 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 117 transitions. [2024-10-13 01:39:28,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 01:39:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 117 transitions. [2024-10-13 01:39:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 01:39:28,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:39:28,788 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:39:28,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:39:28,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:39:28,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:39:28,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1833116930, now seen corresponding path program 1 times [2024-10-13 01:39:28,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:39:28,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937322238] [2024-10-13 01:39:28,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:39:28,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:39:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:39:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:39:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:39:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:39:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:39:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:39:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:39:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:39:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:39:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:39:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:39:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:39:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:39:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:39:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:39:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:39:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:39:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:39:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:39:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 01:39:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:39:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:39:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:39:29,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:39:29,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937322238] [2024-10-13 01:39:29,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937322238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:39:29,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:39:29,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:39:29,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170335196] [2024-10-13 01:39:29,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:39:29,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:39:29,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:39:29,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:39:29,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:39:29,319 INFO L87 Difference]: Start difference. First operand 73 states and 117 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 01:39:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:39:29,541 INFO L93 Difference]: Finished difference Result 181 states and 287 transitions. [2024-10-13 01:39:29,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:39:29,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2024-10-13 01:39:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:39:29,548 INFO L225 Difference]: With dead ends: 181 [2024-10-13 01:39:29,549 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 01:39:29,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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 01:39:29,552 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 132 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:39:29,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 200 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:39:29,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 01:39:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2024-10-13 01:39:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:39:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2024-10-13 01:39:29,588 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 145 [2024-10-13 01:39:29,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:39:29,589 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2024-10-13 01:39:29,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 01:39:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-10-13 01:39:29,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 01:39:29,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:39:29,595 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:39:29,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:39:29,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:39:29,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:39:29,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1652503740, now seen corresponding path program 1 times [2024-10-13 01:39:29,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:39:29,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328232996] [2024-10-13 01:39:29,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:39:29,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:39:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:39:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:39:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:39:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:39:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:39:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:39:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:39:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:39:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:39:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:39:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:39:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:39:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:39:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:39:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:39:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:39:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:39:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:39:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:39:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 01:39:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:39:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:39:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:39:30,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:39:30,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328232996] [2024-10-13 01:39:30,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328232996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:39:30,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:39:30,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 01:39:30,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60233317] [2024-10-13 01:39:30,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:39:30,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 01:39:30,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:39:30,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 01:39:30,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:39:30,323 INFO L87 Difference]: Start difference. First operand 106 states and 167 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:39:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:39:30,898 INFO L93 Difference]: Finished difference Result 368 states and 550 transitions. [2024-10-13 01:39:30,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 01:39:30,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-10-13 01:39:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:39:30,907 INFO L225 Difference]: With dead ends: 368 [2024-10-13 01:39:30,908 INFO L226 Difference]: Without dead ends: 263 [2024-10-13 01:39:30,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-13 01:39:30,911 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 205 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:39:30,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 373 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 01:39:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-13 01:39:30,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 167. [2024-10-13 01:39:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 126 states have (on average 1.492063492063492) internal successors, (188), 129 states have internal predecessors, (188), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 01:39:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 260 transitions. [2024-10-13 01:39:30,963 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 260 transitions. Word has length 145 [2024-10-13 01:39:30,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:39:30,964 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 260 transitions. [2024-10-13 01:39:30,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:39:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 260 transitions. [2024-10-13 01:39:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 01:39:30,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:39:30,967 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:39:30,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:39:30,967 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:39:30,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:39:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash 959554289, now seen corresponding path program 1 times [2024-10-13 01:39:30,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:39:30,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8632859] [2024-10-13 01:39:30,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:39:30,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:39:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:40:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:40:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 01:40:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:40:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:40:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:40:37,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:37,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8632859] [2024-10-13 01:40:37,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8632859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:37,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:37,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-13 01:40:37,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106682246] [2024-10-13 01:40:37,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:37,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 01:40:37,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:37,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 01:40:37,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2024-10-13 01:40:37,784 INFO L87 Difference]: Start difference. First operand 167 states and 260 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 01:40:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:55,322 INFO L93 Difference]: Finished difference Result 1319 states and 2099 transitions. [2024-10-13 01:40:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-13 01:40:55,323 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 146 [2024-10-13 01:40:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:55,333 INFO L225 Difference]: With dead ends: 1319 [2024-10-13 01:40:55,333 INFO L226 Difference]: Without dead ends: 1153 [2024-10-13 01:40:55,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=850, Invalid=1700, Unknown=0, NotChecked=0, Total=2550 [2024-10-13 01:40:55,338 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1119 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:55,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 361 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-13 01:40:55,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-10-13 01:40:55,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 400. [2024-10-13 01:40:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 339 states have (on average 1.5486725663716814) internal successors, (525), 346 states have internal predecessors, (525), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 45 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 01:40:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 629 transitions. [2024-10-13 01:40:55,403 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 629 transitions. Word has length 146 [2024-10-13 01:40:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:55,404 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 629 transitions. [2024-10-13 01:40:55,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 01:40:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 629 transitions. [2024-10-13 01:40:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 01:40:55,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:55,407 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:40:55,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 01:40:55,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:55,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:55,408 INFO L85 PathProgramCache]: Analyzing trace with hash 555600659, now seen corresponding path program 1 times [2024-10-13 01:40:55,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:55,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56937918] [2024-10-13 01:40:55,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:55,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat