./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.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 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:14:29,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:14:29,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:14:29,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:14:29,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:14:29,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:14:29,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:14:29,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:14:29,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:14:29,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:14:29,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:14:29,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:14:29,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:14:29,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:14:29,422 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:14:29,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:14:29,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:14:29,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:14:29,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:14:29,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:14:29,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:14:29,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:14:29,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:14:29,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:14:29,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:14:29,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:14:29,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:14:29,428 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:14:29,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:14:29,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:14:29,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:14:29,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:14:29,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:14:29,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:14:29,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:14:29,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:14:29,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:14:29,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:14:29,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:14:29,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:14:29,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:14:29,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:14:29,433 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 -> 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae [2024-11-08 23:14:29,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:14:29,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:14:29,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:14:29,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:14:29,751 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:14:29,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2024-11-08 23:14:31,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:14:31,366 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:14:31,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2024-11-08 23:14:31,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26b4fae4/365ed8c111f646c89753d73f9e738dbf/FLAGf2ff1d811 [2024-11-08 23:14:31,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26b4fae4/365ed8c111f646c89753d73f9e738dbf [2024-11-08 23:14:31,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:14:31,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:14:31,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:14:31,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:14:31,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:14:31,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ebff2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31, skipping insertion in model container [2024-11-08 23:14:31,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:14:31,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i[916,929] [2024-11-08 23:14:31,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:14:31,652 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:14:31,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i[916,929] [2024-11-08 23:14:31,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:14:31,706 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:14:31,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31 WrapperNode [2024-11-08 23:14:31,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:14:31,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:14:31,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:14:31,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:14:31,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,758 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-11-08 23:14:31,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:14:31,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:14:31,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:14:31,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:14:31,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,787 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:14:31,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:14:31,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:14:31,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:14:31,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:14:31,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31" (1/1) ... [2024-11-08 23:14:31,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:14:31,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:14:31,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:14:31,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:14:31,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:14:31,893 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:14:31,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:14:31,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:14:31,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:14:31,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:14:32,000 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:14:32,003 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:14:32,352 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-08 23:14:32,352 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:14:32,371 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:14:32,371 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:14:32,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:14:32 BoogieIcfgContainer [2024-11-08 23:14:32,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:14:32,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:14:32,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:14:32,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:14:32,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:14:31" (1/3) ... [2024-11-08 23:14:32,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca821b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:14:32, skipping insertion in model container [2024-11-08 23:14:32,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:14:31" (2/3) ... [2024-11-08 23:14:32,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca821b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:14:32, skipping insertion in model container [2024-11-08 23:14:32,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:14:32" (3/3) ... [2024-11-08 23:14:32,383 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-88.i [2024-11-08 23:14:32,401 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:14:32,402 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:14:32,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:14:32,468 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;@f987fd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:14:32,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:14:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:14:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:14:32,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:14:32,489 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:14:32,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:14:32,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:14:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1173194148, now seen corresponding path program 1 times [2024-11-08 23:14:32,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:14:32,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493207628] [2024-11-08 23:14:32,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:14:32,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:14:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:14:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:14:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:14:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:14:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:14:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:14:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:14:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:14:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:14:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:14:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:14:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:14:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:14:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:14:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:14:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:14:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:14:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:14:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:14:32,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:14:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493207628] [2024-11-08 23:14:32,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493207628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:14:32,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:14:32,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:14:32,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898580068] [2024-11-08 23:14:32,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:14:32,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:14:32,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:14:32,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:14:32,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:14:32,909 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:14:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:14:32,936 INFO L93 Difference]: Finished difference Result 111 states and 188 transitions. [2024-11-08 23:14:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:14:32,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-11-08 23:14:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:14:32,948 INFO L225 Difference]: With dead ends: 111 [2024-11-08 23:14:32,948 INFO L226 Difference]: Without dead ends: 55 [2024-11-08 23:14:32,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:14:32,956 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:14:32,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:14:32,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-08 23:14:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-08 23:14:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:14:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2024-11-08 23:14:33,009 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 116 [2024-11-08 23:14:33,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:14:33,010 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2024-11-08 23:14:33,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:14:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2024-11-08 23:14:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:14:33,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:14:33,013 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:14:33,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:14:33,013 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:14:33,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:14:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1962344732, now seen corresponding path program 1 times [2024-11-08 23:14:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:14:33,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544599891] [2024-11-08 23:14:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:14:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:14:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:14:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:14:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:14:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:14:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:14:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:14:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:14:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:14:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:14:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:14:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:14:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:14:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:14:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:14:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:14:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:34,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:14:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:14:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:14:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:14:35,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:14:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544599891] [2024-11-08 23:14:35,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544599891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:14:35,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:14:35,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 23:14:35,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142739437] [2024-11-08 23:14:35,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:14:35,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:14:35,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:14:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:14:35,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:14:35,032 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 23:14:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:14:35,462 INFO L93 Difference]: Finished difference Result 136 states and 194 transitions. [2024-11-08 23:14:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:14:35,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 116 [2024-11-08 23:14:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:14:35,465 INFO L225 Difference]: With dead ends: 136 [2024-11-08 23:14:35,465 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 23:14:35,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:14:35,468 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 179 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:14:35,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 165 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:14:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 23:14:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2024-11-08 23:14:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:14:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2024-11-08 23:14:35,493 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 116 [2024-11-08 23:14:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:14:35,493 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2024-11-08 23:14:35,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 23:14:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2024-11-08 23:14:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:14:35,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:14:35,497 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:14:35,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:14:35,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:14:35,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:14:35,498 INFO L85 PathProgramCache]: Analyzing trace with hash -557615202, now seen corresponding path program 1 times [2024-11-08 23:14:35,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:14:35,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923255801] [2024-11-08 23:14:35,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:14:35,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:14:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:14:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:14:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:14:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:14:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:14:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:14:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:14:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:14:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:14:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:14:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:14:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:14:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:14:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:14:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:14:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:14:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:14:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:14:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:14:35,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:14:35,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923255801] [2024-11-08 23:14:35,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923255801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:14:35,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:14:35,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:14:35,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570704550] [2024-11-08 23:14:35,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:14:35,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:14:35,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:14:35,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:14:35,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:14:35,966 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:14:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:14:36,161 INFO L93 Difference]: Finished difference Result 181 states and 259 transitions. [2024-11-08 23:14:36,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:14:36,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-08 23:14:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:14:36,164 INFO L225 Difference]: With dead ends: 181 [2024-11-08 23:14:36,164 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 23:14:36,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:14:36,168 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 57 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:14:36,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 208 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:14:36,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 23:14:36,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2024-11-08 23:14:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 23:14:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2024-11-08 23:14:36,209 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 116 [2024-11-08 23:14:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:14:36,209 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2024-11-08 23:14:36,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:14:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2024-11-08 23:14:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:14:36,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:14:36,211 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:14:36,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:14:36,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:14:36,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:14:36,214 INFO L85 PathProgramCache]: Analyzing trace with hash 917685196, now seen corresponding path program 1 times [2024-11-08 23:14:36,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:14:36,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038112301] [2024-11-08 23:14:36,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:14:36,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:14:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:14:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:14:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:14:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:14:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:14:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:14:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:14:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:14:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:14:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:14:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:14:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:14:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:14:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:14:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:14:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:14:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:14:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:14:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:14:36,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:14:36,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038112301] [2024-11-08 23:14:36,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038112301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:14:36,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:14:36,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:14:36,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563125178] [2024-11-08 23:14:36,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:14:36,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:14:36,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:14:36,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:14:36,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:14:36,449 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:14:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:14:36,600 INFO L93 Difference]: Finished difference Result 192 states and 274 transitions. [2024-11-08 23:14:36,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:14:36,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-08 23:14:36,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:14:36,602 INFO L225 Difference]: With dead ends: 192 [2024-11-08 23:14:36,602 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 23:14:36,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:14:36,604 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 54 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:14:36,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 212 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:14:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 23:14:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2024-11-08 23:14:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 73 states have internal predecessors, (90), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 23:14:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-08 23:14:36,635 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 118 [2024-11-08 23:14:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:14:36,636 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-08 23:14:36,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:14:36,637 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-08 23:14:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:14:36,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:14:36,641 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:14:36,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:14:36,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:14:36,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:14:36,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1657814146, now seen corresponding path program 1 times [2024-11-08 23:14:36,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:14:36,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519198566] [2024-11-08 23:14:36,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:14:36,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:14:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:14:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:14:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:14:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:14:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:14:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:14:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:14:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:14:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:14:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:14:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:14:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:14:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:14:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:14:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:14:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:14:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:14:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:14:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:14:36,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:14:36,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519198566] [2024-11-08 23:14:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519198566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:14:36,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:14:36,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 23:14:36,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354218186] [2024-11-08 23:14:36,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:14:36,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:14:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:14:36,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:14:36,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:14:36,955 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:14:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:14:37,237 INFO L93 Difference]: Finished difference Result 211 states and 289 transitions. [2024-11-08 23:14:37,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:14:37,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-08 23:14:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:14:37,241 INFO L225 Difference]: With dead ends: 211 [2024-11-08 23:14:37,241 INFO L226 Difference]: Without dead ends: 146 [2024-11-08 23:14:37,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:14:37,243 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 145 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:14:37,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 344 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:14:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-08 23:14:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2024-11-08 23:14:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 74 states have internal predecessors, (91), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 23:14:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-08 23:14:37,283 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 120 [2024-11-08 23:14:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:14:37,284 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-08 23:14:37,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:14:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-08 23:14:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:14:37,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:14:37,288 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:14:37,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:14:37,288 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:14:37,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:14:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2079707078, now seen corresponding path program 1 times [2024-11-08 23:14:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:14:37,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447818289] [2024-11-08 23:14:37,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:14:37,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:14:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:14:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:14:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:14:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:14:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:14:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:14:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:14:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:14:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:14:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:14:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:14:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:14:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:14:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:14:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:14:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:14:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:14:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:14:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:14:40,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:14:40,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447818289] [2024-11-08 23:14:40,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447818289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:14:40,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:14:40,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:14:40,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124036236] [2024-11-08 23:14:40,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:14:40,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:14:40,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:14:40,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:14:40,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:14:40,154 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:14:40,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:14:40,784 INFO L93 Difference]: Finished difference Result 130 states and 180 transitions. [2024-11-08 23:14:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:14:40,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-08 23:14:40,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:14:40,786 INFO L225 Difference]: With dead ends: 130 [2024-11-08 23:14:40,786 INFO L226 Difference]: Without dead ends: 128 [2024-11-08 23:14:40,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:14:40,787 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 62 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:14:40,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 433 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:14:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-08 23:14:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2024-11-08 23:14:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 84 states have internal predecessors, (103), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 23:14:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2024-11-08 23:14:40,813 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 120 [2024-11-08 23:14:40,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:14:40,813 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2024-11-08 23:14:40,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:14:40,814 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2024-11-08 23:14:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:14:40,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:14:40,815 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:14:40,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:14:40,815 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:14:40,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:14:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1399648708, now seen corresponding path program 1 times [2024-11-08 23:14:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:14:40,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787347372] [2024-11-08 23:14:40,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:14:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:14:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:14:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:14:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:14:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:14:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:14:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:14:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:14:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:14:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:14:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:14:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:14:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:14:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:14:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:14:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:14:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:14:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:14:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:14:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:14:43,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:14:43,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787347372] [2024-11-08 23:14:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787347372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:14:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:14:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:14:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474892242] [2024-11-08 23:14:43,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:14:43,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:14:43,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:14:43,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:14:43,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:14:43,179 INFO L87 Difference]: Start difference. First operand 125 states and 175 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:14:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:14:43,527 INFO L93 Difference]: Finished difference Result 128 states and 178 transitions. [2024-11-08 23:14:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:14:43,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-08 23:14:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:14:43,528 INFO L225 Difference]: With dead ends: 128 [2024-11-08 23:14:43,528 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 23:14:43,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:14:43,529 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 61 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:14:43,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 356 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:14:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 23:14:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 23:14:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 23:14:43,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 23:14:43,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2024-11-08 23:14:43,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:14:43,531 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 23:14:43,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:14:43,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 23:14:43,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:14:43,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:14:43,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:14:43,539 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:14:43,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 23:14:45,389 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:14:45,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:14:45 BoogieIcfgContainer [2024-11-08 23:14:45,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:14:45,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:14:45,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:14:45,419 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:14:45,420 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:14:32" (3/4) ... [2024-11-08 23:14:45,422 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:14:45,426 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 23:14:45,432 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-08 23:14:45,432 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 23:14:45,432 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 23:14:45,433 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:14:45,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 23:14:45,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 23:14:45,549 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:14:45,550 INFO L158 Benchmark]: Toolchain (without parser) took 14158.26ms. Allocated memory was 182.5MB in the beginning and 474.0MB in the end (delta: 291.5MB). Free memory was 147.7MB in the beginning and 199.9MB in the end (delta: -52.1MB). Peak memory consumption was 239.5MB. Max. memory is 16.1GB. [2024-11-08 23:14:45,550 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory was 74.3MB in the beginning and 74.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:14:45,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.90ms. Allocated memory is still 182.5MB. Free memory was 147.7MB in the beginning and 133.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:14:45,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.04ms. Allocated memory is still 182.5MB. Free memory was 133.2MB in the beginning and 131.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:14:45,551 INFO L158 Benchmark]: Boogie Preprocessor took 39.99ms. Allocated memory is still 182.5MB. Free memory was 131.1MB in the beginning and 129.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:14:45,551 INFO L158 Benchmark]: RCFGBuilder took 571.84ms. Allocated memory is still 182.5MB. Free memory was 129.0MB in the beginning and 141.2MB in the end (delta: -12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 23:14:45,552 INFO L158 Benchmark]: TraceAbstraction took 13040.97ms. Allocated memory was 182.5MB in the beginning and 474.0MB in the end (delta: 291.5MB). Free memory was 140.2MB in the beginning and 206.2MB in the end (delta: -66.0MB). Peak memory consumption was 229.7MB. Max. memory is 16.1GB. [2024-11-08 23:14:45,552 INFO L158 Benchmark]: Witness Printer took 130.31ms. Allocated memory is still 474.0MB. Free memory was 206.2MB in the beginning and 199.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:14:45,553 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory was 74.3MB in the beginning and 74.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.90ms. Allocated memory is still 182.5MB. Free memory was 147.7MB in the beginning and 133.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.04ms. Allocated memory is still 182.5MB. Free memory was 133.2MB in the beginning and 131.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.99ms. Allocated memory is still 182.5MB. Free memory was 131.1MB in the beginning and 129.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 571.84ms. Allocated memory is still 182.5MB. Free memory was 129.0MB in the beginning and 141.2MB in the end (delta: -12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13040.97ms. Allocated memory was 182.5MB in the beginning and 474.0MB in the end (delta: 291.5MB). Free memory was 140.2MB in the beginning and 206.2MB in the end (delta: -66.0MB). Peak memory consumption was 229.7MB. Max. memory is 16.1GB. * Witness Printer took 130.31ms. Allocated memory is still 474.0MB. Free memory was 206.2MB in the beginning and 199.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 558 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 558 mSDsluCounter, 1799 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1235 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 530 IncrementalHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 564 mSDtfsCounter, 530 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=6, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 73 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 826 NumberOfCodeBlocks, 826 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 819 ConstructedInterpolants, 0 QuantifiedInterpolants, 4788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 4284/4284 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((16 + var_1_15) == 0) && ((((last_1_var_1_15 >= 0) ? (last_1_var_1_15 / 4294967296) : ((last_1_var_1_15 / 4294967296) - 1)) + 1) <= 0)) && (last_1_var_1_18 == 0)) && (25 == var_1_10)) && (var_1_7 <= 127)) && (last_1_var_1_10 <= (41 + last_1_var_1_15))) && ((var_1_9 == 127) || (var_1_9 < 127))) && (25 <= last_1_var_1_10)) && (var_1_18 == 0)) && (var_1_5 == 0)) && (var_1_1 <= var_1_7)) || (((((var_1_1 == var_1_7) && (var_1_7 <= 127)) && ((((var_1_9 < var_1_7) || (((((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) == var_1_8) || (127 < ((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)))) && ((((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) == (256 + var_1_8)) || (((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) < 128)))) && ((((127 < ((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256))) || (((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256)) == var_1_8)) && ((((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256)) == (256 + var_1_8)) || (((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256)) < 128))) || (var_1_7 < (var_1_9 + 1)))) || (var_1_5 == 0))) && ((var_1_9 == 127) || (var_1_9 < 127))) && (((((var_1_8 + 1) <= 0) && (((long long) var_1_8 + var_1_14) == 0)) || ((0 <= var_1_8) && (var_1_8 == var_1_14))) || (((var_1_8 >= 0) ? (var_1_8 % 4294967296) : ((var_1_8 % 4294967296) + 4294967296)) < var_1_12)))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((var_1_7 <= 127) && ((var_1_9 == 127) || (var_1_9 < 127))) Ensures: (((var_1_7 <= 127) && ((var_1_9 == 127) || (var_1_9 < 127))) && ((((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) && (last_1_var_1_10 == \old(last_1_var_1_10))) && (last_1_var_1_15 == \old(last_1_var_1_15))) && (last_1_var_1_18 == \old(last_1_var_1_18)))) RESULT: Ultimate proved your program to be correct! [2024-11-08 23:14:45,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE