./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-31.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-31.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 6a7974064a8971bceca2aca98594e85fbf3a77834158073b9b1833f7bdef4f33 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:57:31,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:57:31,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:57:31,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:57:31,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:57:31,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:57:31,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:57:31,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:57:31,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:57:31,154 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:57:31,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:57:31,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:57:31,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:57:31,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:57:31,156 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:57:31,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:57:31,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:57:31,157 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:57:31,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:57:31,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:57:31,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:57:31,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:57:31,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:57:31,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:57:31,164 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:57:31,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:57:31,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:57:31,165 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:57:31,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:57:31,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:57:31,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:57:31,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:57:31,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:57:31,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:57:31,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:57:31,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:57:31,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:57:31,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:57:31,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:57:31,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:57:31,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:57:31,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:57:31,170 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 -> 6a7974064a8971bceca2aca98594e85fbf3a77834158073b9b1833f7bdef4f33 [2024-10-13 01:57:31,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:57:31,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:57:31,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:57:31,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:57:31,472 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:57:31,473 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-31.i [2024-10-13 01:57:32,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:57:33,197 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:57:33,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-31.i [2024-10-13 01:57:33,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9afd97a/c8cda87817cb4f6c9b755036d0d7458b/FLAGf7a03f1ac [2024-10-13 01:57:33,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9afd97a/c8cda87817cb4f6c9b755036d0d7458b [2024-10-13 01:57:33,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:57:33,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:57:33,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:57:33,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:57:33,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:57:33,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:57:33" (1/1) ... [2024-10-13 01:57:33,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7a47b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:33, skipping insertion in model container [2024-10-13 01:57:33,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:57:33" (1/1) ... [2024-10-13 01:57:33,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:57:33,454 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-31.i[919,932] [2024-10-13 01:57:33,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:57:33,552 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:57:33,563 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-31.i[919,932] [2024-10-13 01:57:33,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:57:33,621 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:57:33,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:33 WrapperNode [2024-10-13 01:57:33,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:57:33,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:57:33,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:57:33,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:57:33,631 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:57:33" (1/1) ... [2024-10-13 01:57:33,646 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:57:33" (1/1) ... [2024-10-13 01:57:33,701 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 266 [2024-10-13 01:57:33,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:57:33,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:57:33,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:57:33,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:57:33,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:33" (1/1) ... [2024-10-13 01:57:33,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:33" (1/1) ... [2024-10-13 01:57:33,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:33" (1/1) ... [2024-10-13 01:57:33,744 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:57:33,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:33" (1/1) ... [2024-10-13 01:57:33,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:33" (1/1) ... [2024-10-13 01:57:33,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:57:33" (1/1) ... [2024-10-13 01:57:33,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:33" (1/1) ... [2024-10-13 01:57:33,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:33" (1/1) ... [2024-10-13 01:57:33,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:33" (1/1) ... [2024-10-13 01:57:33,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:57:33,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:57:33,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:57:33,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:57:33,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:33" (1/1) ... [2024-10-13 01:57:33,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:57:33,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:57:33,843 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:57:33,846 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:57:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:57:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:57:33,899 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:57:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:57:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:57:33,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:57:34,014 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:57:34,016 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:57:34,553 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 01:57:34,553 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:57:34,587 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:57:34,587 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:57:34,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:57:34 BoogieIcfgContainer [2024-10-13 01:57:34,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:57:34,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:57:34,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:57:34,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:57:34,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:57:33" (1/3) ... [2024-10-13 01:57:34,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c7a671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:57:34, skipping insertion in model container [2024-10-13 01:57:34,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:33" (2/3) ... [2024-10-13 01:57:34,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c7a671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:57:34, skipping insertion in model container [2024-10-13 01:57:34,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:57:34" (3/3) ... [2024-10-13 01:57:34,596 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-31.i [2024-10-13 01:57:34,622 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:57:34,622 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:57:34,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:57:34,717 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;@43fb6f98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:57:34,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:57:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 64 states have internal predecessors, (90), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 01:57:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-10-13 01:57:34,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:57:34,742 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:34,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:57:34,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:57:34,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1646688741, now seen corresponding path program 1 times [2024-10-13 01:57:34,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:57:34,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23729629] [2024-10-13 01:57:34,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:57:34,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:57:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:57:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:57:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:57:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:57:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:57:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:57:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:57:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:57:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:57:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:57:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:57:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:57:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:57:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:57:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:57:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:57:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:57:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:57:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:57:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 01:57:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:57:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 01:57:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:57:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 01:57:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 01:57:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:57:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:57:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:57:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:57:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 01:57:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:57:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 01:57:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:57:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 01:57:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 01:57:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 01:57:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-13 01:57:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 01:57:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 01:57:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 01:57:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-10-13 01:57:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-13 01:57:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-13 01:57:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-13 01:57:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-13 01:57:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-13 01:57:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-13 01:57:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-13 01:57:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-10-13 01:57:35,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:57:35,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23729629] [2024-10-13 01:57:35,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23729629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:57:35,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:57:35,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:57:35,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715684416] [2024-10-13 01:57:35,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:57:35,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:57:35,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:57:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:57:35,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:57:35,463 INFO L87 Difference]: Start difference. First operand has 114 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 64 states have internal predecessors, (90), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-13 01:57:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:57:35,520 INFO L93 Difference]: Finished difference Result 225 states and 418 transitions. [2024-10-13 01:57:35,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:57:35,523 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 286 [2024-10-13 01:57:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:57:35,531 INFO L225 Difference]: With dead ends: 225 [2024-10-13 01:57:35,531 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 01:57:35,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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:57:35,539 INFO L432 NwaCegarLoop]: 178 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, 178 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:57:35,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:57:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 01:57:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-13 01:57:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 01:57:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 181 transitions. [2024-10-13 01:57:35,613 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 181 transitions. Word has length 286 [2024-10-13 01:57:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:57:35,614 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 181 transitions. [2024-10-13 01:57:35,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-13 01:57:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 181 transitions. [2024-10-13 01:57:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-10-13 01:57:35,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:57:35,621 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:35,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:57:35,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:57:35,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:57:35,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1280057317, now seen corresponding path program 1 times [2024-10-13 01:57:35,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:57:35,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711196497] [2024-10-13 01:57:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:57:35,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:57:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:57:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:57:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:57:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:57:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:57:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:57:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:57:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:57:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:57:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:57:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:57:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:57:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:57:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:57:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:57:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:57:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:57:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:35,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:57:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:57:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 01:57:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:57:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 01:57:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:57:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 01:57:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 01:57:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:57:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:57:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:57:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:57:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 01:57:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:57:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 01:57:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:57:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 01:57:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 01:57:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 01:57:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-13 01:57:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 01:57:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 01:57:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 01:57:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-10-13 01:57:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-13 01:57:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-13 01:57:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-13 01:57:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-13 01:57:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-13 01:57:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-13 01:57:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-13 01:57:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-10-13 01:57:36,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:57:36,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711196497] [2024-10-13 01:57:36,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711196497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:57:36,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:57:36,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:57:36,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294958573] [2024-10-13 01:57:36,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:57:36,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:57:36,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:57:36,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:57:36,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:57:36,178 INFO L87 Difference]: Start difference. First operand 112 states and 181 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-10-13 01:57:36,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:57:36,276 INFO L93 Difference]: Finished difference Result 333 states and 539 transitions. [2024-10-13 01:57:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:57:36,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 286 [2024-10-13 01:57:36,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:57:36,284 INFO L225 Difference]: With dead ends: 333 [2024-10-13 01:57:36,284 INFO L226 Difference]: Without dead ends: 222 [2024-10-13 01:57:36,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 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:57:36,291 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 171 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:57:36,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 512 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:57:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-13 01:57:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 116. [2024-10-13 01:57:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 01:57:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 186 transitions. [2024-10-13 01:57:36,338 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 186 transitions. Word has length 286 [2024-10-13 01:57:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:57:36,343 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 186 transitions. [2024-10-13 01:57:36,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-10-13 01:57:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 186 transitions. [2024-10-13 01:57:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-10-13 01:57:36,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:57:36,349 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:36,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:57:36,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:57:36,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:57:36,351 INFO L85 PathProgramCache]: Analyzing trace with hash 193639, now seen corresponding path program 1 times [2024-10-13 01:57:36,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:57:36,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345654000] [2024-10-13 01:57:36,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:57:36,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:57:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:57:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:57:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:57:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:57:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:57:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:57:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:57:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:57:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:57:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:57:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:57:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:57:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:57:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:57:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:57:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:57:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:57:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:57:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:57:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 01:57:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:57:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 01:57:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:57:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 01:57:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 01:57:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:36,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:57:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:57:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:57:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:57:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 01:57:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:57:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 01:57:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:57:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 01:57:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 01:57:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 01:57:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-13 01:57:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 01:57:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 01:57:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 01:57:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-10-13 01:57:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-13 01:57:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-13 01:57:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-13 01:57:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-13 01:57:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-13 01:57:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-13 01:57:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-13 01:57:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:57:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-10-13 01:57:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:57:37,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345654000] [2024-10-13 01:57:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345654000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:57:37,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:57:37,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:57:37,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541370075] [2024-10-13 01:57:37,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:57:37,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:57:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:57:37,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:57:37,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:57:37,082 INFO L87 Difference]: Start difference. First operand 116 states and 186 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-10-13 01:57:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:57:37,132 INFO L93 Difference]: Finished difference Result 231 states and 371 transitions. [2024-10-13 01:57:37,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:57:37,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 286 [2024-10-13 01:57:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:57:37,137 INFO L225 Difference]: With dead ends: 231 [2024-10-13 01:57:37,137 INFO L226 Difference]: Without dead ends: 116 [2024-10-13 01:57:37,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 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:57:37,142 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:57:37,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:57:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-13 01:57:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-13 01:57:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 01:57:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 185 transitions. [2024-10-13 01:57:37,166 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 185 transitions. Word has length 286 [2024-10-13 01:57:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:57:37,167 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 185 transitions. [2024-10-13 01:57:37,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-10-13 01:57:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 185 transitions. [2024-10-13 01:57:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-10-13 01:57:37,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:57:37,174 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:37,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:57:37,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:57:37,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:57:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash 57451941, now seen corresponding path program 1 times [2024-10-13 01:57:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:57:37,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830232883] [2024-10-13 01:57:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:57:37,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:57:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat