./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-80.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 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:14:32,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:14:32,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:14:32,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:14:32,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:14:32,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:14:32,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:14:32,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:14:32,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:14:32,172 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:14:32,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:14:32,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:14:32,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:14:32,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:14:32,173 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:14:32,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:14:32,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:14:32,176 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:14:32,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:14:32,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:14:32,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:14:32,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:14:32,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:14:32,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:14:32,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:14:32,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:14:32,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:14:32,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:14:32,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:14:32,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:14:32,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:14:32,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:14:32,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:14:32,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:14:32,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:14:32,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:14:32,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:14:32,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:14:32,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:14:32,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:14:32,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:14:32,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:14:32,181 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 -> 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 [2024-11-12 06:14:32,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:14:32,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:14:32,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:14:32,392 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:14:32,393 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:14:32,394 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-80.i [2024-11-12 06:14:33,584 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:14:33,741 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:14:33,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2024-11-12 06:14:33,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3cd2bd9/083e454c89c44631a2862b482a8f1f0c/FLAG691c2f0a4 [2024-11-12 06:14:33,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3cd2bd9/083e454c89c44631a2862b482a8f1f0c [2024-11-12 06:14:33,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:14:33,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:14:33,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:33,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:14:33,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:14:33,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:33" (1/1) ... [2024-11-12 06:14:33,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0eeb46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:33, skipping insertion in model container [2024-11-12 06:14:33,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:33" (1/1) ... [2024-11-12 06:14:33,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:14:33,928 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-80.i[915,928] [2024-11-12 06:14:33,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:33,962 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:14:33,988 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-80.i[915,928] [2024-11-12 06:14:34,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:34,035 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:14:34,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34 WrapperNode [2024-11-12 06:14:34,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:34,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:34,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:14:34,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:14:34,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34" (1/1) ... [2024-11-12 06:14:34,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34" (1/1) ... [2024-11-12 06:14:34,064 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2024-11-12 06:14:34,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:34,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:14:34,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:14:34,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:14:34,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34" (1/1) ... [2024-11-12 06:14:34,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34" (1/1) ... [2024-11-12 06:14:34,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34" (1/1) ... [2024-11-12 06:14:34,087 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-12 06:14:34,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34" (1/1) ... [2024-11-12 06:14:34,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34" (1/1) ... [2024-11-12 06:14:34,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34" (1/1) ... [2024-11-12 06:14:34,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34" (1/1) ... [2024-11-12 06:14:34,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34" (1/1) ... [2024-11-12 06:14:34,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34" (1/1) ... [2024-11-12 06:14:34,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:14:34,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:14:34,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:14:34,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:14:34,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34" (1/1) ... [2024-11-12 06:14:34,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:14:34,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:14:34,131 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-12 06:14:34,133 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-12 06:14:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:14:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:14:34,172 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:14:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:14:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:14:34,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:14:34,234 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:14:34,237 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:14:34,405 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 06:14:34,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:14:34,420 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:14:34,421 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:14:34,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:34 BoogieIcfgContainer [2024-11-12 06:14:34,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:14:34,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:14:34,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:14:34,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:14:34,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:14:33" (1/3) ... [2024-11-12 06:14:34,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2b339c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:34, skipping insertion in model container [2024-11-12 06:14:34,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:34" (2/3) ... [2024-11-12 06:14:34,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2b339c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:34, skipping insertion in model container [2024-11-12 06:14:34,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:34" (3/3) ... [2024-11-12 06:14:34,429 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-80.i [2024-11-12 06:14:34,443 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:14:34,444 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:14:34,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:14:34,505 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;@60570e62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:14:34,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:14:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 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-12 06:14:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 06:14:34,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:34,516 INFO L218 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] [2024-11-12 06:14:34,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:34,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash 211231747, now seen corresponding path program 1 times [2024-11-12 06:14:34,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:14:34,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630569833] [2024-11-12 06:14:34,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:34,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:14:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:34,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:14:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:34,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:14:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:34,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:14:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:34,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 06:14:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:34,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:14:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:34,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:14:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:34,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:14:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:34,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:14:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:34,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:14:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:34,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:14:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:34,741 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-12 06:14:34,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:14:34,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630569833] [2024-11-12 06:14:34,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630569833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:34,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:34,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:14:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338599808] [2024-11-12 06:14:34,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:34,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:14:34,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:14:34,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:14:34,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:14:34,766 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-12 06:14:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:34,782 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2024-11-12 06:14:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:14:34,784 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 66 [2024-11-12 06:14:34,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:34,789 INFO L225 Difference]: With dead ends: 67 [2024-11-12 06:14:34,789 INFO L226 Difference]: Without dead ends: 33 [2024-11-12 06:14:34,792 INFO L434 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-12 06:14:34,795 INFO L435 NwaCegarLoop]: 44 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, 44 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-12 06:14:34,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:14:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-12 06:14:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-12 06:14:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-12 06:14:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-11-12 06:14:34,824 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 66 [2024-11-12 06:14:34,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:34,825 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-11-12 06:14:34,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-12 06:14:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-11-12 06:14:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 06:14:34,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:34,827 INFO L218 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] [2024-11-12 06:14:34,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:14:34,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:34,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:34,828 INFO L85 PathProgramCache]: Analyzing trace with hash 409964679, now seen corresponding path program 1 times [2024-11-12 06:14:34,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:14:34,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741304971] [2024-11-12 06:14:34,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:34,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:14:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:35,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:14:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:35,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:14:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:35,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:14:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:35,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 06:14:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:35,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:14:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:35,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:14:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:35,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:14:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:35,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:14:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:35,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:14:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:35,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:14:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:35,456 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-12 06:14:35,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:14:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741304971] [2024-11-12 06:14:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741304971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:35,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:14:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638778278] [2024-11-12 06:14:35,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:35,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:14:35,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:14:35,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:14:35,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:14:35,461 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-12 06:14:35,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:35,643 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-11-12 06:14:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:14:35,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 66 [2024-11-12 06:14:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:35,646 INFO L225 Difference]: With dead ends: 77 [2024-11-12 06:14:35,646 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 06:14:35,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 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-12 06:14:35,647 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 76 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:35,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 239 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:14:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 06:14:35,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 54. [2024-11-12 06:14:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:14:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2024-11-12 06:14:35,665 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 66 [2024-11-12 06:14:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:35,669 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2024-11-12 06:14:35,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-12 06:14:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2024-11-12 06:14:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 06:14:35,671 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:35,671 INFO L218 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-12 06:14:35,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:14:35,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:35,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:35,672 INFO L85 PathProgramCache]: Analyzing trace with hash -411557169, now seen corresponding path program 1 times [2024-11-12 06:14:35,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:14:35,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643396606] [2024-11-12 06:14:35,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:35,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:14:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:36,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:14:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:36,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:14:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:36,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:14:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:36,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 06:14:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:36,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:14:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:36,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:14:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:36,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:14:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:36,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:14:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:36,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:14:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:36,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:14:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:36,274 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-12 06:14:36,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:14:36,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643396606] [2024-11-12 06:14:36,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643396606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:36,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:36,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 06:14:36,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76582537] [2024-11-12 06:14:36,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:36,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:14:36,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:14:36,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:14:36,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:14:36,277 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-12 06:14:36,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:36,583 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2024-11-12 06:14:36,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 06:14:36,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-12 06:14:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:36,588 INFO L225 Difference]: With dead ends: 94 [2024-11-12 06:14:36,588 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 06:14:36,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-12 06:14:36,590 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 89 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:36,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 233 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:14:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 06:14:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2024-11-12 06:14:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:14:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2024-11-12 06:14:36,611 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 67 [2024-11-12 06:14:36,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:36,612 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2024-11-12 06:14:36,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-12 06:14:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2024-11-12 06:14:36,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 06:14:36,614 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:36,616 INFO L218 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-12 06:14:36,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:14:36,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:36,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:36,617 INFO L85 PathProgramCache]: Analyzing trace with hash -409710127, now seen corresponding path program 1 times [2024-11-12 06:14:36,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:14:36,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129167335] [2024-11-12 06:14:36,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:36,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:14:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:14:36,647 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:14:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:14:36,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:14:36,693 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:14:36,694 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:14:36,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:14:36,698 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 06:14:36,746 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:14:36,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:14:36 BoogieIcfgContainer [2024-11-12 06:14:36,749 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:14:36,750 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:14:36,750 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:14:36,750 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:14:36,750 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:34" (3/4) ... [2024-11-12 06:14:36,752 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:14:36,753 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:14:36,754 INFO L158 Benchmark]: Toolchain (without parser) took 2990.76ms. Allocated memory was 182.5MB in the beginning and 226.5MB in the end (delta: 44.0MB). Free memory was 120.7MB in the beginning and 140.5MB in the end (delta: -19.8MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2024-11-12 06:14:36,755 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 96.5MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:14:36,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.17ms. Allocated memory is still 182.5MB. Free memory was 120.3MB in the beginning and 151.5MB in the end (delta: -31.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 06:14:36,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.52ms. Allocated memory is still 182.5MB. Free memory was 151.5MB in the beginning and 149.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:14:36,755 INFO L158 Benchmark]: Boogie Preprocessor took 34.04ms. Allocated memory is still 182.5MB. Free memory was 149.5MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:14:36,756 INFO L158 Benchmark]: RCFGBuilder took 318.38ms. Allocated memory is still 182.5MB. Free memory was 147.4MB in the beginning and 134.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:14:36,756 INFO L158 Benchmark]: TraceAbstraction took 2326.24ms. Allocated memory was 182.5MB in the beginning and 226.5MB in the end (delta: 44.0MB). Free memory was 134.2MB in the beginning and 140.5MB in the end (delta: -6.3MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2024-11-12 06:14:36,756 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 226.5MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:14:36,758 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.09ms. Allocated memory is still 96.5MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.17ms. Allocated memory is still 182.5MB. Free memory was 120.3MB in the beginning and 151.5MB in the end (delta: -31.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.52ms. Allocated memory is still 182.5MB. Free memory was 151.5MB in the beginning and 149.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.04ms. Allocated memory is still 182.5MB. Free memory was 149.5MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 318.38ms. Allocated memory is still 182.5MB. Free memory was 147.4MB in the beginning and 134.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2326.24ms. Allocated memory was 182.5MB in the beginning and 226.5MB in the end (delta: 44.0MB). Free memory was 134.2MB in the beginning and 140.5MB in the end (delta: -6.3MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 226.5MB. Free memory is still 140.5MB. 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 someBinaryFLOATComparisonOperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] float var_1_4 = 200.75; [L24] float var_1_5 = 5.7; [L25] signed short int var_1_6 = 200; [L26] signed short int var_1_7 = 256; [L27] signed short int var_1_8 = -16; [L28] unsigned char var_1_9 = 1; [L29] unsigned char var_1_10 = 0; VAL [isInitial=0, var_1_10=0, var_1_1=4, var_1_4=803/4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L65] isInitial = 1 [L66] FCALL initially() [L67] COND TRUE 1 [L68] FCALL updateLastVariables() [L69] CALL updateVariables() [L41] var_1_4 = __VERIFIER_nondet_float() [L42] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L42] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L43] var_1_5 = __VERIFIER_nondet_float() [L44] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L44] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L45] var_1_6 = __VERIFIER_nondet_short() [L46] CALL assume_abort_if_not(var_1_6 >= -8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L46] RET assume_abort_if_not(var_1_6 >= -8192) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L47] CALL assume_abort_if_not(var_1_6 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L47] RET assume_abort_if_not(var_1_6 <= 8192) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L48] var_1_7 = __VERIFIER_nondet_short() [L49] CALL assume_abort_if_not(var_1_7 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L49] RET assume_abort_if_not(var_1_7 >= -8191) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L50] CALL assume_abort_if_not(var_1_7 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L50] RET assume_abort_if_not(var_1_7 <= 8191) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L51] var_1_8 = __VERIFIER_nondet_short() [L52] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L52] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L53] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L53] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L54] var_1_10 = __VERIFIER_nondet_uchar() [L55] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L55] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L56] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L56] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L69] RET updateVariables() [L70] CALL step() [L33] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L34] COND TRUE ! (var_1_9 && var_1_9) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L35] COND FALSE !(var_1_4 <= var_1_5) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L70] RET step() [L71] CALL, EXPR property() [L61-L62] return ((! (var_1_9 && var_1_9)) ? ((var_1_4 <= var_1_5) ? (var_1_1 == ((signed short int) ((((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) + var_1_7) + var_1_8))) : 1) : 1) && (var_1_9 == ((unsigned char) var_1_10)) ; VAL [\result=0, isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L71] RET, EXPR property() [L71] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 516 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 339 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 177 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 15, 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, 3 MinimizatonAttempts, 60 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 06:14:36,790 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-80.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 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:14:38,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:14:38,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:14:38,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:14:38,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:14:38,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:14:38,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:14:38,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:14:38,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:14:38,703 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:14:38,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:14:38,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:14:38,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:14:38,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:14:38,704 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:14:38,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:14:38,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:14:38,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:14:38,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:14:38,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:14:38,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:14:38,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:14:38,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:14:38,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:14:38,707 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:14:38,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:14:38,707 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:14:38,708 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:14:38,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:14:38,708 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:14:38,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:14:38,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:14:38,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:14:38,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:14:38,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:14:38,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:14:38,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:14:38,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:14:38,710 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:14:38,710 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:14:38,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:14:38,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:14:38,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:14:38,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:14:38,711 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 -> 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 [2024-11-12 06:14:38,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:14:39,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:14:39,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:14:39,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:14:39,009 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:14:39,010 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-80.i [2024-11-12 06:14:40,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:14:40,424 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:14:40,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2024-11-12 06:14:40,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6a45760/b297ad72083c4e88b513f0e252ef663e/FLAGd4374e791 [2024-11-12 06:14:40,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6a45760/b297ad72083c4e88b513f0e252ef663e [2024-11-12 06:14:40,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:14:40,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:14:40,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:40,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:14:40,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:14:40,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12aae753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40, skipping insertion in model container [2024-11-12 06:14:40,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:14:40,647 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-80.i[915,928] [2024-11-12 06:14:40,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:40,696 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:14:40,708 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-80.i[915,928] [2024-11-12 06:14:40,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:40,743 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:14:40,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40 WrapperNode [2024-11-12 06:14:40,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:40,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:40,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:14:40,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:14:40,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,785 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2024-11-12 06:14:40,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:40,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:14:40,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:14:40,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:14:40,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,813 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-12 06:14:40,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:14:40,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:14:40,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:14:40,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:14:40,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40" (1/1) ... [2024-11-12 06:14:40,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:14:40,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:14:40,862 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-12 06:14:40,864 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-12 06:14:40,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:14:40,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:14:40,912 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:14:40,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:14:40,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:14:40,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:14:40,983 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:14:40,985 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:14:41,146 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 06:14:41,146 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:14:41,161 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:14:41,162 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:14:41,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:41 BoogieIcfgContainer [2024-11-12 06:14:41,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:14:41,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:14:41,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:14:41,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:14:41,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:14:40" (1/3) ... [2024-11-12 06:14:41,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328105c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:41, skipping insertion in model container [2024-11-12 06:14:41,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:40" (2/3) ... [2024-11-12 06:14:41,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328105c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:41, skipping insertion in model container [2024-11-12 06:14:41,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:41" (3/3) ... [2024-11-12 06:14:41,170 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-80.i [2024-11-12 06:14:41,184 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:14:41,184 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:14:41,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:14:41,247 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;@1a55d64c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:14:41,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:14:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 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-12 06:14:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 06:14:41,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:41,259 INFO L218 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] [2024-11-12 06:14:41,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:41,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash 211231747, now seen corresponding path program 1 times [2024-11-12 06:14:41,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:14:41,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714045116] [2024-11-12 06:14:41,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:41,277 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-12 06:14:41,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:14:41,280 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-12 06:14:41,281 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-12 06:14:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:41,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:14:41,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:14:41,438 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-12 06:14:41,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:14:41,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:14:41,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714045116] [2024-11-12 06:14:41,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714045116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:41,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:41,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:14:41,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669481156] [2024-11-12 06:14:41,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:41,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:14:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:14:41,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:14:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:14:41,467 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-12 06:14:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:41,488 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2024-11-12 06:14:41,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:14:41,491 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 66 [2024-11-12 06:14:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:41,496 INFO L225 Difference]: With dead ends: 67 [2024-11-12 06:14:41,497 INFO L226 Difference]: Without dead ends: 33 [2024-11-12 06:14:41,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:14:41,501 INFO L435 NwaCegarLoop]: 44 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, 44 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-12 06:14:41,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:14:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-12 06:14:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-12 06:14:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-12 06:14:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-11-12 06:14:41,529 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 66 [2024-11-12 06:14:41,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:41,529 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-11-12 06:14:41,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-12 06:14:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-11-12 06:14:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 06:14:41,531 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:41,532 INFO L218 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] [2024-11-12 06:14:41,537 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-12 06:14:41,732 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-12 06:14:41,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:41,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:41,734 INFO L85 PathProgramCache]: Analyzing trace with hash 409964679, now seen corresponding path program 1 times [2024-11-12 06:14:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:14:41,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413583796] [2024-11-12 06:14:41,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:41,734 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-12 06:14:41,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:14:41,737 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-12 06:14:41,738 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-12 06:14:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:41,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 06:14:41,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:14:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-12 06:14:41,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:14:41,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:14:41,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413583796] [2024-11-12 06:14:41,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413583796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:41,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:41,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:14:41,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914483539] [2024-11-12 06:14:41,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:41,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:14:41,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:14:41,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:14:41,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:14:41,938 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-12 06:14:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:42,233 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2024-11-12 06:14:42,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 06:14:42,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 66 [2024-11-12 06:14:42,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:42,235 INFO L225 Difference]: With dead ends: 97 [2024-11-12 06:14:42,235 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 06:14:42,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-12 06:14:42,237 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 56 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:42,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 121 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:14:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 06:14:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2024-11-12 06:14:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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-12 06:14:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-11-12 06:14:42,258 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 66 [2024-11-12 06:14:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:42,259 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-11-12 06:14:42,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-12 06:14:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-11-12 06:14:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 06:14:42,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:42,260 INFO L218 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-12 06:14:42,266 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 (3)] Ended with exit code 0 [2024-11-12 06:14:42,461 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-12 06:14:42,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:42,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:42,464 INFO L85 PathProgramCache]: Analyzing trace with hash -411557169, now seen corresponding path program 1 times [2024-11-12 06:14:42,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:14:42,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151640693] [2024-11-12 06:14:42,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:42,464 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-12 06:14:42,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:14:42,466 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-12 06:14:42,467 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-12 06:14:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:42,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 06:14:42,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:14:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 124 proven. 24 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-12 06:14:43,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:14:44,186 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-12 06:14:44,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:14:44,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151640693] [2024-11-12 06:14:44,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151640693] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 06:14:44,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 06:14:44,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2024-11-12 06:14:44,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198882274] [2024-11-12 06:14:44,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:44,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:14:44,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:14:44,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:14:44,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2024-11-12 06:14:44,188 INFO L87 Difference]: Start difference. First operand 37 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-12 06:14:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:44,397 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-11-12 06:14:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:14:44,398 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-12 06:14:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:44,399 INFO L225 Difference]: With dead ends: 72 [2024-11-12 06:14:44,399 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 06:14:44,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2024-11-12 06:14:44,400 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 47 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:44,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 254 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:14:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 06:14:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2024-11-12 06:14:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:14:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-11-12 06:14:44,418 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 67 [2024-11-12 06:14:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:44,418 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-11-12 06:14:44,418 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-12 06:14:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-11-12 06:14:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 06:14:44,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:44,421 INFO L218 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-12 06:14:44,427 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-12 06:14:44,622 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-12 06:14:44,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:44,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:44,623 INFO L85 PathProgramCache]: Analyzing trace with hash -409710127, now seen corresponding path program 1 times [2024-11-12 06:14:44,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:14:44,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055050712] [2024-11-12 06:14:44,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:44,624 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-12 06:14:44,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:14:44,625 INFO L229 MonitoredProcess]: Starting monitored process 5 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-12 06:14:44,626 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 (5)] Waiting until timeout for monitored process [2024-11-12 06:14:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:44,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 06:14:44,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:14:44,875 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-12 06:14:44,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:14:44,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:14:44,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055050712] [2024-11-12 06:14:44,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055050712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:44,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:44,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:14:44,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807728371] [2024-11-12 06:14:44,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:44,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:14:44,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:14:44,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:14:44,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:14:44,878 INFO L87 Difference]: Start difference. First operand 50 states and 60 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-12 06:14:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:45,046 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2024-11-12 06:14:45,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:14:45,047 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-12 06:14:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:45,048 INFO L225 Difference]: With dead ends: 69 [2024-11-12 06:14:45,048 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 06:14:45,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:14:45,051 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:45,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 238 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:14:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 06:14:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 06:14:45,052 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-12 06:14:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 06:14:45,052 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-11-12 06:14:45,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:45,052 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 06:14:45,052 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-12 06:14:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 06:14:45,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 06:14:45,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:14:45,062 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 (5)] Ended with exit code 0 [2024-11-12 06:14:45,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-12 06:14:45,260 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 06:14:45,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 06:14:45,373 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:14:45,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:14:45 BoogieIcfgContainer [2024-11-12 06:14:45,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:14:45,399 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:14:45,399 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:14:45,399 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:14:45,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:41" (3/4) ... [2024-11-12 06:14:45,401 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 06:14:45,404 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 06:14:45,407 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-12 06:14:45,407 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 06:14:45,407 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 06:14:45,407 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 06:14:45,488 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 06:14:45,489 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 06:14:45,489 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:14:45,489 INFO L158 Benchmark]: Toolchain (without parser) took 5013.93ms. Allocated memory was 65.0MB in the beginning and 226.5MB in the end (delta: 161.5MB). Free memory was 46.9MB in the beginning and 166.3MB in the end (delta: -119.4MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2024-11-12 06:14:45,490 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 50.3MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:14:45,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.38ms. Allocated memory is still 65.0MB. Free memory was 46.6MB in the beginning and 32.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:14:45,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.93ms. Allocated memory is still 65.0MB. Free memory was 32.9MB in the beginning and 31.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:14:45,490 INFO L158 Benchmark]: Boogie Preprocessor took 40.10ms. Allocated memory is still 65.0MB. Free memory was 31.1MB in the beginning and 28.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:14:45,490 INFO L158 Benchmark]: RCFGBuilder took 333.69ms. Allocated memory is still 65.0MB. Free memory was 28.9MB in the beginning and 35.5MB in the end (delta: -6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 06:14:45,490 INFO L158 Benchmark]: TraceAbstraction took 4234.21ms. Allocated memory was 65.0MB in the beginning and 226.5MB in the end (delta: 161.5MB). Free memory was 34.7MB in the beginning and 171.6MB in the end (delta: -136.9MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-11-12 06:14:45,491 INFO L158 Benchmark]: Witness Printer took 90.44ms. Allocated memory is still 226.5MB. Free memory was 170.5MB in the beginning and 166.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:14:45,492 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.87ms. Allocated memory is still 50.3MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.38ms. Allocated memory is still 65.0MB. Free memory was 46.6MB in the beginning and 32.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.93ms. Allocated memory is still 65.0MB. Free memory was 32.9MB in the beginning and 31.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.10ms. Allocated memory is still 65.0MB. Free memory was 31.1MB in the beginning and 28.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 333.69ms. Allocated memory is still 65.0MB. Free memory was 28.9MB in the beginning and 35.5MB in the end (delta: -6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4234.21ms. Allocated memory was 65.0MB in the beginning and 226.5MB in the end (delta: 161.5MB). Free memory was 34.7MB in the beginning and 171.6MB in the end (delta: -136.9MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Witness Printer took 90.44ms. Allocated memory is still 226.5MB. Free memory was 170.5MB in the beginning and 166.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 657 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 432 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 249 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 225 mSDtfsCounter, 249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, InterpolantAutomatonStates: 29, 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, 4 MinimizatonAttempts, 50 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 873 SizeOfPredicates, 21 NumberOfNonLiveVariables, 439 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 876/900 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: 67]: Loop Invariant Derived loop invariant: (var_1_10 <= 0) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (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))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10)))) RESULT: Ultimate proved your program to be correct! [2024-11-12 06:14:45,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE