./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_loopvsstraightlinecode_50-1loop_file-56.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_loopvsstraightlinecode_50-1loop_file-56.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 b789579c26a72ad54a80221787689a82fd41f4277a636c233911da81d2141e81 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:50:40,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:50:40,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:50:40,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:50:40,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:50:40,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:50:40,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:50:40,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:50:40,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:50:40,618 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:50:40,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:50:40,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:50:40,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:50:40,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:50:40,620 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:50:40,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:50:40,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:50:40,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:50:40,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:50:40,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:50:40,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:50:40,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:50:40,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:50:40,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:50:40,624 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:50:40,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:50:40,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:50:40,625 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:50:40,625 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:50:40,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:50:40,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:50:40,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:50:40,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:50:40,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:50:40,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:50:40,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:50:40,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:50:40,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:50:40,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:50:40,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:50:40,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:50:40,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:50:40,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 -> b789579c26a72ad54a80221787689a82fd41f4277a636c233911da81d2141e81 [2024-10-11 11:50:40,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:50:40,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:50:40,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:50:40,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:50:40,890 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:50:40,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-56.i [2024-10-11 11:50:42,344 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:50:42,539 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:50:42,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-56.i [2024-10-11 11:50:42,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0138ba7ff/13ef5c98c08f4093a6a4364df46d9329/FLAG90c06781c [2024-10-11 11:50:42,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0138ba7ff/13ef5c98c08f4093a6a4364df46d9329 [2024-10-11 11:50:42,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:50:42,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:50:42,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:50:42,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:50:42,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:50:42,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:50:42" (1/1) ... [2024-10-11 11:50:42,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57805ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:42, skipping insertion in model container [2024-10-11 11:50:42,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:50:42" (1/1) ... [2024-10-11 11:50:42,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:50:43,101 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_loopvsstraightlinecode_50-1loop_file-56.i[915,928] [2024-10-11 11:50:43,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:50:43,183 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:50:43,194 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_loopvsstraightlinecode_50-1loop_file-56.i[915,928] [2024-10-11 11:50:43,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:50:43,256 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:50:43,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43 WrapperNode [2024-10-11 11:50:43,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:50:43,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:50:43,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:50:43,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:50:43,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43" (1/1) ... [2024-10-11 11:50:43,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43" (1/1) ... [2024-10-11 11:50:43,336 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-10-11 11:50:43,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:50:43,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:50:43,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:50:43,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:50:43,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43" (1/1) ... [2024-10-11 11:50:43,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43" (1/1) ... [2024-10-11 11:50:43,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43" (1/1) ... [2024-10-11 11:50:43,414 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 11:50:43,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43" (1/1) ... [2024-10-11 11:50:43,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43" (1/1) ... [2024-10-11 11:50:43,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43" (1/1) ... [2024-10-11 11:50:43,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43" (1/1) ... [2024-10-11 11:50:43,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43" (1/1) ... [2024-10-11 11:50:43,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43" (1/1) ... [2024-10-11 11:50:43,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:50:43,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:50:43,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:50:43,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:50:43,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43" (1/1) ... [2024-10-11 11:50:43,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:50:43,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:50:43,490 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 11:50:43,493 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 11:50:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:50:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:50:43,544 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:50:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:50:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:50:43,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:50:43,636 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:50:43,640 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:50:44,011 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 11:50:44,011 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:50:44,065 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:50:44,065 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:50:44,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:50:44 BoogieIcfgContainer [2024-10-11 11:50:44,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:50:44,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:50:44,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:50:44,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:50:44,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:50:42" (1/3) ... [2024-10-11 11:50:44,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4018661e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:50:44, skipping insertion in model container [2024-10-11 11:50:44,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:43" (2/3) ... [2024-10-11 11:50:44,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4018661e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:50:44, skipping insertion in model container [2024-10-11 11:50:44,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:50:44" (3/3) ... [2024-10-11 11:50:44,077 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-56.i [2024-10-11 11:50:44,096 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:50:44,096 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:50:44,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:50:44,151 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;@5b694a47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:50:44,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:50:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 11:50:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 11:50:44,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:50:44,165 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:50:44,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:50:44,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:50:44,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1631987822, now seen corresponding path program 1 times [2024-10-11 11:50:44,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:50:44,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655698149] [2024-10-11 11:50:44,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:50:44,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:50:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:50:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:50:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:50:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:50:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:50:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:50:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:50:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:50:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:50:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:50:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:50:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:50:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:50:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:50:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:50:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:50:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:50:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:50:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:50:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:50:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:50:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:50:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:50:44,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:50:44,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655698149] [2024-10-11 11:50:44,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655698149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:50:44,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:50:44,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:50:44,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932519519] [2024-10-11 11:50:44,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:50:44,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:50:44,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:50:44,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:50:44,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:50:44,652 INFO L87 Difference]: Start difference. First operand has 56 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 11:50:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:50:44,703 INFO L93 Difference]: Finished difference Result 111 states and 195 transitions. [2024-10-11 11:50:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:50:44,706 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2024-10-11 11:50:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:50:44,714 INFO L225 Difference]: With dead ends: 111 [2024-10-11 11:50:44,714 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 11:50:44,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:50:44,722 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:50:44,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:50:44,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 11:50:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 11:50:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 11:50:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2024-10-11 11:50:44,768 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 135 [2024-10-11 11:50:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:50:44,768 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2024-10-11 11:50:44,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 11:50:44,769 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2024-10-11 11:50:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 11:50:44,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:50:44,775 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:50:44,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:50:44,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:50:44,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:50:44,777 INFO L85 PathProgramCache]: Analyzing trace with hash 334325550, now seen corresponding path program 1 times [2024-10-11 11:50:44,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:50:44,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452366718] [2024-10-11 11:50:44,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:50:44,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:50:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:50:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:50:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:50:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:50:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:50:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:50:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:50:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:50:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:50:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:50:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:50:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:50:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:50:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:50:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:50:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:50:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:50:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:50:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:50:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:50:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:50:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:50:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:50:45,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:50:45,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452366718] [2024-10-11 11:50:45,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452366718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:50:45,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:50:45,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:50:45,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677514900] [2024-10-11 11:50:45,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:50:45,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:50:45,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:50:45,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:50:45,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:50:45,477 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:50:45,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:50:45,535 INFO L93 Difference]: Finished difference Result 107 states and 163 transitions. [2024-10-11 11:50:45,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:50:45,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 135 [2024-10-11 11:50:45,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:50:45,538 INFO L225 Difference]: With dead ends: 107 [2024-10-11 11:50:45,538 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 11:50:45,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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 11:50:45,540 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:50:45,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:50:45,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 11:50:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 11:50:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 11:50:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2024-10-11 11:50:45,553 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 135 [2024-10-11 11:50:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:50:45,554 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2024-10-11 11:50:45,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:50:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2024-10-11 11:50:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 11:50:45,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:50:45,557 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:50:45,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:50:45,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:50:45,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:50:45,558 INFO L85 PathProgramCache]: Analyzing trace with hash 332478508, now seen corresponding path program 1 times [2024-10-11 11:50:45,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:50:45,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946205466] [2024-10-11 11:50:45,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:50:45,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:50:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:50:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:50:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:50:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:50:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:50:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:50:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:50:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:50:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:50:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:50:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:50:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:50:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:50:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:50:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:50:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:50:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:50:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:50:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:50:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:50:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:50:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:50:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:50:46,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:50:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946205466] [2024-10-11 11:50:46,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946205466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:50:46,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:50:46,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:50:46,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145428143] [2024-10-11 11:50:46,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:50:46,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:50:46,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:50:46,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:50:46,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:50:46,286 INFO L87 Difference]: Start difference. First operand 54 states and 81 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:50:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:50:46,412 INFO L93 Difference]: Finished difference Result 145 states and 211 transitions. [2024-10-11 11:50:46,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:50:46,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 135 [2024-10-11 11:50:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:50:46,416 INFO L225 Difference]: With dead ends: 145 [2024-10-11 11:50:46,416 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 11:50:46,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:50:46,421 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 61 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:50:46,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 241 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:50:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 11:50:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2024-10-11 11:50:46,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:50:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 116 transitions. [2024-10-11 11:50:46,445 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 116 transitions. Word has length 135 [2024-10-11 11:50:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:50:46,446 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 116 transitions. [2024-10-11 11:50:46,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:50:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 116 transitions. [2024-10-11 11:50:46,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 11:50:46,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:50:46,451 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:50:46,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:50:46,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:50:46,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:50:46,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2107485870, now seen corresponding path program 1 times [2024-10-11 11:50:46,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:50:46,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130958620] [2024-10-11 11:50:46,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:50:46,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:50:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat