./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-pr-ci_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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-pr-ci_file-54.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 9e9b8bba5642fe9ff8c81ef6bed98f69c4969f379b74efc49785b7b71fefc23b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:36:52,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:36:52,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:36:52,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:36:52,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:36:52,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:36:52,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:36:52,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:36:52,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:36:52,580 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:36:52,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:36:52,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:36:52,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:36:52,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:36:52,583 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:36:52,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:36:52,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:36:52,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:36:52,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:36:52,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:36:52,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:36:52,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:36:52,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:36:52,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:36:52,590 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:36:52,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:36:52,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:36:52,591 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:36:52,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:36:52,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:36:52,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:36:52,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:36:52,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:36:52,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:36:52,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:36:52,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:36:52,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:36:52,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:36:52,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:36:52,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:36:52,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:36:52,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:36:52,594 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 -> 9e9b8bba5642fe9ff8c81ef6bed98f69c4969f379b74efc49785b7b71fefc23b [2024-11-20 04:36:52,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:36:52,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:36:52,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:36:52,872 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:36:52,873 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:36:52,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-54.i [2024-11-20 04:36:54,278 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:36:54,483 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:36:54,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-54.i [2024-11-20 04:36:54,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7651ca6/2f69907f046c43aaaa84f384337784c0/FLAGd0fe34c96 [2024-11-20 04:36:54,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7651ca6/2f69907f046c43aaaa84f384337784c0 [2024-11-20 04:36:54,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:36:54,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:36:54,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:36:54,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:36:54,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:36:54,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:36:54" (1/1) ... [2024-11-20 04:36:54,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ea181d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:54, skipping insertion in model container [2024-11-20 04:36:54,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:36:54" (1/1) ... [2024-11-20 04:36:54,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:36:55,078 WARN L250 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-pr-ci_file-54.i[919,932] [2024-11-20 04:36:55,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:36:55,193 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:36:55,202 WARN L250 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-pr-ci_file-54.i[919,932] [2024-11-20 04:36:55,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:36:55,281 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:36:55,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55 WrapperNode [2024-11-20 04:36:55,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:36:55,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:36:55,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:36:55,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:36:55,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55" (1/1) ... [2024-11-20 04:36:55,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55" (1/1) ... [2024-11-20 04:36:55,334 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-20 04:36:55,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:36:55,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:36:55,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:36:55,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:36:55,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55" (1/1) ... [2024-11-20 04:36:55,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55" (1/1) ... [2024-11-20 04:36:55,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55" (1/1) ... [2024-11-20 04:36:55,374 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-11-20 04:36:55,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55" (1/1) ... [2024-11-20 04:36:55,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55" (1/1) ... [2024-11-20 04:36:55,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55" (1/1) ... [2024-11-20 04:36:55,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55" (1/1) ... [2024-11-20 04:36:55,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55" (1/1) ... [2024-11-20 04:36:55,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55" (1/1) ... [2024-11-20 04:36:55,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:36:55,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:36:55,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:36:55,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:36:55,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55" (1/1) ... [2024-11-20 04:36:55,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:36:55,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:36:55,445 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-11-20 04:36:55,452 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-11-20 04:36:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:36:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:36:55,509 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:36:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:36:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:36:55,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:36:55,610 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:36:55,615 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:36:56,117 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 04:36:56,118 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:36:56,133 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:36:56,134 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:36:56,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:36:56 BoogieIcfgContainer [2024-11-20 04:36:56,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:36:56,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:36:56,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:36:56,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:36:56,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:36:54" (1/3) ... [2024-11-20 04:36:56,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ae3113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:36:56, skipping insertion in model container [2024-11-20 04:36:56,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:36:55" (2/3) ... [2024-11-20 04:36:56,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ae3113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:36:56, skipping insertion in model container [2024-11-20 04:36:56,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:36:56" (3/3) ... [2024-11-20 04:36:56,143 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-54.i [2024-11-20 04:36:56,157 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:36:56,158 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:36:56,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:36:56,230 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;@43b136f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:36:56,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:36:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-20 04:36:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 04:36:56,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:36:56,254 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 04:36:56,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:36:56,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:36:56,261 INFO L85 PathProgramCache]: Analyzing trace with hash 866825331, now seen corresponding path program 1 times [2024-11-20 04:36:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:36:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838922386] [2024-11-20 04:36:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:36:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:36:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:36:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:36:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:36:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:36:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:36:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:36:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:36:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:36:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:36:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:36:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 04:36:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:36:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 04:36:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:36:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:36:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:36:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:36:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:36:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:36:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:36:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:36:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 04:36:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:36:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 04:36:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:36:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 04:36:56,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:36:56,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838922386] [2024-11-20 04:36:56,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838922386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:36:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:36:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:36:56,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289682245] [2024-11-20 04:36:56,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:36:56,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:36:56,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:36:56,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:36:56,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:36:56,912 INFO L87 Difference]: Start difference. First operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 04:36:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:36:56,939 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2024-11-20 04:36:56,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:36:56,942 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-20 04:36:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:36:56,953 INFO L225 Difference]: With dead ends: 162 [2024-11-20 04:36:56,955 INFO L226 Difference]: Without dead ends: 80 [2024-11-20 04:36:56,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-11-20 04:36:56,963 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:36:56,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:36:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-20 04:36:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-20 04:36:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-20 04:36:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-11-20 04:36:57,034 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 167 [2024-11-20 04:36:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:36:57,034 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-11-20 04:36:57,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 04:36:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-11-20 04:36:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 04:36:57,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:36:57,042 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 04:36:57,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:36:57,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:36:57,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:36:57,046 INFO L85 PathProgramCache]: Analyzing trace with hash -36584271, now seen corresponding path program 1 times [2024-11-20 04:36:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:36:57,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549617786] [2024-11-20 04:36:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:36:57,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:36:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:36:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:36:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:36:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:36:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:36:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:36:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:36:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:36:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:36:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:36:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 04:36:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:36:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 04:36:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:36:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:36:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:36:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:36:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:36:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:36:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:36:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:36:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 04:36:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:36:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 04:36:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:36:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 04:36:57,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:36:57,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549617786] [2024-11-20 04:36:57,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549617786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:36:57,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:36:57,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:36:57,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658454415] [2024-11-20 04:36:57,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:36:57,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:36:57,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:36:57,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:36:57,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:36:57,858 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 04:36:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:36:58,130 INFO L93 Difference]: Finished difference Result 235 states and 361 transitions. [2024-11-20 04:36:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:36:58,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-20 04:36:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:36:58,138 INFO L225 Difference]: With dead ends: 235 [2024-11-20 04:36:58,138 INFO L226 Difference]: Without dead ends: 158 [2024-11-20 04:36:58,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:36:58,140 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 104 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:36:58,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 349 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:36:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-20 04:36:58,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 127. [2024-11-20 04:36:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-20 04:36:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2024-11-20 04:36:58,176 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 167 [2024-11-20 04:36:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:36:58,177 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2024-11-20 04:36:58,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 04:36:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2024-11-20 04:36:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 04:36:58,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:36:58,183 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 04:36:58,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:36:58,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:36:58,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:36:58,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1997905813, now seen corresponding path program 1 times [2024-11-20 04:36:58,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:36:58,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863583481] [2024-11-20 04:36:58,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:36:58,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:36:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:36:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:36:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:36:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:36:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:36:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:36:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:36:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:36:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:36:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:36:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 04:36:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:36:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 04:36:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:36:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:36:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:36:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:36:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:36:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:36:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:36:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:36:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 04:36:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:36:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 04:36:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:36:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 04:36:58,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:36:58,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863583481] [2024-11-20 04:36:58,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863583481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:36:58,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:36:58,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:36:58,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042797968] [2024-11-20 04:36:58,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:36:58,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:36:58,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:36:58,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:36:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:36:58,627 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 04:36:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:36:58,720 INFO L93 Difference]: Finished difference Result 281 states and 431 transitions. [2024-11-20 04:36:58,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:36:58,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2024-11-20 04:36:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:36:58,727 INFO L225 Difference]: With dead ends: 281 [2024-11-20 04:36:58,731 INFO L226 Difference]: Without dead ends: 204 [2024-11-20 04:36:58,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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-11-20 04:36:58,733 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 69 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:36:58,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 215 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:36:58,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-20 04:36:58,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2024-11-20 04:36:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 123 states have (on average 1.3008130081300813) internal successors, (160), 123 states have internal predecessors, (160), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-20 04:36:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 310 transitions. [2024-11-20 04:36:58,789 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 310 transitions. Word has length 168 [2024-11-20 04:36:58,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:36:58,790 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 310 transitions. [2024-11-20 04:36:58,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 04:36:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 310 transitions. [2024-11-20 04:36:58,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 04:36:58,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:36:58,793 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 04:36:58,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:36:58,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:36:58,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:36:58,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1517258829, now seen corresponding path program 1 times [2024-11-20 04:36:58,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:36:58,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691282405] [2024-11-20 04:36:58,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:36:58,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:36:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:36:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:36:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:36:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:36:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:36:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:36:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:36:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:36:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:36:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:36:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 04:36:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:36:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 04:36:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:36:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:36:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:36:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:36:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:36:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:36:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:36:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:36:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 04:36:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:36:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 04:36:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:36:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-20 04:36:59,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:36:59,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691282405] [2024-11-20 04:36:59,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691282405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:36:59,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3797794] [2024-11-20 04:36:59,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:36:59,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:36:59,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:36:59,348 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-11-20 04:36:59,350 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-11-20 04:36:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:36:59,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 04:36:59,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:36:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 36 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-20 04:36:59,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:37:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-20 04:37:00,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3797794] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:37:00,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:37:00,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-20 04:37:00,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305934497] [2024-11-20 04:37:00,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:37:00,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 04:37:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:37:00,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 04:37:00,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:37:00,077 INFO L87 Difference]: Start difference. First operand 202 states and 310 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-20 04:37:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:37:00,351 INFO L93 Difference]: Finished difference Result 372 states and 561 transitions. [2024-11-20 04:37:00,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 04:37:00,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 169 [2024-11-20 04:37:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:37:00,355 INFO L225 Difference]: With dead ends: 372 [2024-11-20 04:37:00,355 INFO L226 Difference]: Without dead ends: 220 [2024-11-20 04:37:00,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-20 04:37:00,357 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 130 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:37:00,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 217 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:37:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-20 04:37:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 214. [2024-11-20 04:37:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 132 states have (on average 1.2651515151515151) internal successors, (167), 132 states have internal predecessors, (167), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-20 04:37:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 317 transitions. [2024-11-20 04:37:00,404 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 317 transitions. Word has length 169 [2024-11-20 04:37:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:37:00,405 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 317 transitions. [2024-11-20 04:37:00,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-20 04:37:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 317 transitions. [2024-11-20 04:37:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 04:37:00,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:37:00,408 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 04:37:00,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 04:37:00,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:37:00,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:37:00,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:37:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1002701105, now seen corresponding path program 1 times [2024-11-20 04:37:00,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:37:00,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374792880] [2024-11-20 04:37:00,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:37:00,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:37:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:37:00,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717549006] [2024-11-20 04:37:00,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:37:00,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:37:00,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:37:00,769 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-11-20 04:37:00,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 04:37:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:00,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 04:37:00,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:37:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 606 proven. 48 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2024-11-20 04:37:01,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:37:39,147 WARN L286 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 04:38:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 24 proven. 48 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-20 04:38:00,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:38:00,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374792880] [2024-11-20 04:38:00,745 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 04:38:00,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717549006] [2024-11-20 04:38:00,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717549006] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:38:00,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:38:00,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-11-20 04:38:00,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309772743] [2024-11-20 04:38:00,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:38:00,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-20 04:38:00,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:38:00,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-20 04:38:00,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-20 04:38:00,748 INFO L87 Difference]: Start difference. First operand 214 states and 317 transitions. Second operand has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 5 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 5 states have call predecessors, (50), 5 states have call successors, (50) [2024-11-20 04:38:32,455 WARN L286 SmtUtils]: Spent 9.89s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)