./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-co_file-45.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-co_file-45.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 2db33e14cce996f3ff7abd9391c3db4ba409c9c54c5b298c8b705984adf93aa7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:59:10,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:59:10,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:59:10,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:59:10,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:59:10,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:59:10,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:59:10,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:59:10,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:59:10,913 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:59:10,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:59:10,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:59:10,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:59:10,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:59:10,916 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:59:10,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:59:10,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:59:10,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:59:10,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:59:10,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:59:10,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:59:10,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:59:10,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:59:10,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:59:10,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:59:10,922 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:59:10,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:59:10,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:59:10,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:59:10,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:59:10,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:59:10,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:59:10,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:59:10,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:59:10,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:59:10,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:59:10,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:59:10,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:59:10,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:59:10,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:59:10,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:59:10,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:59:10,926 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 -> 2db33e14cce996f3ff7abd9391c3db4ba409c9c54c5b298c8b705984adf93aa7 [2024-10-13 01:59:11,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:59:11,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:59:11,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:59:11,206 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:59:11,206 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:59:11,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-45.i [2024-10-13 01:59:12,675 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:59:12,890 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:59:12,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-45.i [2024-10-13 01:59:12,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27594207f/13d1d4b4770b42949d65d3931d04b162/FLAG613d838cf [2024-10-13 01:59:13,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27594207f/13d1d4b4770b42949d65d3931d04b162 [2024-10-13 01:59:13,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:59:13,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:59:13,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:59:13,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:59:13,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:59:13,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:59:13" (1/1) ... [2024-10-13 01:59:13,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e60bf36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:59:13, skipping insertion in model container [2024-10-13 01:59:13,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:59:13" (1/1) ... [2024-10-13 01:59:13,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:59:13,508 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-co_file-45.i[919,932] [2024-10-13 01:59:13,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:59:13,595 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:59:13,605 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-co_file-45.i[919,932] [2024-10-13 01:59:13,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:59:13,668 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:59:13,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:59:13 WrapperNode [2024-10-13 01:59:13,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:59:13,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:59:13,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:59:13,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:59:13,677 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:59:13" (1/1) ... [2024-10-13 01:59:13,688 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:59:13" (1/1) ... [2024-10-13 01:59:13,723 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-10-13 01:59:13,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:59:13,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:59:13,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:59:13,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:59:13,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:59:13" (1/1) ... [2024-10-13 01:59:13,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:59:13" (1/1) ... [2024-10-13 01:59:13,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:59:13" (1/1) ... [2024-10-13 01:59:13,762 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:59:13,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:59:13" (1/1) ... [2024-10-13 01:59:13,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:59:13" (1/1) ... [2024-10-13 01:59:13,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:59:13" (1/1) ... [2024-10-13 01:59:13,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:59:13" (1/1) ... [2024-10-13 01:59:13,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:59:13" (1/1) ... [2024-10-13 01:59:13,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:59:13" (1/1) ... [2024-10-13 01:59:13,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:59:13,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:59:13,788 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:59:13,788 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:59:13,789 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:59:13" (1/1) ... [2024-10-13 01:59:13,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:59:13,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:59:13,830 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:59:13,834 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:59:13,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:59:13,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:59:13,883 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:59:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:59:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:59:13,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:59:13,978 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:59:13,980 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:59:14,358 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 01:59:14,358 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:59:14,423 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:59:14,423 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:59:14,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:59:14 BoogieIcfgContainer [2024-10-13 01:59:14,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:59:14,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:59:14,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:59:14,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:59:14,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:59:13" (1/3) ... [2024-10-13 01:59:14,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431d1fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:59:14, skipping insertion in model container [2024-10-13 01:59:14,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:59:13" (2/3) ... [2024-10-13 01:59:14,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431d1fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:59:14, skipping insertion in model container [2024-10-13 01:59:14,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:59:14" (3/3) ... [2024-10-13 01:59:14,435 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-45.i [2024-10-13 01:59:14,449 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:59:14,449 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:59:14,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:59:14,516 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;@3cd33b5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:59:14,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:59:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 01:59:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-13 01:59:14,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:59:14,550 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:14,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:59:14,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:59:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1928393994, now seen corresponding path program 1 times [2024-10-13 01:59:14,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:59:14,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355401521] [2024-10-13 01:59:14,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:59:14,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:59:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:59:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:59:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:59:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:59:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:59:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:59:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:59:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:59:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:59:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:59:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:59:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:59:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:59:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:59:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:59:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:59:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:59:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:59:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:59:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:59:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:59:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:59:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 01:59:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:59:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 01:59:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 01:59:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 01:59:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 01:59:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 01:59:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 01:59:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:59:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 01:59:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 01:59:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 01:59:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 01:59:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-13 01:59:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:59:15,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355401521] [2024-10-13 01:59:15,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355401521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:59:15,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:59:15,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:59:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318115936] [2024-10-13 01:59:15,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:59:15,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:59:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:59:15,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:59:15,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:59:15,279 INFO L87 Difference]: Start difference. First operand has 92 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-13 01:59:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:59:15,334 INFO L93 Difference]: Finished difference Result 181 states and 329 transitions. [2024-10-13 01:59:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:59:15,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 218 [2024-10-13 01:59:15,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:59:15,348 INFO L225 Difference]: With dead ends: 181 [2024-10-13 01:59:15,348 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 01:59:15,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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:59:15,361 INFO L432 NwaCegarLoop]: 139 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, 139 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:59:15,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:59:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 01:59:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 01:59:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 01:59:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 142 transitions. [2024-10-13 01:59:15,411 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 142 transitions. Word has length 218 [2024-10-13 01:59:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:59:15,412 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 142 transitions. [2024-10-13 01:59:15,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-13 01:59:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 142 transitions. [2024-10-13 01:59:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-13 01:59:15,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:59:15,417 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:15,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:59:15,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:59:15,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:59:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash 981952128, now seen corresponding path program 1 times [2024-10-13 01:59:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:59:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225100087] [2024-10-13 01:59:15,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:59:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:59:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:59:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:59:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:59:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:59:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:59:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:59:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:59:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:59:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:59:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:59:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:59:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:59:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:59:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:59:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:59:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:59:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:59:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:59:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:59:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:59:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:59:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:59:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 01:59:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:59:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 01:59:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 01:59:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 01:59:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 01:59:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 01:59:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 01:59:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:59:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 01:59:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 01:59:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 01:59:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 01:59:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:59:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-13 01:59:15,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:59:15,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225100087] [2024-10-13 01:59:15,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225100087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:59:15,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:59:15,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:59:15,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504475991] [2024-10-13 01:59:15,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:59:15,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:59:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:59:15,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:59:15,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:59:15,874 INFO L87 Difference]: Start difference. First operand 90 states and 142 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-13 01:59:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:59:15,975 INFO L93 Difference]: Finished difference Result 263 states and 414 transitions. [2024-10-13 01:59:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:59:15,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2024-10-13 01:59:15,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:59:15,982 INFO L225 Difference]: With dead ends: 263 [2024-10-13 01:59:15,983 INFO L226 Difference]: Without dead ends: 174 [2024-10-13 01:59:15,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:59:15,988 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 127 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:59:15,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 271 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:59:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-13 01:59:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2024-10-13 01:59:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 99 states have (on average 1.2828282828282829) internal successors, (127), 99 states have internal predecessors, (127), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 01:59:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 267 transitions. [2024-10-13 01:59:16,045 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 267 transitions. Word has length 218 [2024-10-13 01:59:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:59:16,046 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 267 transitions. [2024-10-13 01:59:16,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-13 01:59:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 267 transitions. [2024-10-13 01:59:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-13 01:59:16,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:59:16,053 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:16,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:59:16,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:59:16,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:59:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1553220369, now seen corresponding path program 1 times [2024-10-13 01:59:16,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:59:16,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57975523] [2024-10-13 01:59:16,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:59:16,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:59:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat