./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_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-wip.dd.update-z3-fca748b-m [2024-11-20 06:07:24,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:07:24,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:07:24,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:07:24,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:07:25,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:07:25,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:07:25,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:07:25,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:07:25,038 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:07:25,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:07:25,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:07:25,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:07:25,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:07:25,042 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:07:25,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:07:25,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:07:25,043 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:07:25,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:07:25,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:07:25,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:07:25,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:07:25,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:07:25,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:07:25,049 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:07:25,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:07:25,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:07:25,050 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:07:25,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:07:25,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:07:25,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:07:25,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:07:25,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:07:25,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:07:25,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:07:25,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:07:25,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:07:25,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:07:25,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:07:25,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:07:25,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:07:25,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:07:25,057 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-20 06:07:25,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:07:25,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:07:25,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:07:25,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:07:25,371 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:07:25,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2024-11-20 06:07:26,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:07:27,051 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:07:27,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2024-11-20 06:07:27,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1665e9782/185218a5d4dd4814910039059763e3c4/FLAG6f288ba28 [2024-11-20 06:07:27,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1665e9782/185218a5d4dd4814910039059763e3c4 [2024-11-20 06:07:27,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:07:27,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:07:27,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:07:27,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:07:27,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:07:27,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3c4331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27, skipping insertion in model container [2024-11-20 06:07:27,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:07:27,613 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-20 06:07:27,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:07:27,665 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:07:27,676 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-20 06:07:27,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:07:27,717 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:07:27,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27 WrapperNode [2024-11-20 06:07:27,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:07:27,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:07:27,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:07:27,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:07:27,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,762 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-11-20 06:07:27,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:07:27,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:07:27,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:07:27,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:07:27,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,798 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:07:27,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:07:27,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:07:27,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:07:27,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:07:27,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27" (1/1) ... [2024-11-20 06:07:27,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:07:27,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:07:27,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:07:27,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:07:27,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:07:27,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:07:27,919 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:07:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:07:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:07:27,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:07:27,990 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:07:27,992 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:07:28,430 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-20 06:07:28,430 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:07:28,451 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:07:28,453 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:07:28,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:07:28 BoogieIcfgContainer [2024-11-20 06:07:28,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:07:28,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:07:28,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:07:28,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:07:28,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:07:27" (1/3) ... [2024-11-20 06:07:28,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7eef62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:07:28, skipping insertion in model container [2024-11-20 06:07:28,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:07:27" (2/3) ... [2024-11-20 06:07:28,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7eef62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:07:28, skipping insertion in model container [2024-11-20 06:07:28,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:07:28" (3/3) ... [2024-11-20 06:07:28,465 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-88.i [2024-11-20 06:07:28,478 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:07:28,479 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:07:28,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:07:28,543 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;@1e72fb51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:07:28,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:07:28,547 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-20 06:07:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 06:07:28,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:07:28,562 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-20 06:07:28,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:07:28,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:07:28,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1173194148, now seen corresponding path program 1 times [2024-11-20 06:07:28,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:07:28,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215489805] [2024-11-20 06:07:28,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:07:28,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:07:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:07:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:07:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:07:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:07:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:07:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:07:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:07:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:07:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:07:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:07:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:07:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:07:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:07:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:07:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:07:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:07:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:07:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:07:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:28,936 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-20 06:07:28,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:07:28,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215489805] [2024-11-20 06:07:28,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215489805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:07:28,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:07:28,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:07:28,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686349050] [2024-11-20 06:07:28,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:07:28,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:07:28,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:07:28,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:07:28,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:07:28,967 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-20 06:07:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:07:28,994 INFO L93 Difference]: Finished difference Result 111 states and 188 transitions. [2024-11-20 06:07:28,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:07:28,998 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-20 06:07:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:07:29,006 INFO L225 Difference]: With dead ends: 111 [2024-11-20 06:07:29,007 INFO L226 Difference]: Without dead ends: 55 [2024-11-20 06:07:29,009 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-20 06:07:29,012 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-20 06:07:29,013 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-20 06:07:29,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-20 06:07:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-20 06:07:29,063 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-20 06:07:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2024-11-20 06:07:29,068 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 116 [2024-11-20 06:07:29,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:07:29,069 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2024-11-20 06:07:29,069 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-20 06:07:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2024-11-20 06:07:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 06:07:29,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:07:29,075 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-20 06:07:29,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:07:29,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:07:29,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:07:29,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1962344732, now seen corresponding path program 1 times [2024-11-20 06:07:29,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:07:29,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079400261] [2024-11-20 06:07:29,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:07:29,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:07:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:07:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:07:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:07:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:07:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:07:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:07:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:07:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:07:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:07:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:07:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:07:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:07:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:07:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:07:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:07:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:07:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:07:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:07:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:31,332 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-20 06:07:31,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:07:31,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079400261] [2024-11-20 06:07:31,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079400261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:07:31,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:07:31,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 06:07:31,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784198601] [2024-11-20 06:07:31,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:07:31,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 06:07:31,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:07:31,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 06:07:31,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:07:31,339 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-20 06:07:31,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:07:31,790 INFO L93 Difference]: Finished difference Result 136 states and 194 transitions. [2024-11-20 06:07:31,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 06:07:31,793 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-20 06:07:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:07:31,795 INFO L225 Difference]: With dead ends: 136 [2024-11-20 06:07:31,795 INFO L226 Difference]: Without dead ends: 84 [2024-11-20 06:07:31,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:07:31,799 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 179 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-20 06:07:31,799 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-20 06:07:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-20 06:07:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2024-11-20 06:07:31,818 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-20 06:07:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2024-11-20 06:07:31,820 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 116 [2024-11-20 06:07:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:07:31,822 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2024-11-20 06:07:31,822 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-20 06:07:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2024-11-20 06:07:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 06:07:31,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:07:31,825 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-20 06:07:31,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:07:31,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:07:31,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:07:31,827 INFO L85 PathProgramCache]: Analyzing trace with hash -557615202, now seen corresponding path program 1 times [2024-11-20 06:07:31,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:07:31,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363030865] [2024-11-20 06:07:31,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:07:31,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:07:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:07:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:07:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:07:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:07:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:07:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:07:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:07:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:07:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:07:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:07:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:07:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:07:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:07:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:07:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:07:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:07:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:07:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:07:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,318 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-20 06:07:32,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:07:32,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363030865] [2024-11-20 06:07:32,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363030865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:07:32,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:07:32,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:07:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355454415] [2024-11-20 06:07:32,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:07:32,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:07:32,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:07:32,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:07:32,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:07:32,324 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-20 06:07:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:07:32,517 INFO L93 Difference]: Finished difference Result 181 states and 259 transitions. [2024-11-20 06:07:32,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:07:32,518 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-20 06:07:32,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:07:32,522 INFO L225 Difference]: With dead ends: 181 [2024-11-20 06:07:32,524 INFO L226 Difference]: Without dead ends: 122 [2024-11-20 06:07:32,525 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-20 06:07:32,527 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-20 06:07:32,528 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-20 06:07:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-20 06:07:32,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2024-11-20 06:07:32,576 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-20 06:07:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2024-11-20 06:07:32,578 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 116 [2024-11-20 06:07:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:07:32,579 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2024-11-20 06:07:32,581 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-20 06:07:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2024-11-20 06:07:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 06:07:32,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:07:32,585 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-20 06:07:32,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:07:32,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:07:32,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:07:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash 917685196, now seen corresponding path program 1 times [2024-11-20 06:07:32,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:07:32,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389752318] [2024-11-20 06:07:32,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:07:32,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:07:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:07:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:07:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:07:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:07:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:07:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:07:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:07:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:07:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:07:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:07:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:07:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:07:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:07:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:07:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:07:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:07:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:07:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:07:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:32,851 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-20 06:07:32,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:07:32,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389752318] [2024-11-20 06:07:32,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389752318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:07:32,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:07:32,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:07:32,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816897910] [2024-11-20 06:07:32,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:07:32,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:07:32,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:07:32,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:07:32,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:07:32,854 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-20 06:07:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:07:32,999 INFO L93 Difference]: Finished difference Result 192 states and 274 transitions. [2024-11-20 06:07:32,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:07:33,000 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-20 06:07:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:07:33,002 INFO L225 Difference]: With dead ends: 192 [2024-11-20 06:07:33,002 INFO L226 Difference]: Without dead ends: 122 [2024-11-20 06:07:33,003 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-20 06:07:33,004 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-20 06:07:33,007 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-20 06:07:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-20 06:07:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2024-11-20 06:07:33,041 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-20 06:07:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-20 06:07:33,043 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 118 [2024-11-20 06:07:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:07:33,044 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-20 06:07:33,044 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-20 06:07:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-20 06:07:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 06:07:33,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:07:33,047 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-20 06:07:33,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:07:33,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:07:33,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:07:33,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1657814146, now seen corresponding path program 1 times [2024-11-20 06:07:33,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:07:33,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248453815] [2024-11-20 06:07:33,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:07:33,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:07:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:07:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:07:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:07:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:07:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:07:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:07:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:07:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:07:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:07:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:07:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:07:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:07:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:07:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:07:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:07:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:07:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:07:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:07:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:33,356 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-20 06:07:33,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:07:33,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248453815] [2024-11-20 06:07:33,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248453815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:07:33,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:07:33,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 06:07:33,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902324688] [2024-11-20 06:07:33,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:07:33,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 06:07:33,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:07:33,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 06:07:33,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:07:33,362 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-20 06:07:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:07:33,638 INFO L93 Difference]: Finished difference Result 211 states and 289 transitions. [2024-11-20 06:07:33,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 06:07:33,639 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-20 06:07:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:07:33,643 INFO L225 Difference]: With dead ends: 211 [2024-11-20 06:07:33,643 INFO L226 Difference]: Without dead ends: 146 [2024-11-20 06:07:33,644 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-20 06:07:33,644 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 145 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 06:07:33,645 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-20 06:07:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-20 06:07:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2024-11-20 06:07:33,678 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-20 06:07:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-20 06:07:33,680 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 120 [2024-11-20 06:07:33,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:07:33,682 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-20 06:07:33,682 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-20 06:07:33,682 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-20 06:07:33,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 06:07:33,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:07:33,683 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-20 06:07:33,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:07:33,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:07:33,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:07:33,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2079707078, now seen corresponding path program 1 times [2024-11-20 06:07:33,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:07:33,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583630858] [2024-11-20 06:07:33,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:07:33,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:07:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:07:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:07:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:07:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:07:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:07:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:07:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:07:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:07:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:07:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:07:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:07:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:07:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:07:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:07:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:07:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:07:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:07:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:07:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:36,655 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-20 06:07:36,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:07:36,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583630858] [2024-11-20 06:07:36,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583630858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:07:36,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:07:36,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:07:36,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540702350] [2024-11-20 06:07:36,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:07:36,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:07:36,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:07:36,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:07:36,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:07:36,658 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-20 06:07:37,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:07:37,300 INFO L93 Difference]: Finished difference Result 130 states and 180 transitions. [2024-11-20 06:07:37,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:07:37,301 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-20 06:07:37,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:07:37,302 INFO L225 Difference]: With dead ends: 130 [2024-11-20 06:07:37,302 INFO L226 Difference]: Without dead ends: 128 [2024-11-20 06:07:37,303 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-20 06:07:37,303 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-20 06:07:37,304 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-20 06:07:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-20 06:07:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2024-11-20 06:07:37,358 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-20 06:07:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2024-11-20 06:07:37,360 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 120 [2024-11-20 06:07:37,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:07:37,360 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2024-11-20 06:07:37,361 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-20 06:07:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2024-11-20 06:07:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 06:07:37,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:07:37,363 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-20 06:07:37,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 06:07:37,363 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:07:37,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:07:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1399648708, now seen corresponding path program 1 times [2024-11-20 06:07:37,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:07:37,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909216323] [2024-11-20 06:07:37,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:07:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:07:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:07:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:07:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:07:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:07:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:07:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:07:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:07:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:07:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:07:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:07:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:07:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:07:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:07:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:07:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:07:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:07:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:07:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:07:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:39,888 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-20 06:07:39,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:07:39,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909216323] [2024-11-20 06:07:39,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909216323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:07:39,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:07:39,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:07:39,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081149889] [2024-11-20 06:07:39,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:07:39,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:07:39,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:07:39,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:07:39,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:07:39,891 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-20 06:07:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:07:40,249 INFO L93 Difference]: Finished difference Result 128 states and 178 transitions. [2024-11-20 06:07:40,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:07:40,250 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-20 06:07:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:07:40,250 INFO L225 Difference]: With dead ends: 128 [2024-11-20 06:07:40,250 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 06:07:40,251 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-20 06:07:40,251 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-20 06:07:40,252 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-20 06:07:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 06:07:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 06:07:40,252 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-20 06:07:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 06:07:40,253 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2024-11-20 06:07:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:07:40,253 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 06:07:40,253 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-20 06:07:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 06:07:40,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 06:07:40,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:07:40,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 06:07:40,265 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:07:40,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 06:07:42,127 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:07:42,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:07:42 BoogieIcfgContainer [2024-11-20 06:07:42,154 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:07:42,155 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:07:42,155 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:07:42,155 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:07:42,158 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:07:28" (3/4) ... [2024-11-20 06:07:42,160 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 06:07:42,164 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 06:07:42,172 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-20 06:07:42,173 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 06:07:42,173 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 06:07:42,174 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 06:07:42,286 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 06:07:42,286 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 06:07:42,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:07:42,287 INFO L158 Benchmark]: Toolchain (without parser) took 14864.27ms. Allocated memory was 163.6MB in the beginning and 440.4MB in the end (delta: 276.8MB). Free memory was 123.5MB in the beginning and 308.4MB in the end (delta: -184.9MB). Peak memory consumption was 90.6MB. Max. memory is 16.1GB. [2024-11-20 06:07:42,287 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:07:42,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.74ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 108.8MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 06:07:42,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.06ms. Allocated memory is still 163.6MB. Free memory was 108.8MB in the beginning and 105.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:07:42,288 INFO L158 Benchmark]: Boogie Preprocessor took 53.64ms. Allocated memory is still 163.6MB. Free memory was 105.9MB in the beginning and 103.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:07:42,288 INFO L158 Benchmark]: RCFGBuilder took 634.76ms. Allocated memory is still 163.6MB. Free memory was 103.8MB in the beginning and 125.7MB in the end (delta: -21.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 06:07:42,288 INFO L158 Benchmark]: TraceAbstraction took 13698.03ms. Allocated memory was 163.6MB in the beginning and 440.4MB in the end (delta: 276.8MB). Free memory was 124.9MB in the beginning and 314.7MB in the end (delta: -189.7MB). Peak memory consumption was 212.9MB. Max. memory is 16.1GB. [2024-11-20 06:07:42,288 INFO L158 Benchmark]: Witness Printer took 131.73ms. Allocated memory is still 440.4MB. Free memory was 314.7MB in the beginning and 308.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 06:07:42,289 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.17ms. Allocated memory is still 100.7MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.74ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 108.8MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.06ms. Allocated memory is still 163.6MB. Free memory was 108.8MB in the beginning and 105.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.64ms. Allocated memory is still 163.6MB. Free memory was 105.9MB in the beginning and 103.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 634.76ms. Allocated memory is still 163.6MB. Free memory was 103.8MB in the beginning and 125.7MB in the end (delta: -21.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13698.03ms. Allocated memory was 163.6MB in the beginning and 440.4MB in the end (delta: 276.8MB). Free memory was 124.9MB in the beginning and 314.7MB in the end (delta: -189.7MB). Peak memory consumption was 212.9MB. Max. memory is 16.1GB. * Witness Printer took 131.73ms. Allocated memory is still 440.4MB. Free memory was 314.7MB in the beginning and 308.4MB 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.7s, 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.7s 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-20 06:07:42,318 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