./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.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 daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:19:53,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:19:53,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:19:53,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:19:53,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:19:53,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:19:53,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:19:53,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:19:53,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:19:53,314 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:19:53,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:19:53,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:19:53,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:19:53,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:19:53,316 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:19:53,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:19:53,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:19:53,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:19:53,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:19:53,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:19:53,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:19:53,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:19:53,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:19:53,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:19:53,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:19:53,319 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:19:53,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:19:53,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:19:53,320 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:19:53,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:19:53,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:19:53,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:19:53,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:53,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:19:53,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:19:53,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:19:53,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:19:53,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:19:53,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:19:53,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:19:53,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:19:53,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:19:53,323 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 -> daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff [2024-11-10 08:19:53,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:19:53,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:19:53,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:19:53,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:19:53,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:19:53,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2024-11-10 08:19:54,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:19:55,132 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:19:55,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2024-11-10 08:19:55,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811581308/8ad206da0a6745619074f391dca34e8a/FLAG75e902596 [2024-11-10 08:19:55,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811581308/8ad206da0a6745619074f391dca34e8a [2024-11-10 08:19:55,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:19:55,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:19:55,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:55,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:19:55,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:19:55,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417d9fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55, skipping insertion in model container [2024-11-10 08:19:55,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:19:55,298 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_amount10_file-94.i[915,928] [2024-11-10 08:19:55,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:55,333 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:19:55,342 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_amount10_file-94.i[915,928] [2024-11-10 08:19:55,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:55,366 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:19:55,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55 WrapperNode [2024-11-10 08:19:55,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:55,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:55,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:19:55,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:19:55,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,399 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2024-11-10 08:19:55,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:55,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:19:55,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:19:55,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:19:55,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,422 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-10 08:19:55,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,426 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:19:55,430 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:19:55,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:19:55,430 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:19:55,431 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55" (1/1) ... [2024-11-10 08:19:55,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:55,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:19:55,465 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-10 08:19:55,472 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-10 08:19:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:19:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:19:55,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:19:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:19:55,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:19:55,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:19:55,649 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:19:55,653 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:19:55,861 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L58: havoc property_#t~bitwise10#1;havoc property_#t~short11#1; [2024-11-10 08:19:55,900 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 08:19:55,900 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:19:55,924 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:19:55,925 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:19:55,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:55 BoogieIcfgContainer [2024-11-10 08:19:55,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:19:55,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:19:55,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:19:55,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:19:55,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:19:55" (1/3) ... [2024-11-10 08:19:55,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4fa68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:55, skipping insertion in model container [2024-11-10 08:19:55,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:55" (2/3) ... [2024-11-10 08:19:55,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4fa68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:55, skipping insertion in model container [2024-11-10 08:19:55,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:55" (3/3) ... [2024-11-10 08:19:55,936 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-94.i [2024-11-10 08:19:55,950 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:19:55,950 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:19:56,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:19:56,062 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;@73853be0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:19:56,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:19:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:19:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 08:19:56,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:56,083 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:19:56,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:56,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash 173562978, now seen corresponding path program 1 times [2024-11-10 08:19:56,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:19:56,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492561744] [2024-11-10 08:19:56,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:56,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:19:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:56,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:19:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:56,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:19:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:56,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:19:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:19:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:56,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:19:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:56,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:19:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:19:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:19:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:56,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:19:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:56,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:19:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:19:56,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:19:56,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492561744] [2024-11-10 08:19:56,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492561744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:56,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:56,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:19:56,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282907864] [2024-11-10 08:19:56,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:56,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:19:56,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:19:56,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:19:56,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:19:56,341 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 08:19:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:56,368 INFO L93 Difference]: Finished difference Result 84 states and 127 transitions. [2024-11-10 08:19:56,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:19:56,375 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2024-11-10 08:19:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:56,388 INFO L225 Difference]: With dead ends: 84 [2024-11-10 08:19:56,389 INFO L226 Difference]: Without dead ends: 41 [2024-11-10 08:19:56,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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-10 08:19:56,398 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:56,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:19:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-10 08:19:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-10 08:19:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:19:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2024-11-10 08:19:56,459 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 71 [2024-11-10 08:19:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:56,460 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2024-11-10 08:19:56,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 08:19:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2024-11-10 08:19:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 08:19:56,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:56,463 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:19:56,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:19:56,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:56,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1668038594, now seen corresponding path program 1 times [2024-11-10 08:19:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:19:56,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191337415] [2024-11-10 08:19:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:56,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:19:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:19:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:19:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:19:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:19:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:19:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:19:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:19:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:19:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:19:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:19:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:19:57,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:19:57,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191337415] [2024-11-10 08:19:57,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191337415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:57,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:57,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:19:57,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299835276] [2024-11-10 08:19:57,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:57,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:19:57,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:19:57,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:19:57,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:19:57,098 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:19:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:57,181 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2024-11-10 08:19:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:19:57,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2024-11-10 08:19:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:57,183 INFO L225 Difference]: With dead ends: 82 [2024-11-10 08:19:57,183 INFO L226 Difference]: Without dead ends: 44 [2024-11-10 08:19:57,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:19:57,186 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 18 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:57,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 107 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:19:57,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-10 08:19:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-11-10 08:19:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:19:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2024-11-10 08:19:57,196 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 71 [2024-11-10 08:19:57,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:57,197 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-11-10 08:19:57,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:19:57,198 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2024-11-10 08:19:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 08:19:57,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:57,199 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:19:57,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:19:57,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:57,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1113710212, now seen corresponding path program 1 times [2024-11-10 08:19:57,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:19:57,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377095789] [2024-11-10 08:19:57,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:57,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:19:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:19:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:19:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:19:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:19:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:19:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:19:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:19:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:19:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:19:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:19:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:19:57,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:19:57,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377095789] [2024-11-10 08:19:57,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377095789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:57,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:57,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:19:57,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423172827] [2024-11-10 08:19:57,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:57,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:19:57,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:19:57,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:19:57,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:19:57,447 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:19:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:57,514 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-11-10 08:19:57,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:19:57,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2024-11-10 08:19:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:57,516 INFO L225 Difference]: With dead ends: 56 [2024-11-10 08:19:57,516 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 08:19:57,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:19:57,517 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:57,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 236 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:19:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 08:19:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-11-10 08:19:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:19:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-11-10 08:19:57,524 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 73 [2024-11-10 08:19:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:57,524 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-11-10 08:19:57,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:19:57,524 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-11-10 08:19:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 08:19:57,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:57,526 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:19:57,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:19:57,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:57,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:57,527 INFO L85 PathProgramCache]: Analyzing trace with hash 917196707, now seen corresponding path program 1 times [2024-11-10 08:19:57,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:19:57,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264039562] [2024-11-10 08:19:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:19:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:19:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:19:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:19:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:19:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:19:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:19:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:19:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:19:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:19:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:19:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:19:57,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:19:57,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264039562] [2024-11-10 08:19:57,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264039562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:57,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:57,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 08:19:57,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623254844] [2024-11-10 08:19:57,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:57,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 08:19:57,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:19:57,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 08:19:57,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:19:57,923 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:19:58,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:58,077 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2024-11-10 08:19:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:19:58,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2024-11-10 08:19:58,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:58,079 INFO L225 Difference]: With dead ends: 80 [2024-11-10 08:19:58,079 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 08:19:58,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-10 08:19:58,080 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:58,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 399 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:19:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 08:19:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-11-10 08:19:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 59 states have internal predecessors, (66), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 08:19:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2024-11-10 08:19:58,088 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 73 [2024-11-10 08:19:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:58,089 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2024-11-10 08:19:58,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:19:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2024-11-10 08:19:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 08:19:58,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:58,090 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:19:58,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:19:58,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:58,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2073918947, now seen corresponding path program 1 times [2024-11-10 08:19:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:19:58,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126752376] [2024-11-10 08:19:58,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:19:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:19:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:19:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:19:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:19:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:19:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:19:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:19:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:19:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:19:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:19:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:19:58,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:19:58,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126752376] [2024-11-10 08:19:58,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126752376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:58,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:58,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:19:58,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81698135] [2024-11-10 08:19:58,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:58,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:19:58,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:19:58,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:19:58,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:19:58,152 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:19:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:58,176 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2024-11-10 08:19:58,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:19:58,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 74 [2024-11-10 08:19:58,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:58,178 INFO L225 Difference]: With dead ends: 163 [2024-11-10 08:19:58,178 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 08:19:58,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:19:58,179 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 20 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:58,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 99 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:19:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 08:19:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2024-11-10 08:19:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 08:19:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2024-11-10 08:19:58,187 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 74 [2024-11-10 08:19:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:58,187 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2024-11-10 08:19:58,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:19:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2024-11-10 08:19:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 08:19:58,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:58,188 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:19:58,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 08:19:58,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:58,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:58,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1916949202, now seen corresponding path program 1 times [2024-11-10 08:19:58,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:19:58,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165591106] [2024-11-10 08:19:58,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:58,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:19:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:19:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:19:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:19:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:19:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:19:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:19:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:19:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:19:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:19:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:19:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:19:58,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:19:58,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165591106] [2024-11-10 08:19:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165591106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:58,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:58,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:19:58,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854037047] [2024-11-10 08:19:58,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:58,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:19:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:19:58,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:19:58,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:19:58,237 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:19:58,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:58,258 INFO L93 Difference]: Finished difference Result 142 states and 172 transitions. [2024-11-10 08:19:58,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:19:58,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 74 [2024-11-10 08:19:58,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:58,259 INFO L225 Difference]: With dead ends: 142 [2024-11-10 08:19:58,259 INFO L226 Difference]: Without dead ends: 73 [2024-11-10 08:19:58,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:19:58,260 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 23 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:58,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:19:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-10 08:19:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2024-11-10 08:19:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:19:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2024-11-10 08:19:58,265 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 74 [2024-11-10 08:19:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:58,266 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2024-11-10 08:19:58,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:19:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2024-11-10 08:19:58,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 08:19:58,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:58,270 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:19:58,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 08:19:58,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:58,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash 114741688, now seen corresponding path program 1 times [2024-11-10 08:19:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:19:58,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075034789] [2024-11-10 08:19:58,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:19:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:19:58,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:19:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:19:58,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:19:58,315 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:19:58,316 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:19:58,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 08:19:58,321 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:19:58,359 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:19:58,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:19:58 BoogieIcfgContainer [2024-11-10 08:19:58,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:19:58,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:19:58,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:19:58,366 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:19:58,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:55" (3/4) ... [2024-11-10 08:19:58,368 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:19:58,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:19:58,369 INFO L158 Benchmark]: Toolchain (without parser) took 3214.93ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 84.6MB in the beginning and 182.9MB in the end (delta: -98.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:58,369 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:58,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.67ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 71.3MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:19:58,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.25ms. Allocated memory is still 155.2MB. Free memory was 70.9MB in the beginning and 68.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:19:58,371 INFO L158 Benchmark]: Boogie Preprocessor took 29.31ms. Allocated memory is still 155.2MB. Free memory was 68.6MB in the beginning and 66.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:19:58,371 INFO L158 Benchmark]: IcfgBuilder took 495.96ms. Allocated memory is still 155.2MB. Free memory was 66.2MB in the beginning and 112.3MB in the end (delta: -46.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 08:19:58,372 INFO L158 Benchmark]: TraceAbstraction took 2435.25ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 111.5MB in the beginning and 184.0MB in the end (delta: -72.5MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. [2024-11-10 08:19:58,372 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 216.0MB. Free memory is still 182.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:58,373 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.14ms. Allocated memory is still 123.7MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.67ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 71.3MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.25ms. Allocated memory is still 155.2MB. Free memory was 70.9MB in the beginning and 68.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.31ms. Allocated memory is still 155.2MB. Free memory was 68.6MB in the beginning and 66.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 495.96ms. Allocated memory is still 155.2MB. Free memory was 66.2MB in the beginning and 112.3MB in the end (delta: -46.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2435.25ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 111.5MB in the beginning and 184.0MB in the end (delta: -72.5MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 216.0MB. Free memory is still 182.9MB. There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] unsigned short int var_1_2 = 45931; [L24] unsigned short int var_1_3 = 30067; [L25] unsigned short int var_1_4 = 256; [L26] unsigned short int var_1_5 = 10000; [L27] unsigned short int var_1_6 = 5; [L28] signed long int var_1_7 = -5; VAL [isInitial=0, var_1_1=2, var_1_2=45931, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L62] isInitial = 1 [L63] FCALL initially() [L64] COND TRUE 1 [L65] FCALL updateLastVariables() [L66] CALL updateVariables() [L39] var_1_2 = __VERIFIER_nondet_ushort() [L40] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L40] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L41] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L41] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L42] var_1_3 = __VERIFIER_nondet_ushort() [L43] CALL assume_abort_if_not(var_1_3 >= 24575) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L43] RET assume_abort_if_not(var_1_3 >= 24575) VAL [isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L44] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L44] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L45] var_1_4 = __VERIFIER_nondet_ushort() [L46] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_5=10000, var_1_6=5, var_1_7=-5] [L46] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_5=10000, var_1_6=5, var_1_7=-5] [L47] CALL assume_abort_if_not(var_1_4 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=10000, var_1_6=5, var_1_7=-5] [L47] RET assume_abort_if_not(var_1_4 <= 8192) VAL [isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=10000, var_1_6=5, var_1_7=-5] [L48] var_1_5 = __VERIFIER_nondet_ushort() [L49] CALL assume_abort_if_not(var_1_5 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L49] RET assume_abort_if_not(var_1_5 >= 8191) VAL [isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L50] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L50] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L51] var_1_6 = __VERIFIER_nondet_ushort() [L52] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_7=-5] [L52] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_7=-5] [L53] CALL assume_abort_if_not(var_1_6 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L53] RET assume_abort_if_not(var_1_6 <= 8191) VAL [isInitial=1, var_1_1=2, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L66] RET updateVariables() [L67] CALL step() [L32] var_1_1 = (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))) VAL [isInitial=1, var_1_1=40959, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L33] EXPR (var_1_3 + var_1_6) >> var_1_1 VAL [isInitial=1, var_1_1=40959, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L33] signed long int stepLocal_0 = (var_1_3 + var_1_6) >> var_1_1; [L34] COND FALSE !(var_1_4 != stepLocal_0) VAL [isInitial=1, var_1_1=40959, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L67] RET step() [L68] CALL, EXPR property() [L58] EXPR (var_1_1 == ((unsigned short int) (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))))) && ((var_1_4 != ((var_1_3 + var_1_6) >> var_1_1)) ? (var_1_7 == ((signed long int) var_1_2)) : 1) VAL [isInitial=1, var_1_1=40959, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L58] EXPR (var_1_3 + var_1_6) >> var_1_1 VAL [isInitial=1, var_1_1=40959, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L58] EXPR (var_1_1 == ((unsigned short int) (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))))) && ((var_1_4 != ((var_1_3 + var_1_6) >> var_1_1)) ? (var_1_7 == ((signed long int) var_1_2)) : 1) VAL [isInitial=1, var_1_1=40959, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L58-L59] return (var_1_1 == ((unsigned short int) (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))))) && ((var_1_4 != ((var_1_3 + var_1_6) >> var_1_1)) ? (var_1_7 == ((signed long int) var_1_2)) : 1) ; [L68] RET, EXPR property() [L68] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=40959, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=8191, var_1_7=-5] [L19] reach_error() VAL [isInitial=1, var_1_1=40959, var_1_2=2147614718, var_1_3=-40961, var_1_4=0, var_1_5=8191, var_1_6=8191, var_1_7=-5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 986 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 660 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 282 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 326 mSDtfsCounter, 282 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=4, InterpolantAutomatonStates: 27, 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, 6 MinimizatonAttempts, 47 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 511 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 430 ConstructedInterpolants, 0 QuantifiedInterpolants, 813 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1080/1080 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 08:19:58,399 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:20:00,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:20:00,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:20:00,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:20:00,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:20:00,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:20:00,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:20:00,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:20:00,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:20:00,621 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:20:00,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:20:00,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:20:00,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:20:00,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:20:00,623 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:20:00,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:20:00,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:20:00,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:20:00,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:20:00,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:20:00,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:20:00,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:20:00,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:20:00,628 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:20:00,628 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:20:00,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:20:00,628 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:20:00,629 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:20:00,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:20:00,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:20:00,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:20:00,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:20:00,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:20:00,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:20:00,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:20:00,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:20:00,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:20:00,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:20:00,630 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:20:00,631 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:20:00,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:20:00,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:20:00,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:20:00,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:20:00,633 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 -> daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff [2024-11-10 08:20:00,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:20:00,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:20:00,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:20:00,949 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:20:00,950 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:20:00,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2024-11-10 08:20:02,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:20:02,633 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:20:02,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2024-11-10 08:20:02,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f566194/288a886649b7462cb84b3be3e6a70bb0/FLAG5697762c5 [2024-11-10 08:20:03,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f566194/288a886649b7462cb84b3be3e6a70bb0 [2024-11-10 08:20:03,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:20:03,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:20:03,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:20:03,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:20:03,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:20:03,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77170163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03, skipping insertion in model container [2024-11-10 08:20:03,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:20:03,166 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_amount10_file-94.i[915,928] [2024-11-10 08:20:03,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:20:03,204 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:20:03,215 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_amount10_file-94.i[915,928] [2024-11-10 08:20:03,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:20:03,243 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:20:03,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03 WrapperNode [2024-11-10 08:20:03,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:20:03,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:20:03,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:20:03,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:20:03,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,279 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 69 [2024-11-10 08:20:03,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:20:03,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:20:03,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:20:03,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:20:03,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,301 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-10 08:20:03,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:20:03,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:20:03,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:20:03,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:20:03,326 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:20:03,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:20:03,353 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-10 08:20:03,364 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-10 08:20:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:20:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:20:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:20:03,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:20:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:20:03,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:20:03,474 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:20:03,476 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:20:03,620 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 08:20:03,620 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:20:03,631 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:20:03,631 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:20:03,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:03 BoogieIcfgContainer [2024-11-10 08:20:03,632 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:20:03,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:20:03,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:20:03,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:20:03,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:20:03" (1/3) ... [2024-11-10 08:20:03,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530968d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:20:03, skipping insertion in model container [2024-11-10 08:20:03,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03" (2/3) ... [2024-11-10 08:20:03,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530968d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:20:03, skipping insertion in model container [2024-11-10 08:20:03,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:03" (3/3) ... [2024-11-10 08:20:03,639 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-94.i [2024-11-10 08:20:03,654 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:20:03,654 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:20:03,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:20:03,701 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;@1139d21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:20:03,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:20:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:20:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 08:20:03,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:03,712 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:20:03,713 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:03,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:03,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1404539548, now seen corresponding path program 1 times [2024-11-10 08:20:03,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:20:03,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954750990] [2024-11-10 08:20:03,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:03,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:20:03,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:20:03,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:20:03,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 08:20:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:03,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:20:03,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:20:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-10 08:20:03,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:20:03,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:20:03,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954750990] [2024-11-10 08:20:03,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954750990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:03,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:03,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:20:03,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73098285] [2024-11-10 08:20:03,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:03,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:20:03,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:20:03,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:20:03,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:20:03,880 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:03,897 INFO L93 Difference]: Finished difference Result 68 states and 105 transitions. [2024-11-10 08:20:03,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:20:03,900 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-10 08:20:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:03,905 INFO L225 Difference]: With dead ends: 68 [2024-11-10 08:20:03,905 INFO L226 Difference]: Without dead ends: 33 [2024-11-10 08:20:03,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 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-10 08:20:03,911 INFO L432 NwaCegarLoop]: 43 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, 43 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-10 08:20:03,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:20:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-10 08:20:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-10 08:20:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:20:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-10 08:20:03,941 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 67 [2024-11-10 08:20:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:03,942 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-10 08:20:03,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-10 08:20:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 08:20:03,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:03,945 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:20:03,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 08:20:04,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:20:04,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:04,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:04,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1778113028, now seen corresponding path program 1 times [2024-11-10 08:20:04,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:20:04,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355513013] [2024-11-10 08:20:04,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:04,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:20:04,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:20:04,151 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:20:04,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 08:20:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:04,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 08:20:04,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:20:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:20:04,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:20:04,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:20:04,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355513013] [2024-11-10 08:20:04,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355513013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:04,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:04,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:20:04,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404185903] [2024-11-10 08:20:04,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:04,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:20:04,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:20:04,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:20:04,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:20:04,458 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:04,634 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-11-10 08:20:04,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:20:04,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-10 08:20:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:04,637 INFO L225 Difference]: With dead ends: 46 [2024-11-10 08:20:04,637 INFO L226 Difference]: Without dead ends: 43 [2024-11-10 08:20:04,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:20:04,638 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:20:04,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 163 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:20:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-10 08:20:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-10 08:20:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:20:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-11-10 08:20:04,651 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 67 [2024-11-10 08:20:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:04,652 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-11-10 08:20:04,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-11-10 08:20:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 08:20:04,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:04,658 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:20:04,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 08:20:04,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:20:04,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:04,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1749483877, now seen corresponding path program 1 times [2024-11-10 08:20:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:20:04,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893846077] [2024-11-10 08:20:04,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:04,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:20:04,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:20:04,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:20:04,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 08:20:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:04,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 08:20:04,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:20:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:20:05,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:20:05,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:20:05,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893846077] [2024-11-10 08:20:05,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893846077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:05,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:05,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:20:05,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615468068] [2024-11-10 08:20:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:05,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:20:05,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:20:05,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:20:05,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:20:05,077 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:05,247 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-11-10 08:20:05,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:20:05,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-10 08:20:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:05,249 INFO L225 Difference]: With dead ends: 40 [2024-11-10 08:20:05,249 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:20:05,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:20:05,250 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:20:05,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 163 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:20:05,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:20:05,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:20:05,251 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-10 08:20:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:20:05,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-11-10 08:20:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:05,251 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:20:05,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:20:05,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:20:05,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:20:05,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 08:20:05,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:20:05,459 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 08:20:05,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:20:05,480 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:20:05,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:20:05 BoogieIcfgContainer [2024-11-10 08:20:05,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:20:05,500 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:20:05,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:20:05,501 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:20:05,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:03" (3/4) ... [2024-11-10 08:20:05,504 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:20:05,521 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:20:05,527 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:20:05,527 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 08:20:05,527 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:20:05,528 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:20:05,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:20:05,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:20:05,648 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:20:05,649 INFO L158 Benchmark]: Toolchain (without parser) took 2622.42ms. Allocated memory was 71.3MB in the beginning and 102.8MB in the end (delta: 31.5MB). Free memory was 50.1MB in the beginning and 75.5MB in the end (delta: -25.4MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2024-11-10 08:20:05,649 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory is still 52.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:20:05,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.52ms. Allocated memory is still 71.3MB. Free memory was 50.1MB in the beginning and 36.4MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:20:05,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.44ms. Allocated memory is still 71.3MB. Free memory was 36.4MB in the beginning and 34.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:20:05,650 INFO L158 Benchmark]: Boogie Preprocessor took 44.20ms. Allocated memory is still 71.3MB. Free memory was 34.6MB in the beginning and 32.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:20:05,650 INFO L158 Benchmark]: IcfgBuilder took 306.59ms. Allocated memory was 71.3MB in the beginning and 102.8MB in the end (delta: 31.5MB). Free memory was 32.6MB in the beginning and 72.6MB in the end (delta: -40.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:20:05,650 INFO L158 Benchmark]: TraceAbstraction took 1866.28ms. Allocated memory is still 102.8MB. Free memory was 72.1MB in the beginning and 47.9MB in the end (delta: 24.1MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-11-10 08:20:05,650 INFO L158 Benchmark]: Witness Printer took 148.02ms. Allocated memory is still 102.8MB. Free memory was 47.9MB in the beginning and 75.5MB in the end (delta: -27.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:20:05,652 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 71.3MB. Free memory is still 52.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.52ms. Allocated memory is still 71.3MB. Free memory was 50.1MB in the beginning and 36.4MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.44ms. Allocated memory is still 71.3MB. Free memory was 36.4MB in the beginning and 34.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.20ms. Allocated memory is still 71.3MB. Free memory was 34.6MB in the beginning and 32.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 306.59ms. Allocated memory was 71.3MB in the beginning and 102.8MB in the end (delta: 31.5MB). Free memory was 32.6MB in the beginning and 72.6MB in the end (delta: -40.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1866.28ms. Allocated memory is still 102.8MB. Free memory was 72.1MB in the beginning and 47.9MB in the end (delta: 24.1MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * Witness Printer took 148.02ms. Allocated memory is still 102.8MB. Free memory was 47.9MB in the beginning and 75.5MB in the end (delta: -27.5MB). Peak memory consumption was 2.1MB. 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 369 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 243 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 126 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 310 SizeOfPredicates, 14 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 540/540 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: 64]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:20:05,676 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