./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8880bc6b55ab6b26a36a9709c52577c78f4355aea8bee56c9643da00ec93f3ee --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:19:33,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:19:33,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:19:33,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:19:33,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:19:33,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:19:33,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:19:33,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:19:33,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:19:33,614 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:19:33,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:19:33,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:19:33,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:19:33,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:19:33,618 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:19:33,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:19:33,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:19:33,619 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:19:33,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:19:33,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:19:33,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:19:33,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:19:33,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:19:33,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:19:33,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:19:33,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:19:33,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:19:33,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:19:33,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:19:33,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:19:33,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:19:33,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:19:33,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:19:33,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:19:33,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:19:33,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:19:33,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:19:33,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:19:33,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:19:33,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:19:33,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:19:33,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:19:33,630 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-clean/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-clean/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 -> 8880bc6b55ab6b26a36a9709c52577c78f4355aea8bee56c9643da00ec93f3ee [2024-10-11 10:19:33,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:19:33,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:19:33,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:19:33,929 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:19:33,930 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:19:33,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i [2024-10-11 10:19:35,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:19:35,633 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:19:35,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i [2024-10-11 10:19:35,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e92a57cc/822674b5403441d198da80e2fe4a8298/FLAG4b3c70ada [2024-10-11 10:19:35,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e92a57cc/822674b5403441d198da80e2fe4a8298 [2024-10-11 10:19:35,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:19:35,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:19:35,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:19:35,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:19:35,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:19:35,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:19:35" (1/1) ... [2024-10-11 10:19:35,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bc2865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:35, skipping insertion in model container [2024-10-11 10:19:35,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:19:35" (1/1) ... [2024-10-11 10:19:35,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:19:35,898 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i[919,932] [2024-10-11 10:19:35,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:19:35,993 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:19:36,009 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i[919,932] [2024-10-11 10:19:36,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:19:36,099 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:19:36,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36 WrapperNode [2024-10-11 10:19:36,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:19:36,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:19:36,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:19:36,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:19:36,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36" (1/1) ... [2024-10-11 10:19:36,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36" (1/1) ... [2024-10-11 10:19:36,172 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 318 [2024-10-11 10:19:36,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:19:36,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:19:36,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:19:36,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:19:36,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36" (1/1) ... [2024-10-11 10:19:36,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36" (1/1) ... [2024-10-11 10:19:36,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36" (1/1) ... [2024-10-11 10:19:36,242 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-11 10:19:36,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36" (1/1) ... [2024-10-11 10:19:36,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36" (1/1) ... [2024-10-11 10:19:36,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36" (1/1) ... [2024-10-11 10:19:36,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36" (1/1) ... [2024-10-11 10:19:36,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36" (1/1) ... [2024-10-11 10:19:36,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36" (1/1) ... [2024-10-11 10:19:36,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:19:36,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:19:36,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:19:36,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:19:36,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36" (1/1) ... [2024-10-11 10:19:36,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:19:36,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:19:36,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:19:36,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:19:36,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:19:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:19:36,385 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:19:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:19:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:19:36,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:19:36,502 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:19:36,504 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:19:37,051 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-11 10:19:37,052 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:19:37,091 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:19:37,091 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:19:37,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:19:37 BoogieIcfgContainer [2024-10-11 10:19:37,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:19:37,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:19:37,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:19:37,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:19:37,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:19:35" (1/3) ... [2024-10-11 10:19:37,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394a8709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:19:37, skipping insertion in model container [2024-10-11 10:19:37,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:19:36" (2/3) ... [2024-10-11 10:19:37,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394a8709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:19:37, skipping insertion in model container [2024-10-11 10:19:37,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:19:37" (3/3) ... [2024-10-11 10:19:37,104 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i [2024-10-11 10:19:37,121 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:19:37,122 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:19:37,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:19:37,191 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;@2e0923ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:19:37,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:19:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 10:19:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-11 10:19:37,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:19:37,212 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 10:19:37,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:19:37,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:19:37,217 INFO L85 PathProgramCache]: Analyzing trace with hash 699689785, now seen corresponding path program 1 times [2024-10-11 10:19:37,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:19:37,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954118037] [2024-10-11 10:19:37,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:19:37,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:19:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:19:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:19:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:19:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:19:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:19:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:19:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:19:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:19:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:19:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:19:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:19:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:19:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:19:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:19:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:19:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:19:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:19:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:19:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:19:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:19:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:19:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:19:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:19:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:19:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:19:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:19:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:19:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:19:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 10:19:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 10:19:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 10:19:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:19:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 10:19:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:19:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 10:19:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 10:19:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-11 10:19:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 10:19:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 10:19:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-11 10:19:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-11 10:19:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 10:19:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-10-11 10:19:37,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:19:37,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954118037] [2024-10-11 10:19:37,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954118037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:19:37,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:19:37,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:19:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224818549] [2024-10-11 10:19:37,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:19:37,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:19:37,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:19:38,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:19:38,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:19:38,008 INFO L87 Difference]: Start difference. First operand has 133 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-11 10:19:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:19:38,075 INFO L93 Difference]: Finished difference Result 263 states and 464 transitions. [2024-10-11 10:19:38,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:19:38,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 259 [2024-10-11 10:19:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:19:38,091 INFO L225 Difference]: With dead ends: 263 [2024-10-11 10:19:38,092 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 10:19:38,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-11 10:19:38,103 INFO L432 NwaCegarLoop]: 204 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, 204 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-11 10:19:38,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:19:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 10:19:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-11 10:19:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 87 states have internal predecessors, (123), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 10:19:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 207 transitions. [2024-10-11 10:19:38,171 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 207 transitions. Word has length 259 [2024-10-11 10:19:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:19:38,174 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 207 transitions. [2024-10-11 10:19:38,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-11 10:19:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 207 transitions. [2024-10-11 10:19:38,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-11 10:19:38,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:19:38,184 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 10:19:38,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:19:38,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:19:38,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:19:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash 764611057, now seen corresponding path program 1 times [2024-10-11 10:19:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:19:38,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587462523] [2024-10-11 10:19:38,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:19:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:19:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:19:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:19:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:19:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:19:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:19:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:19:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:19:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:19:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:19:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:19:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:19:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:19:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:19:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:19:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:19:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:19:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:19:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:19:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:19:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:19:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:19:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:19:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:19:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:19:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:19:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:19:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:19:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:19:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 10:19:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 10:19:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 10:19:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:19:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 10:19:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:19:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 10:19:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 10:19:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-11 10:19:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 10:19:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 10:19:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-11 10:19:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-11 10:19:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 10:19:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-10-11 10:19:38,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:19:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587462523] [2024-10-11 10:19:38,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587462523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:19:38,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:19:38,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:19:38,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959425367] [2024-10-11 10:19:38,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:19:38,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:19:38,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:19:38,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:19:38,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:19:38,961 INFO L87 Difference]: Start difference. First operand 131 states and 207 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-10-11 10:19:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:19:39,048 INFO L93 Difference]: Finished difference Result 361 states and 575 transitions. [2024-10-11 10:19:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:19:39,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 259 [2024-10-11 10:19:39,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:19:39,055 INFO L225 Difference]: With dead ends: 361 [2024-10-11 10:19:39,055 INFO L226 Difference]: Without dead ends: 231 [2024-10-11 10:19:39,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 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-11 10:19:39,060 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 91 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 393 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-11 10:19:39,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 393 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:19:39,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-11 10:19:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 211. [2024-10-11 10:19:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 10:19:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 334 transitions. [2024-10-11 10:19:39,115 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 334 transitions. Word has length 259 [2024-10-11 10:19:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:19:39,117 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 334 transitions. [2024-10-11 10:19:39,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-10-11 10:19:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 334 transitions. [2024-10-11 10:19:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-11 10:19:39,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:19:39,122 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 10:19:39,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:19:39,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:19:39,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:19:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash -821972559, now seen corresponding path program 1 times [2024-10-11 10:19:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:19:39,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295240679] [2024-10-11 10:19:39,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:19:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:19:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:19:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:19:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:19:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:19:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:19:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:19:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:19:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:19:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:19:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:19:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:19:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:19:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:19:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:19:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:19:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:19:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:19:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:19:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:19:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:19:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:19:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:19:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:19:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:19:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:19:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:19:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:19:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:19:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 10:19:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 10:19:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 10:19:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:19:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 10:19:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:19:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 10:19:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 10:19:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-11 10:19:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 10:19:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 10:19:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-11 10:19:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-11 10:19:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 10:19:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:19:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-10-11 10:19:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:19:39,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295240679] [2024-10-11 10:19:39,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295240679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:19:39,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:19:39,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:19:39,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999919729] [2024-10-11 10:19:39,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:19:39,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:19:39,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:19:39,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:19:39,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:19:39,663 INFO L87 Difference]: Start difference. First operand 211 states and 334 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-10-11 10:19:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:19:39,945 INFO L93 Difference]: Finished difference Result 392 states and 617 transitions. [2024-10-11 10:19:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:19:39,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 259 [2024-10-11 10:19:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:19:39,952 INFO L225 Difference]: With dead ends: 392 [2024-10-11 10:19:39,952 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 10:19:39,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:19:39,956 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 160 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:19:39,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 590 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:19:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 10:19:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 229. [2024-10-11 10:19:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 142 states have (on average 1.3661971830985915) internal successors, (194), 142 states have internal predecessors, (194), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 10:19:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 362 transitions. [2024-10-11 10:19:40,009 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 362 transitions. Word has length 259 [2024-10-11 10:19:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:19:40,010 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 362 transitions. [2024-10-11 10:19:40,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-10-11 10:19:40,010 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 362 transitions. [2024-10-11 10:19:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-11 10:19:40,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:19:40,017 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 10:19:40,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:19:40,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:19:40,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:19:40,022 INFO L85 PathProgramCache]: Analyzing trace with hash 247794240, now seen corresponding path program 1 times [2024-10-11 10:19:40,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:19:40,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949958242] [2024-10-11 10:19:40,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:19:40,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:19:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat