./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-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-36.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 2364c435fb9bcd7cfef0644ea76ce7e263a6cd5c1a02547d35c44f240523fee1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:03:24,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:03:24,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:03:24,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:03:24,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:03:24,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:03:24,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:03:24,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:03:24,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:03:24,681 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:03:24,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:03:24,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:03:24,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:03:24,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:03:24,682 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:03:24,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:03:24,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:03:24,685 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:03:24,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:03:24,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:03:24,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:03:24,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:03:24,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:03:24,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:03:24,689 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:03:24,689 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:03:24,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:03:24,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:03:24,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:03:24,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:03:24,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:03:24,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:03:24,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:03:24,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:03:24,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:03:24,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:03:24,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:03:24,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:03:24,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:03:24,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:03:24,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:03:24,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:03:24,695 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 -> 2364c435fb9bcd7cfef0644ea76ce7e263a6cd5c1a02547d35c44f240523fee1 [2024-10-13 03:03:24,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:03:25,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:03:25,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:03:25,014 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:03:25,015 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:03:25,016 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-36.i [2024-10-13 03:03:26,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:03:26,569 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:03:26,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-36.i [2024-10-13 03:03:26,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0153a4f/180dbcd92aaf4562830c6b26c7fbeb37/FLAGb880e8205 [2024-10-13 03:03:26,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0153a4f/180dbcd92aaf4562830c6b26c7fbeb37 [2024-10-13 03:03:26,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:03:26,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:03:26,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:03:26,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:03:26,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:03:26,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:03:26" (1/1) ... [2024-10-13 03:03:26,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dab7030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:26, skipping insertion in model container [2024-10-13 03:03:26,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:03:26" (1/1) ... [2024-10-13 03:03:26,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:03:27,124 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-36.i[919,932] [2024-10-13 03:03:27,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:03:27,232 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:03:27,244 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-36.i[919,932] [2024-10-13 03:03:27,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:03:27,321 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:03:27,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27 WrapperNode [2024-10-13 03:03:27,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:03:27,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:03:27,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:03:27,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:03:27,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27" (1/1) ... [2024-10-13 03:03:27,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27" (1/1) ... [2024-10-13 03:03:27,381 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 275 [2024-10-13 03:03:27,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:03:27,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:03:27,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:03:27,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:03:27,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27" (1/1) ... [2024-10-13 03:03:27,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27" (1/1) ... [2024-10-13 03:03:27,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27" (1/1) ... [2024-10-13 03:03:27,423 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:03:27,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27" (1/1) ... [2024-10-13 03:03:27,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27" (1/1) ... [2024-10-13 03:03:27,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27" (1/1) ... [2024-10-13 03:03:27,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27" (1/1) ... [2024-10-13 03:03:27,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27" (1/1) ... [2024-10-13 03:03:27,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27" (1/1) ... [2024-10-13 03:03:27,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:03:27,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:03:27,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:03:27,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:03:27,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27" (1/1) ... [2024-10-13 03:03:27,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:03:27,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:03:27,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:03:27,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:03:27,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:03:27,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:03:27,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:03:27,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:03:27,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:03:27,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:03:27,727 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:03:27,730 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:03:28,248 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 03:03:28,248 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:03:28,305 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:03:28,307 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:03:28,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:03:28 BoogieIcfgContainer [2024-10-13 03:03:28,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:03:28,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:03:28,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:03:28,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:03:28,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:03:26" (1/3) ... [2024-10-13 03:03:28,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ace2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:03:28, skipping insertion in model container [2024-10-13 03:03:28,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:03:27" (2/3) ... [2024-10-13 03:03:28,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ace2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:03:28, skipping insertion in model container [2024-10-13 03:03:28,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:03:28" (3/3) ... [2024-10-13 03:03:28,317 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-36.i [2024-10-13 03:03:28,333 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:03:28,333 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:03:28,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:03:28,407 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;@50192c1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:03:28,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:03:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 03:03:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-10-13 03:03:28,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:03:28,432 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:03:28,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:03:28,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:03:28,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1667395203, now seen corresponding path program 1 times [2024-10-13 03:03:28,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:03:28,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667422932] [2024-10-13 03:03:28,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:03:28,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:03:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:03:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:03:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:03:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 03:03:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:03:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 03:03:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 03:03:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 03:03:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 03:03:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 03:03:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:03:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:03:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 03:03:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:03:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:03:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:03:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 03:03:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:03:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 03:03:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:03:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:03:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:03:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 03:03:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:03:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 03:03:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:28,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:03:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 03:03:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 03:03:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 03:03:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-13 03:03:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 03:03:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-13 03:03:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-13 03:03:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-13 03:03:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-13 03:03:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 03:03:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 03:03:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 03:03:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-13 03:03:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-13 03:03:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-10-13 03:03:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-10-13 03:03:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-13 03:03:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-13 03:03:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-10-13 03:03:29,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:03:29,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667422932] [2024-10-13 03:03:29,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667422932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:03:29,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:03:29,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:03:29,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740393300] [2024-10-13 03:03:29,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:03:29,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:03:29,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:03:29,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:03:29,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:03:29,244 INFO L87 Difference]: Start difference. First operand has 115 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-13 03:03:29,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:03:29,312 INFO L93 Difference]: Finished difference Result 227 states and 412 transitions. [2024-10-13 03:03:29,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:03:29,317 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 272 [2024-10-13 03:03:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:03:29,327 INFO L225 Difference]: With dead ends: 227 [2024-10-13 03:03:29,328 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 03:03:29,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:03:29,336 INFO L432 NwaCegarLoop]: 176 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, 176 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:03:29,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:03:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 03:03:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-13 03:03:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 03:03:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 179 transitions. [2024-10-13 03:03:29,404 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 179 transitions. Word has length 272 [2024-10-13 03:03:29,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:03:29,404 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 179 transitions. [2024-10-13 03:03:29,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-13 03:03:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 179 transitions. [2024-10-13 03:03:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-10-13 03:03:29,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:03:29,412 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:03:29,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:03:29,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:03:29,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:03:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash 858194171, now seen corresponding path program 1 times [2024-10-13 03:03:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:03:29,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076342549] [2024-10-13 03:03:29,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:03:29,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:03:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:03:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:03:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:03:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 03:03:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:03:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 03:03:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 03:03:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 03:03:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 03:03:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 03:03:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:03:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:03:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 03:03:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:03:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:03:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:03:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 03:03:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:03:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 03:03:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:03:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:03:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:03:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 03:03:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:03:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 03:03:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:29,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:03:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 03:03:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 03:03:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 03:03:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-13 03:03:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 03:03:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-13 03:03:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-13 03:03:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-13 03:03:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-13 03:03:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 03:03:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 03:03:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 03:03:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-13 03:03:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-13 03:03:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-10-13 03:03:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-10-13 03:03:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-13 03:03:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-13 03:03:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-10-13 03:03:30,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:03:30,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076342549] [2024-10-13 03:03:30,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076342549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:03:30,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:03:30,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:03:30,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003954676] [2024-10-13 03:03:30,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:03:30,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:03:30,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:03:30,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:03:30,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:03:30,103 INFO L87 Difference]: Start difference. First operand 113 states and 179 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-10-13 03:03:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:03:30,176 INFO L93 Difference]: Finished difference Result 337 states and 535 transitions. [2024-10-13 03:03:30,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:03:30,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 272 [2024-10-13 03:03:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:03:30,182 INFO L225 Difference]: With dead ends: 337 [2024-10-13 03:03:30,182 INFO L226 Difference]: Without dead ends: 225 [2024-10-13 03:03:30,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 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 03:03:30,189 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 102 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:03:30,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 347 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:03:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-13 03:03:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-10-13 03:03:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 132 states have (on average 1.3484848484848484) internal successors, (178), 132 states have internal predecessors, (178), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 03:03:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 354 transitions. [2024-10-13 03:03:30,244 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 354 transitions. Word has length 272 [2024-10-13 03:03:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:03:30,245 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 354 transitions. [2024-10-13 03:03:30,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-10-13 03:03:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 354 transitions. [2024-10-13 03:03:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-10-13 03:03:30,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:03:30,252 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:03:30,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:03:30,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:03:30,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:03:30,253 INFO L85 PathProgramCache]: Analyzing trace with hash -83965158, now seen corresponding path program 1 times [2024-10-13 03:03:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:03:30,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380167970] [2024-10-13 03:03:30,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:03:30,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:03:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:03:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:03:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:03:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 03:03:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:03:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 03:03:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 03:03:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 03:03:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 03:03:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 03:03:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:03:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:03:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 03:03:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:03:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:03:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:03:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 03:03:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:03:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 03:03:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:03:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:03:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:03:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 03:03:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:03:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 03:03:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:03:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 03:03:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 03:03:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 03:03:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-13 03:03:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 03:03:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-13 03:03:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-13 03:03:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-13 03:03:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-13 03:03:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 03:03:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 03:03:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 03:03:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-13 03:03:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-13 03:03:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-10-13 03:03:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-10-13 03:03:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:31,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-13 03:03:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:32,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-13 03:03:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 120 proven. 9 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2024-10-13 03:03:32,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:03:32,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380167970] [2024-10-13 03:03:32,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380167970] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:03:32,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421210657] [2024-10-13 03:03:32,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:03:32,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:03:32,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:03:32,014 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:03:32,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 03:03:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:03:32,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 03:03:32,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:03:32,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 759 proven. 18 refuted. 0 times theorem prover too weak. 3007 trivial. 0 not checked. [2024-10-13 03:03:32,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:03:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 351 proven. 27 refuted. 0 times theorem prover too weak. 3406 trivial. 0 not checked. [2024-10-13 03:03:33,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421210657] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:03:33,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 03:03:33,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 26 [2024-10-13 03:03:33,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644007877] [2024-10-13 03:03:33,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 03:03:33,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 03:03:33,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:03:33,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 03:03:33,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2024-10-13 03:03:33,680 INFO L87 Difference]: Start difference. First operand 223 states and 354 transitions. Second operand has 26 states, 25 states have (on average 5.24) internal successors, (131), 24 states have internal predecessors, (131), 8 states have call successors, (92), 4 states have call predecessors, (92), 8 states have return successors, (93), 8 states have call predecessors, (93), 8 states have call successors, (93) [2024-10-13 03:03:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:03:36,875 INFO L93 Difference]: Finished difference Result 748 states and 1147 transitions. [2024-10-13 03:03:36,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-13 03:03:36,876 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.24) internal successors, (131), 24 states have internal predecessors, (131), 8 states have call successors, (92), 4 states have call predecessors, (92), 8 states have return successors, (93), 8 states have call predecessors, (93), 8 states have call successors, (93) Word has length 275 [2024-10-13 03:03:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:03:36,885 INFO L225 Difference]: With dead ends: 748 [2024-10-13 03:03:36,889 INFO L226 Difference]: Without dead ends: 526 [2024-10-13 03:03:36,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 625 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1136, Invalid=3154, Unknown=0, NotChecked=0, Total=4290 [2024-10-13 03:03:36,893 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 924 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:03:36,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 1204 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 03:03:36,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-13 03:03:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 382. [2024-10-13 03:03:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 235 states have (on average 1.3361702127659574) internal successors, (314), 237 states have internal predecessors, (314), 136 states have call successors, (136), 10 states have call predecessors, (136), 10 states have return successors, (136), 134 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-13 03:03:36,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 586 transitions. [2024-10-13 03:03:36,973 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 586 transitions. Word has length 275 [2024-10-13 03:03:36,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:03:36,974 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 586 transitions. [2024-10-13 03:03:36,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.24) internal successors, (131), 24 states have internal predecessors, (131), 8 states have call successors, (92), 4 states have call predecessors, (92), 8 states have return successors, (93), 8 states have call predecessors, (93), 8 states have call successors, (93) [2024-10-13 03:03:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 586 transitions. [2024-10-13 03:03:36,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-13 03:03:36,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:03:36,978 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:03:36,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 03:03:37,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:03:37,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:03:37,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:03:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash 331972694, now seen corresponding path program 1 times [2024-10-13 03:03:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:03:37,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707894729] [2024-10-13 03:03:37,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:03:37,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:03:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:03:37,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802787353] [2024-10-13 03:03:37,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:03:37,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:03:37,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:03:37,356 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:03:37,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process