./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_fillercodesize_ps-cn-10_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_fillercodesize_ps-cn-10_file-59.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 e71601c55174be0ad57296dccc2279fd85b1f2c03bb5913dfcee88384188d311 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:06:46,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:06:46,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:06:46,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:06:46,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:06:46,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:06:46,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:06:46,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:06:46,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:06:46,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:06:46,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:06:46,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:06:46,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:06:46,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:06:46,488 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:06:46,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:06:46,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:06:46,492 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:06:46,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:06:46,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:06:46,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:06:46,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:06:46,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:06:46,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:06:46,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:06:46,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:06:46,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:06:46,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:06:46,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:06:46,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:06:46,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:06:46,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:06:46,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:06:46,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:06:46,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:06:46,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:06:46,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:06:46,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:06:46,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:06:46,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:06:46,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:06:46,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:06:46,503 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 -> e71601c55174be0ad57296dccc2279fd85b1f2c03bb5913dfcee88384188d311 [2024-10-24 06:06:46,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:06:46,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:06:46,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:06:46,925 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:06:46,925 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:06:46,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.i [2024-10-24 06:06:48,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:06:48,874 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:06:48,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.i [2024-10-24 06:06:48,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1ac0df3/182b52d6cd4540bfb4071127927d40bf/FLAGf12ce3dbd [2024-10-24 06:06:48,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1ac0df3/182b52d6cd4540bfb4071127927d40bf [2024-10-24 06:06:48,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:06:48,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:06:48,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:06:48,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:06:48,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:06:48,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:06:48" (1/1) ... [2024-10-24 06:06:48,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad6752c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:48, skipping insertion in model container [2024-10-24 06:06:48,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:06:48" (1/1) ... [2024-10-24 06:06:48,953 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:06:49,183 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_fillercodesize_ps-cn-10_file-59.i[915,928] [2024-10-24 06:06:49,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:06:49,277 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:06:49,289 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_fillercodesize_ps-cn-10_file-59.i[915,928] [2024-10-24 06:06:49,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:06:49,356 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:06:49,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49 WrapperNode [2024-10-24 06:06:49,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:06:49,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:06:49,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:06:49,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:06:49,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49" (1/1) ... [2024-10-24 06:06:49,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49" (1/1) ... [2024-10-24 06:06:49,414 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-10-24 06:06:49,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:06:49,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:06:49,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:06:49,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:06:49,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49" (1/1) ... [2024-10-24 06:06:49,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49" (1/1) ... [2024-10-24 06:06:49,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49" (1/1) ... [2024-10-24 06:06:49,478 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-24 06:06:49,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49" (1/1) ... [2024-10-24 06:06:49,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49" (1/1) ... [2024-10-24 06:06:49,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49" (1/1) ... [2024-10-24 06:06:49,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49" (1/1) ... [2024-10-24 06:06:49,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49" (1/1) ... [2024-10-24 06:06:49,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49" (1/1) ... [2024-10-24 06:06:49,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:06:49,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:06:49,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:06:49,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:06:49,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49" (1/1) ... [2024-10-24 06:06:49,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:06:49,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:06:49,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:06:49,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:06:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:06:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:06:49,620 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:06:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:06:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:06:49,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:06:49,719 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:06:49,722 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:06:50,127 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 06:06:50,128 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:06:50,196 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:06:50,196 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:06:50,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:06:50 BoogieIcfgContainer [2024-10-24 06:06:50,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:06:50,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:06:50,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:06:50,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:06:50,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:06:48" (1/3) ... [2024-10-24 06:06:50,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12968053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:06:50, skipping insertion in model container [2024-10-24 06:06:50,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:06:49" (2/3) ... [2024-10-24 06:06:50,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12968053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:06:50, skipping insertion in model container [2024-10-24 06:06:50,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:06:50" (3/3) ... [2024-10-24 06:06:50,211 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-59.i [2024-10-24 06:06:50,231 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:06:50,231 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:06:50,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:06:50,309 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;@8227cdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:06:50,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:06:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 06:06:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 06:06:50,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:06:50,334 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:06:50,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:06:50,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:06:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1266649107, now seen corresponding path program 1 times [2024-10-24 06:06:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:06:50,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600914021] [2024-10-24 06:06:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:06:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:06:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:06:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:06:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 06:06:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:06:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 06:06:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:06:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 06:06:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:06:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:06:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:06:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:06:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:06:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:06:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:06:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:06:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:06:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 06:06:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:06:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 06:06:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:06:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 06:06:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 06:06:50,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:06:50,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600914021] [2024-10-24 06:06:50,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600914021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:06:50,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:06:50,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:06:50,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267072521] [2024-10-24 06:06:50,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:06:50,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:06:50,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:06:50,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:06:50,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:06:50,964 INFO L87 Difference]: Start difference. First operand has 64 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 06:06:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:06:51,012 INFO L93 Difference]: Finished difference Result 125 states and 217 transitions. [2024-10-24 06:06:51,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:06:51,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2024-10-24 06:06:51,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:06:51,023 INFO L225 Difference]: With dead ends: 125 [2024-10-24 06:06:51,023 INFO L226 Difference]: Without dead ends: 62 [2024-10-24 06:06:51,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-24 06:06:51,031 INFO L432 NwaCegarLoop]: 91 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, 91 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-24 06:06:51,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:06:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-24 06:06:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-24 06:06:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 06:06:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2024-10-24 06:06:51,117 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 135 [2024-10-24 06:06:51,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:06:51,119 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2024-10-24 06:06:51,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 06:06:51,120 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2024-10-24 06:06:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 06:06:51,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:06:51,127 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:06:51,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:06:51,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:06:51,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:06:51,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1081310367, now seen corresponding path program 1 times [2024-10-24 06:06:51,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:06:51,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184748605] [2024-10-24 06:06:51,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:06:51,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:06:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:06:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:06:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 06:06:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:06:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 06:06:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:06:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 06:06:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:06:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:06:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:06:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:06:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:06:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:06:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:06:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:06:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:06:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 06:06:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:06:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 06:06:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:06:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 06:06:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 06:06:51,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:06:51,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184748605] [2024-10-24 06:06:51,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184748605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:06:51,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:06:51,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:06:51,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99267031] [2024-10-24 06:06:51,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:06:51,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:06:51,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:06:51,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:06:51,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:06:51,860 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 06:06:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:06:52,058 INFO L93 Difference]: Finished difference Result 185 states and 281 transitions. [2024-10-24 06:06:52,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:06:52,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-10-24 06:06:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:06:52,065 INFO L225 Difference]: With dead ends: 185 [2024-10-24 06:06:52,068 INFO L226 Difference]: Without dead ends: 124 [2024-10-24 06:06:52,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-24 06:06:52,070 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 60 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:06:52,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 269 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:06:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-24 06:06:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2024-10-24 06:06:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 06:06:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 160 transitions. [2024-10-24 06:06:52,102 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 160 transitions. Word has length 135 [2024-10-24 06:06:52,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:06:52,103 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 160 transitions. [2024-10-24 06:06:52,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 06:06:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 160 transitions. [2024-10-24 06:06:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 06:06:52,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:06:52,105 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:06:52,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:06:52,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:06:52,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:06:52,107 INFO L85 PathProgramCache]: Analyzing trace with hash -482662553, now seen corresponding path program 1 times [2024-10-24 06:06:52,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:06:52,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317486932] [2024-10-24 06:06:52,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:06:52,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:06:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:06:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:06:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 06:06:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:06:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 06:06:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:06:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 06:06:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:06:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:06:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:06:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:06:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:06:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:06:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:06:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:06:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:06:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 06:06:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:06:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 06:06:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:06:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 06:06:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 06:06:52,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:06:52,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317486932] [2024-10-24 06:06:52,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317486932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:06:52,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:06:52,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:06:52,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893175739] [2024-10-24 06:06:52,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:06:52,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:06:52,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:06:52,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:06:52,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:06:52,686 INFO L87 Difference]: Start difference. First operand 106 states and 160 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 06:06:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:06:52,888 INFO L93 Difference]: Finished difference Result 237 states and 357 transitions. [2024-10-24 06:06:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:06:52,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-10-24 06:06:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:06:52,891 INFO L225 Difference]: With dead ends: 237 [2024-10-24 06:06:52,891 INFO L226 Difference]: Without dead ends: 176 [2024-10-24 06:06:52,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-24 06:06:52,897 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 74 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:06:52,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 266 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:06:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-24 06:06:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2024-10-24 06:06:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 98 states have internal predecessors, (124), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-24 06:06:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2024-10-24 06:06:52,931 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 136 [2024-10-24 06:06:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:06:52,931 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2024-10-24 06:06:52,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 06:06:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2024-10-24 06:06:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 06:06:52,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:06:52,934 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:06:52,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:06:52,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:06:52,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:06:52,935 INFO L85 PathProgramCache]: Analyzing trace with hash -429560624, now seen corresponding path program 1 times [2024-10-24 06:06:52,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:06:52,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958809335] [2024-10-24 06:06:52,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:06:52,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:06:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:06:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:06:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 06:06:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:06:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 06:06:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:06:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 06:06:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:06:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:06:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:06:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:06:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:06:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:06:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:06:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:06:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:06:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 06:06:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:06:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 06:06:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:06:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 06:06:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 06:06:53,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:06:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958809335] [2024-10-24 06:06:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958809335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:06:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955900883] [2024-10-24 06:06:53,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:06:53,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:06:53,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:06:53,726 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:06:53,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 06:06:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:53,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 06:06:53,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:06:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 438 proven. 42 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-10-24 06:06:54,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:06:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 06:06:54,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955900883] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:06:54,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:06:54,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-24 06:06:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426451082] [2024-10-24 06:06:54,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:06:54,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 06:06:54,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:06:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 06:06:54,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-24 06:06:54,440 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-24 06:06:55,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:06:55,369 INFO L93 Difference]: Finished difference Result 543 states and 769 transitions. [2024-10-24 06:06:55,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-24 06:06:55,371 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 137 [2024-10-24 06:06:55,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:06:55,375 INFO L225 Difference]: With dead ends: 543 [2024-10-24 06:06:55,375 INFO L226 Difference]: Without dead ends: 423 [2024-10-24 06:06:55,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 313 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=399, Invalid=1007, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 06:06:55,377 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 328 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 06:06:55,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 372 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 06:06:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-24 06:06:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 325. [2024-10-24 06:06:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 201 states have (on average 1.1741293532338308) internal successors, (236), 203 states have internal predecessors, (236), 105 states have call successors, (105), 18 states have call predecessors, (105), 18 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-24 06:06:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 446 transitions. [2024-10-24 06:06:55,431 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 446 transitions. Word has length 137 [2024-10-24 06:06:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:06:55,432 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 446 transitions. [2024-10-24 06:06:55,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-24 06:06:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 446 transitions. [2024-10-24 06:06:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 06:06:55,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:06:55,434 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:06:55,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 06:06:55,638 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-10-24 06:06:55,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:06:55,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:06:55,642 INFO L85 PathProgramCache]: Analyzing trace with hash -372302322, now seen corresponding path program 1 times [2024-10-24 06:06:55,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:06:55,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369092589] [2024-10-24 06:06:55,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:06:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:06:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:06:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457592710] [2024-10-24 06:06:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:06:55,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:06:55,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:06:55,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-10-24 06:06:55,771 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-10-24 06:06:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:06:55,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 06:06:55,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:06:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 210 proven. 144 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-10-24 06:06:57,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:07:03,497 WARN L286 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-24 06:07:17,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:07:17,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369092589] [2024-10-24 06:07:17,002 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 06:07:17,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457592710] [2024-10-24 06:07:17,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457592710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:07:17,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 06:07:17,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-10-24 06:07:17,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397251215] [2024-10-24 06:07:17,006 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 06:07:17,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 06:07:17,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:07:17,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 06:07:17,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2024-10-24 06:07:17,008 INFO L87 Difference]: Start difference. First operand 325 states and 446 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 06:07:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:07:17,757 INFO L93 Difference]: Finished difference Result 647 states and 860 transitions. [2024-10-24 06:07:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 06:07:17,758 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 137 [2024-10-24 06:07:17,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:07:17,765 INFO L225 Difference]: With dead ends: 647 [2024-10-24 06:07:17,766 INFO L226 Difference]: Without dead ends: 379 [2024-10-24 06:07:17,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2024-10-24 06:07:17,769 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 06:07:17,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 582 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 06:07:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-24 06:07:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 361. [2024-10-24 06:07:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 228 states have (on average 1.144736842105263) internal successors, (261), 230 states have internal predecessors, (261), 105 states have call successors, (105), 27 states have call predecessors, (105), 27 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-24 06:07:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 471 transitions. [2024-10-24 06:07:17,826 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 471 transitions. Word has length 137 [2024-10-24 06:07:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:07:17,827 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 471 transitions. [2024-10-24 06:07:17,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 06:07:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 471 transitions. [2024-10-24 06:07:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 06:07:17,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:07:17,832 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:07:17,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 06:07:18,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:07:18,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:07:18,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:07:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1130625202, now seen corresponding path program 1 times [2024-10-24 06:07:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:07:18,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11521180] [2024-10-24 06:07:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:07:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:07:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:07:18,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146064524] [2024-10-24 06:07:18,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:07:18,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:07:18,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:07:18,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:07:18,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 06:07:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:07:18,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-24 06:07:18,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:07:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 260 proven. 210 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-24 06:07:20,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:07:44,246 WARN L286 SmtUtils]: Spent 8.87s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-24 06:07:59,201 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 06:08:06,594 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse1 (+ .cse4 1)) (.cse6 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse5 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (forall ((v_z_8 Int)) (or (< v_z_8 .cse1) (not (= (mod (* v_z_8 .cse2) 4294967296) v_z_8)) (< v_z_8 .cse5) (< .cse6 v_z_8))) (or (< .cse6 .cse3) (< .cse3 .cse5) (< .cse4 .cse3)))))) is different from false