./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_operatoramount_amount25_file-27.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_operatoramount_amount25_file-27.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 b14a474bb0ff17f6a3a6ae227e2568fd910f01f9a72dd1e72a28558eb21922c7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:41:54,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:41:54,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:41:54,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:41:54,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:41:54,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:41:54,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:41:54,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:41:54,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:41:54,746 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:41:54,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:41:54,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:41:54,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:41:54,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:41:54,751 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:41:54,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:41:54,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:41:54,752 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:41:54,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:41:54,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:41:54,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:41:54,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:41:54,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:41:54,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:41:54,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:41:54,754 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:41:54,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:41:54,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:41:54,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:41:54,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:41:54,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:41:54,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:41:54,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:41:54,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:41:54,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:41:54,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:41:54,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:41:54,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:41:54,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:41:54,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:41:54,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:41:54,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:41:54,758 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 -> b14a474bb0ff17f6a3a6ae227e2568fd910f01f9a72dd1e72a28558eb21922c7 [2024-11-20 07:41:55,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:41:55,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:41:55,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:41:55,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:41:55,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:41:55,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i [2024-11-20 07:41:56,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:41:56,913 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:41:56,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i [2024-11-20 07:41:56,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd1dde3d/37466fa141ef4450bb22eef5f5ae788e/FLAGe2b7bdddb [2024-11-20 07:41:57,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd1dde3d/37466fa141ef4450bb22eef5f5ae788e [2024-11-20 07:41:57,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:41:57,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:41:57,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:41:57,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:41:57,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:41:57,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c5bc58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57, skipping insertion in model container [2024-11-20 07:41:57,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:41:57,504 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_operatoramount_amount25_file-27.i[915,928] [2024-11-20 07:41:57,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:41:57,583 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:41:57,598 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_operatoramount_amount25_file-27.i[915,928] [2024-11-20 07:41:57,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:41:57,656 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:41:57,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57 WrapperNode [2024-11-20 07:41:57,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:41:57,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:41:57,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:41:57,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:41:57,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,755 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-20 07:41:57,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:41:57,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:41:57,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:41:57,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:41:57,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,825 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 07:41:57,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:41:57,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:41:57,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:41:57,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:41:57,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57" (1/1) ... [2024-11-20 07:41:57,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:41:57,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:41:57,894 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 07:41:57,902 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 07:41:57,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:41:57,954 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:41:57,954 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:41:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:41:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:41:57,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:41:58,027 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:41:58,031 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:41:58,374 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 07:41:58,374 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:41:58,398 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:41:58,399 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:41:58,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:41:58 BoogieIcfgContainer [2024-11-20 07:41:58,400 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:41:58,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:41:58,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:41:58,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:41:58,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:41:57" (1/3) ... [2024-11-20 07:41:58,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af20e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:41:58, skipping insertion in model container [2024-11-20 07:41:58,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:41:57" (2/3) ... [2024-11-20 07:41:58,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af20e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:41:58, skipping insertion in model container [2024-11-20 07:41:58,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:41:58" (3/3) ... [2024-11-20 07:41:58,412 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-27.i [2024-11-20 07:41:58,431 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:41:58,431 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:41:58,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:41:58,508 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;@451a614d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:41:58,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:41:58,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 07:41:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-20 07:41:58,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:41:58,530 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:41:58,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:41:58,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:41:58,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1601827997, now seen corresponding path program 1 times [2024-11-20 07:41:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:41:58,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969142270] [2024-11-20 07:41:58,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:41:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:41:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:41:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:41:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:41:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:41:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:41:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:41:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:41:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:41:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:41:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:41:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:41:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:41:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:41:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 07:41:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:41:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 07:41:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 07:41:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:41:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 07:41:58,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:41:58,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969142270] [2024-11-20 07:41:58,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969142270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:41:58,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:41:58,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:41:58,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864676366] [2024-11-20 07:41:58,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:41:58,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:41:58,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:41:58,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:41:58,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:41:58,950 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 07:41:58,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:41:58,977 INFO L93 Difference]: Finished difference Result 93 states and 157 transitions. [2024-11-20 07:41:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:41:58,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-11-20 07:41:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:41:58,987 INFO L225 Difference]: With dead ends: 93 [2024-11-20 07:41:58,988 INFO L226 Difference]: Without dead ends: 46 [2024-11-20 07:41:58,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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 07:41:58,998 INFO L432 NwaCegarLoop]: 66 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, 66 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 07:41:58,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:41:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-20 07:41:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-20 07:41:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 07:41:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-20 07:41:59,045 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 107 [2024-11-20 07:41:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:41:59,046 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-20 07:41:59,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 07:41:59,047 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-20 07:41:59,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-20 07:41:59,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:41:59,049 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:41:59,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:41:59,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:41:59,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:41:59,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1732167579, now seen corresponding path program 1 times [2024-11-20 07:41:59,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:41:59,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967095748] [2024-11-20 07:41:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:41:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:41:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:01,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:42:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:01,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:42:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:01,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:42:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:01,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:42:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:01,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:42:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:01,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:42:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:01,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:42:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:01,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:42:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:01,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:42:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:01,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:42:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:02,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:42:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:02,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:42:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:02,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:42:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:02,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 07:42:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:02,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:42:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:02,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 07:42:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:02,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 07:42:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 07:42:02,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:42:02,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967095748] [2024-11-20 07:42:02,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967095748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:02,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:02,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 07:42:02,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668083658] [2024-11-20 07:42:02,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:02,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 07:42:02,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:42:02,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 07:42:02,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:42:02,043 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:42:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:03,180 INFO L93 Difference]: Finished difference Result 137 states and 183 transitions. [2024-11-20 07:42:03,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 07:42:03,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-20 07:42:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:03,186 INFO L225 Difference]: With dead ends: 137 [2024-11-20 07:42:03,186 INFO L226 Difference]: Without dead ends: 135 [2024-11-20 07:42:03,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-20 07:42:03,189 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 120 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:03,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 325 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 07:42:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-20 07:42:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2024-11-20 07:42:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 07:42:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-11-20 07:42:03,228 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 107 [2024-11-20 07:42:03,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:03,229 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-11-20 07:42:03,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:42:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-11-20 07:42:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-20 07:42:03,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:03,236 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:42:03,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 07:42:03,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:03,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:03,237 INFO L85 PathProgramCache]: Analyzing trace with hash 42839783, now seen corresponding path program 1 times [2024-11-20 07:42:03,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:42:03,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178758071] [2024-11-20 07:42:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:03,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:42:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:42:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:42:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:42:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:42:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:42:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:42:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:42:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:42:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:42:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:42:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:42:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:42:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:42:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 07:42:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:42:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 07:42:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 07:42:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 07:42:04,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:42:04,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178758071] [2024-11-20 07:42:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178758071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:04,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:04,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 07:42:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448954998] [2024-11-20 07:42:04,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:04,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 07:42:04,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:42:04,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 07:42:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 07:42:04,409 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:42:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:04,976 INFO L93 Difference]: Finished difference Result 133 states and 179 transitions. [2024-11-20 07:42:04,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 07:42:04,977 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-20 07:42:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:04,979 INFO L225 Difference]: With dead ends: 133 [2024-11-20 07:42:04,979 INFO L226 Difference]: Without dead ends: 131 [2024-11-20 07:42:04,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-20 07:42:04,981 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 122 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:04,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 352 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 07:42:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-20 07:42:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 97. [2024-11-20 07:42:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 07:42:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-11-20 07:42:05,007 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 107 [2024-11-20 07:42:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:05,008 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-11-20 07:42:05,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:42:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-11-20 07:42:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-20 07:42:05,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:05,010 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:42:05,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 07:42:05,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:05,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:05,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1052109209, now seen corresponding path program 1 times [2024-11-20 07:42:05,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:42:05,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034847061] [2024-11-20 07:42:05,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:05,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:42:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:42:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:42:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:42:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:42:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:42:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:42:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:42:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:42:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:42:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:42:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:42:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:42:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:42:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 07:42:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:42:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 07:42:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 07:42:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 07:42:05,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:42:05,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034847061] [2024-11-20 07:42:05,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034847061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:05,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:05,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 07:42:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643442325] [2024-11-20 07:42:05,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:05,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 07:42:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:42:05,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 07:42:05,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:42:05,174 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:42:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:05,302 INFO L93 Difference]: Finished difference Result 193 states and 276 transitions. [2024-11-20 07:42:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 07:42:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-20 07:42:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:05,304 INFO L225 Difference]: With dead ends: 193 [2024-11-20 07:42:05,304 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 07:42:05,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:42:05,310 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 54 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:05,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 245 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:42:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 07:42:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-11-20 07:42:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 07:42:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-20 07:42:05,337 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 107 [2024-11-20 07:42:05,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:05,338 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-20 07:42:05,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:42:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-20 07:42:05,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-20 07:42:05,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:05,342 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:05,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 07:42:05,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:05,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1905129425, now seen corresponding path program 1 times [2024-11-20 07:42:05,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:42:05,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129004696] [2024-11-20 07:42:05,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:05,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:42:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:42:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:42:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:42:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:42:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:42:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:42:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:42:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:42:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:42:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:42:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:42:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:42:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:42:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 07:42:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:42:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 07:42:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 07:42:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 07:42:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 07:42:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 07:42:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 07:42:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 07:42:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 07:42:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 07:42:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 07:42:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 07:42:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 07:42:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 07:42:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 07:42:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 07:42:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 07:42:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 07:42:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-20 07:42:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-20 07:42:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2279 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 2247 trivial. 0 not checked. [2024-11-20 07:42:05,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:42:05,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129004696] [2024-11-20 07:42:05,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129004696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:05,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:05,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 07:42:05,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140934335] [2024-11-20 07:42:05,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:05,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 07:42:05,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:42:05,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 07:42:05,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:42:05,623 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-20 07:42:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:05,730 INFO L93 Difference]: Finished difference Result 133 states and 191 transitions. [2024-11-20 07:42:05,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 07:42:05,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 212 [2024-11-20 07:42:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:05,732 INFO L225 Difference]: With dead ends: 133 [2024-11-20 07:42:05,732 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 07:42:05,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:42:05,735 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:05,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 76 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:42:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 07:42:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 07:42:05,736 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 07:42:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 07:42:05,736 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2024-11-20 07:42:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:05,737 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 07:42:05,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-20 07:42:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 07:42:05,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 07:42:05,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:42:05,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 07:42:05,744 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 07:42:05,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 07:42:05,852 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:42:05,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:42:05 BoogieIcfgContainer [2024-11-20 07:42:05,882 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:42:05,882 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:42:05,882 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:42:05,883 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:42:05,883 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:41:58" (3/4) ... [2024-11-20 07:42:05,885 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 07:42:05,889 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 07:42:05,896 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-20 07:42:05,897 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 07:42:05,897 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 07:42:05,897 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 07:42:06,006 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 07:42:06,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 07:42:06,007 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:42:06,007 INFO L158 Benchmark]: Toolchain (without parser) took 8742.24ms. Allocated memory was 182.5MB in the beginning and 272.6MB in the end (delta: 90.2MB). Free memory was 111.8MB in the beginning and 183.4MB in the end (delta: -71.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-11-20 07:42:06,008 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:42:06,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.93ms. Allocated memory is still 182.5MB. Free memory was 111.6MB in the beginning and 97.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 07:42:06,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.50ms. Allocated memory is still 182.5MB. Free memory was 97.5MB in the beginning and 151.8MB in the end (delta: -54.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-11-20 07:42:06,008 INFO L158 Benchmark]: Boogie Preprocessor took 84.71ms. Allocated memory is still 182.5MB. Free memory was 151.8MB in the beginning and 148.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 07:42:06,009 INFO L158 Benchmark]: RCFGBuilder took 551.89ms. Allocated memory is still 182.5MB. Free memory was 148.7MB in the beginning and 131.0MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 07:42:06,009 INFO L158 Benchmark]: TraceAbstraction took 7479.63ms. Allocated memory was 182.5MB in the beginning and 272.6MB in the end (delta: 90.2MB). Free memory was 130.8MB in the beginning and 189.7MB in the end (delta: -58.8MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-11-20 07:42:06,009 INFO L158 Benchmark]: Witness Printer took 124.52ms. Allocated memory is still 272.6MB. Free memory was 189.7MB in the beginning and 183.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 07:42:06,011 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.20ms. Allocated memory is still 117.4MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.93ms. Allocated memory is still 182.5MB. Free memory was 111.6MB in the beginning and 97.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.50ms. Allocated memory is still 182.5MB. Free memory was 97.5MB in the beginning and 151.8MB in the end (delta: -54.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.71ms. Allocated memory is still 182.5MB. Free memory was 151.8MB in the beginning and 148.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 551.89ms. Allocated memory is still 182.5MB. Free memory was 148.7MB in the beginning and 131.0MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7479.63ms. Allocated memory was 182.5MB in the beginning and 272.6MB in the end (delta: 90.2MB). Free memory was 130.8MB in the beginning and 189.7MB in the end (delta: -58.8MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * Witness Printer took 124.52ms. Allocated memory is still 272.6MB. Free memory was 189.7MB in the beginning and 183.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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 5, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 331 mSDsluCounter, 1064 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 764 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 447 IncrementalHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 300 mSDtfsCounter, 447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=2, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 78 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 2113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4455/4455 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: 98]: Loop Invariant Derived loop invariant: ((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) Ensures: (((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) && ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (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))) && (last_1_var_1_9 == \old(last_1_var_1_9))) && (last_1_var_1_13 == \old(last_1_var_1_13)))) RESULT: Ultimate proved your program to be correct! [2024-11-20 07:42:06,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE