./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.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 a748a59f07e4b223740bdd1b062749131146e39483e646914db65f28461caf78 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:16:37,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:16:37,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:16:37,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:16:37,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:16:37,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:16:37,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:16:37,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:16:37,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:16:37,167 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:16:37,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:16:37,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:16:37,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:16:37,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:16:37,169 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:16:37,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:16:37,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:16:37,170 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:16:37,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:16:37,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:16:37,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:16:37,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:16:37,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:16:37,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:16:37,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:16:37,173 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:16:37,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:16:37,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:16:37,173 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:16:37,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:16:37,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:16:37,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:16:37,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:16:37,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:16:37,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:16:37,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:16:37,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:16:37,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:16:37,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:16:37,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:16:37,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:16:37,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:16:37,181 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 -> a748a59f07e4b223740bdd1b062749131146e39483e646914db65f28461caf78 [2024-10-11 09:16:37,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:16:37,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:16:37,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:16:37,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:16:37,472 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:16:37,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i [2024-10-11 09:16:38,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:16:39,230 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:16:39,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i [2024-10-11 09:16:39,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b269d1e8c/155683cba95a462ea100c35dab99be7a/FLAGedcab36b5 [2024-10-11 09:16:39,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b269d1e8c/155683cba95a462ea100c35dab99be7a [2024-10-11 09:16:39,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:16:39,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:16:39,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:16:39,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:16:39,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:16:39,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:16:39" (1/1) ... [2024-10-11 09:16:39,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f25d445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:39, skipping insertion in model container [2024-10-11 09:16:39,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:16:39" (1/1) ... [2024-10-11 09:16:39,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:16:39,826 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i[919,932] [2024-10-11 09:16:39,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:16:39,968 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:16:39,978 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i[919,932] [2024-10-11 09:16:40,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:16:40,031 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:16:40,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40 WrapperNode [2024-10-11 09:16:40,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:16:40,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:16:40,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:16:40,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:16:40,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40" (1/1) ... [2024-10-11 09:16:40,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40" (1/1) ... [2024-10-11 09:16:40,096 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-10-11 09:16:40,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:16:40,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:16:40,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:16:40,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:16:40,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40" (1/1) ... [2024-10-11 09:16:40,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40" (1/1) ... [2024-10-11 09:16:40,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40" (1/1) ... [2024-10-11 09:16:40,142 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 09:16:40,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40" (1/1) ... [2024-10-11 09:16:40,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40" (1/1) ... [2024-10-11 09:16:40,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40" (1/1) ... [2024-10-11 09:16:40,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40" (1/1) ... [2024-10-11 09:16:40,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40" (1/1) ... [2024-10-11 09:16:40,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40" (1/1) ... [2024-10-11 09:16:40,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:16:40,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:16:40,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:16:40,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:16:40,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40" (1/1) ... [2024-10-11 09:16:40,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:16:40,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:16:40,228 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 09:16:40,235 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 09:16:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:16:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:16:40,289 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:16:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:16:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:16:40,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:16:40,364 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:16:40,366 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:16:40,908 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 09:16:40,908 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:16:40,969 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:16:40,969 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:16:40,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:16:40 BoogieIcfgContainer [2024-10-11 09:16:40,972 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:16:40,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:16:40,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:16:40,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:16:40,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:16:39" (1/3) ... [2024-10-11 09:16:40,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642c9fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:16:40, skipping insertion in model container [2024-10-11 09:16:40,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:40" (2/3) ... [2024-10-11 09:16:40,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642c9fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:16:40, skipping insertion in model container [2024-10-11 09:16:40,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:16:40" (3/3) ... [2024-10-11 09:16:40,984 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i [2024-10-11 09:16:41,015 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:16:41,015 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:16:41,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:16:41,102 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;@2001bb73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:16:41,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:16:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 09:16:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 09:16:41,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:41,135 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:41,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:41,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:41,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1830268860, now seen corresponding path program 1 times [2024-10-11 09:16:41,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:41,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090192416] [2024-10-11 09:16:41,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:41,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:16:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:16:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:16:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:16:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:16:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:16:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:16:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:16:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:16:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:16:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:16:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:16:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:16:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:16:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:16:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:16:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:16:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:16:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:16:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:16:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:16:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:16:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:16:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:16:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:16:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:16:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:16:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:16:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:16:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 09:16:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:16:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:16:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 09:16:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:16:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:16:41,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:16:41,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090192416] [2024-10-11 09:16:41,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090192416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:16:41,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:16:41,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:16:41,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223965347] [2024-10-11 09:16:41,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:16:41,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:16:41,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:16:41,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:16:41,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:16:41,834 INFO L87 Difference]: Start difference. First operand has 94 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:16:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:16:41,903 INFO L93 Difference]: Finished difference Result 183 states and 332 transitions. [2024-10-11 09:16:41,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:16:41,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 209 [2024-10-11 09:16:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:16:41,918 INFO L225 Difference]: With dead ends: 183 [2024-10-11 09:16:41,918 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 09:16:41,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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 09:16:41,926 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:16:41,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:16:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 09:16:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 09:16:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 09:16:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 140 transitions. [2024-10-11 09:16:41,987 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 140 transitions. Word has length 209 [2024-10-11 09:16:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:16:41,988 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 140 transitions. [2024-10-11 09:16:41,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:16:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 140 transitions. [2024-10-11 09:16:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 09:16:41,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:41,996 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:41,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:16:41,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:41,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:41,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1013593792, now seen corresponding path program 1 times [2024-10-11 09:16:41,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:41,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843277939] [2024-10-11 09:16:42,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:42,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:42,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:16:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:42,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:16:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:16:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:16:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:16:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:16:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:16:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:16:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:16:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:16:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:16:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:16:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:16:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:16:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:16:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:16:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:16:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:16:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:16:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:16:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:16:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:16:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:16:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:16:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:16:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:16:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:16:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:16:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:16:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 09:16:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:16:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:16:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 09:16:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:16:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:16:43,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:16:43,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843277939] [2024-10-11 09:16:43,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843277939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:16:43,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:16:43,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:16:43,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170519998] [2024-10-11 09:16:43,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:16:43,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:16:43,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:16:43,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:16:43,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:16:43,335 INFO L87 Difference]: Start difference. First operand 90 states and 140 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:16:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:16:43,781 INFO L93 Difference]: Finished difference Result 273 states and 426 transitions. [2024-10-11 09:16:43,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:16:43,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 209 [2024-10-11 09:16:43,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:16:43,788 INFO L225 Difference]: With dead ends: 273 [2024-10-11 09:16:43,789 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 09:16:43,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:16:43,794 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 86 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:16:43,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 351 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:16:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 09:16:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 171. [2024-10-11 09:16:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 100 states have (on average 1.32) internal successors, (132), 100 states have internal predecessors, (132), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 09:16:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 268 transitions. [2024-10-11 09:16:43,852 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 268 transitions. Word has length 209 [2024-10-11 09:16:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:16:43,855 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 268 transitions. [2024-10-11 09:16:43,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:16:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 268 transitions. [2024-10-11 09:16:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 09:16:43,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:43,862 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:43,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:16:43,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:43,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:43,863 INFO L85 PathProgramCache]: Analyzing trace with hash -215222281, now seen corresponding path program 1 times [2024-10-11 09:16:43,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:43,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652698009] [2024-10-11 09:16:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:43,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:16:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:16:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:16:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:16:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:16:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:16:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:16:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:16:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:16:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:16:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:16:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:16:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:16:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:16:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:16:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:16:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:16:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:16:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:16:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:16:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:16:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:16:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:16:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:16:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:16:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:16:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:16:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:16:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:16:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 09:16:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:16:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:16:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 09:16:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:16:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:16:44,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:16:44,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652698009] [2024-10-11 09:16:44,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652698009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:16:44,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:16:44,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:16:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812244948] [2024-10-11 09:16:44,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:16:44,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:16:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:16:44,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:16:44,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:16:44,378 INFO L87 Difference]: Start difference. First operand 171 states and 268 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:16:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:16:44,684 INFO L93 Difference]: Finished difference Result 291 states and 452 transitions. [2024-10-11 09:16:44,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:16:44,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 210 [2024-10-11 09:16:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:16:44,687 INFO L225 Difference]: With dead ends: 291 [2024-10-11 09:16:44,687 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 09:16:44,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:16:44,693 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 83 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:16:44,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 363 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:16:44,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 09:16:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2024-10-11 09:16:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 101 states have (on average 1.306930693069307) internal successors, (132), 101 states have internal predecessors, (132), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 09:16:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 268 transitions. [2024-10-11 09:16:44,744 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 268 transitions. Word has length 210 [2024-10-11 09:16:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:16:44,747 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 268 transitions. [2024-10-11 09:16:44,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:16:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 268 transitions. [2024-10-11 09:16:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-11 09:16:44,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:44,753 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:44,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:16:44,753 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:44,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:44,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1832985405, now seen corresponding path program 1 times [2024-10-11 09:16:44,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:44,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268327945] [2024-10-11 09:16:44,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:44,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat