./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_amount25_file-79.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 e506e1f7b38bbd8fe6b4b58e9d148d1ba7590120c1d7e1a0e5beae3abdd695ad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:58:05,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:58:05,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:58:05,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:58:05,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:58:05,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:58:05,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:58:05,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:58:05,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:58:05,792 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:58:05,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:58:05,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:58:05,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:58:05,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:58:05,794 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:58:05,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:58:05,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:58:05,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:58:05,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:58:05,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:58:05,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:58:05,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:58:05,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:58:05,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:58:05,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:58:05,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:58:05,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:58:05,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:58:05,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:58:05,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:58:05,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:58:05,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:58:05,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:58:05,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:58:05,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:58:05,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:58:05,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:58:05,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:58:05,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:58:05,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:58:05,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:58:05,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:58:05,804 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 -> e506e1f7b38bbd8fe6b4b58e9d148d1ba7590120c1d7e1a0e5beae3abdd695ad [2024-11-18 23:58:06,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:58:06,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:58:06,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:58:06,096 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:58:06,097 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:58:06,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-79.i [2024-11-18 23:58:07,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:58:07,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:58:07,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-79.i [2024-11-18 23:58:07,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51371c085/7d3c18c1238245e0a3d7c9ca0d2bb407/FLAG568dcd3d5 [2024-11-18 23:58:07,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51371c085/7d3c18c1238245e0a3d7c9ca0d2bb407 [2024-11-18 23:58:07,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:58:07,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:58:07,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:58:07,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:58:07,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:58:07,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:58:07" (1/1) ... [2024-11-18 23:58:07,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebee5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:07, skipping insertion in model container [2024-11-18 23:58:07,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:58:07" (1/1) ... [2024-11-18 23:58:07,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:58:08,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-79.i[915,928] [2024-11-18 23:58:08,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:58:08,122 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:58:08,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-79.i[915,928] [2024-11-18 23:58:08,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:58:08,192 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:58:08,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08 WrapperNode [2024-11-18 23:58:08,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:58:08,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:58:08,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:58:08,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:58:08,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08" (1/1) ... [2024-11-18 23:58:08,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08" (1/1) ... [2024-11-18 23:58:08,248 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-11-18 23:58:08,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:58:08,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:58:08,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:58:08,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:58:08,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08" (1/1) ... [2024-11-18 23:58:08,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08" (1/1) ... [2024-11-18 23:58:08,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08" (1/1) ... [2024-11-18 23:58:08,277 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-18 23:58:08,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08" (1/1) ... [2024-11-18 23:58:08,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08" (1/1) ... [2024-11-18 23:58:08,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08" (1/1) ... [2024-11-18 23:58:08,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08" (1/1) ... [2024-11-18 23:58:08,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08" (1/1) ... [2024-11-18 23:58:08,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08" (1/1) ... [2024-11-18 23:58:08,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:58:08,296 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:58:08,296 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:58:08,296 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:58:08,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08" (1/1) ... [2024-11-18 23:58:08,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:58:08,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:58:08,333 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-18 23:58:08,341 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-18 23:58:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:58:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:58:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:58:08,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:58:08,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:58:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:58:08,445 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:58:08,449 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:58:08,644 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-18 23:58:08,648 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:58:08,662 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:58:08,663 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:58:08,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:08 BoogieIcfgContainer [2024-11-18 23:58:08,664 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:58:08,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:58:08,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:58:08,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:58:08,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:58:07" (1/3) ... [2024-11-18 23:58:08,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e388f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:58:08, skipping insertion in model container [2024-11-18 23:58:08,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:08" (2/3) ... [2024-11-18 23:58:08,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e388f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:58:08, skipping insertion in model container [2024-11-18 23:58:08,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:08" (3/3) ... [2024-11-18 23:58:08,671 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-79.i [2024-11-18 23:58:08,686 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:58:08,686 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:58:08,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:58:08,742 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;@619c911a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:58:08,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:58:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 23:58:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-18 23:58:08,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:58:08,756 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:58:08,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:58:08,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:58:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2094661051, now seen corresponding path program 1 times [2024-11-18 23:58:08,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:58:08,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495208933] [2024-11-18 23:58:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:58:08,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:58:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:58:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-18 23:58:09,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:58:09,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495208933] [2024-11-18 23:58:09,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495208933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:58:09,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102832057] [2024-11-18 23:58:09,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:58:09,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:58:09,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:58:09,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:58:09,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 23:58:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:58:09,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:58:09,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:58:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-18 23:58:09,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:58:09,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102832057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:58:09,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:58:09,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:58:09,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14859682] [2024-11-18 23:58:09,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:58:09,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:58:09,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:58:09,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:58:09,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:58:09,308 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-18 23:58:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:58:09,331 INFO L93 Difference]: Finished difference Result 87 states and 143 transitions. [2024-11-18 23:58:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:58:09,332 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-11-18 23:58:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:58:09,337 INFO L225 Difference]: With dead ends: 87 [2024-11-18 23:58:09,338 INFO L226 Difference]: Without dead ends: 43 [2024-11-18 23:58:09,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 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-18 23:58:09,343 INFO L432 NwaCegarLoop]: 61 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, 61 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-18 23:58:09,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:58:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-18 23:58:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-18 23:58:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 23:58:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2024-11-18 23:58:09,378 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 86 [2024-11-18 23:58:09,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:58:09,379 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2024-11-18 23:58:09,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-18 23:58:09,379 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2024-11-18 23:58:09,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-18 23:58:09,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:58:09,383 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:58:09,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 23:58:09,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 23:58:09,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:58:09,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:58:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1830614459, now seen corresponding path program 1 times [2024-11-18 23:58:09,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:58:09,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507618642] [2024-11-18 23:58:09,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:58:09,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:58:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:58:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-18 23:58:09,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:58:09,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507618642] [2024-11-18 23:58:09,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507618642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:58:09,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:58:09,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:58:09,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246282592] [2024-11-18 23:58:09,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:58:09,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:58:09,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:58:09,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:58:09,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:58:09,841 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 23:58:09,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:58:09,879 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2024-11-18 23:58:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:58:09,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2024-11-18 23:58:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:58:09,884 INFO L225 Difference]: With dead ends: 94 [2024-11-18 23:58:09,884 INFO L226 Difference]: Without dead ends: 54 [2024-11-18 23:58:09,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:58:09,887 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:58:09,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 106 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:58:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-18 23:58:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2024-11-18 23:58:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 23:58:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-18 23:58:09,904 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 86 [2024-11-18 23:58:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:58:09,907 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-18 23:58:09,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 23:58:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-18 23:58:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-18 23:58:09,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:58:09,912 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:58:09,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:58:09,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:58:09,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:58:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1150033681, now seen corresponding path program 1 times [2024-11-18 23:58:09,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:58:09,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973938440] [2024-11-18 23:58:09,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:58:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:58:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:58:10,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 23:58:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:58:10,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 23:58:10,117 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 23:58:10,119 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 23:58:10,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 23:58:10,125 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-18 23:58:10,187 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 23:58:10,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:58:10 BoogieIcfgContainer [2024-11-18 23:58:10,191 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 23:58:10,191 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 23:58:10,191 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 23:58:10,192 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 23:58:10,192 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:08" (3/4) ... [2024-11-18 23:58:10,194 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 23:58:10,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 23:58:10,196 INFO L158 Benchmark]: Toolchain (without parser) took 2395.83ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 75.0MB in the beginning and 133.7MB in the end (delta: -58.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:58:10,196 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:58:10,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.47ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 74.7MB in the beginning and 160.4MB in the end (delta: -85.7MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-11-18 23:58:10,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.81ms. Allocated memory is still 190.8MB. Free memory was 159.3MB in the beginning and 158.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:58:10,197 INFO L158 Benchmark]: Boogie Preprocessor took 39.15ms. Allocated memory is still 190.8MB. Free memory was 158.3MB in the beginning and 155.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 23:58:10,197 INFO L158 Benchmark]: RCFGBuilder took 368.33ms. Allocated memory is still 190.8MB. Free memory was 155.1MB in the beginning and 140.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 23:58:10,198 INFO L158 Benchmark]: TraceAbstraction took 1525.01ms. Allocated memory is still 190.8MB. Free memory was 139.4MB in the beginning and 133.7MB in the end (delta: 5.7MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2024-11-18 23:58:10,198 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 190.8MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:58:10,200 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.47ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 74.7MB in the beginning and 160.4MB in the end (delta: -85.7MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.81ms. Allocated memory is still 190.8MB. Free memory was 159.3MB in the beginning and 158.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.15ms. Allocated memory is still 190.8MB. Free memory was 158.3MB in the beginning and 155.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 368.33ms. Allocated memory is still 190.8MB. Free memory was 155.1MB in the beginning and 140.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1525.01ms. Allocated memory is still 190.8MB. Free memory was 139.4MB in the beginning and 133.7MB in the end (delta: 5.7MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 190.8MB. Free memory is still 133.7MB. 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 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_3 = 0; [L25] signed char var_1_4 = 64; [L26] signed char var_1_5 = 64; [L27] unsigned short int var_1_6 = 25; [L28] float var_1_7 = 256.4; [L29] double var_1_10 = 9999999999.515; [L30] float var_1_11 = 8.5; [L31] float var_1_12 = 2.5; [L32] double var_1_13 = 15.8; [L33] double var_1_14 = 25.8; VAL [isInitial=0, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L66] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L66] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L67] var_1_3 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L68] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L69] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L69] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L70] var_1_4 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L71] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L72] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L72] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L73] var_1_5 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25, var_1_7=1282/5] [L74] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25, var_1_7=1282/5] [L75] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25, var_1_7=1282/5] [L75] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25, var_1_7=1282/5] [L76] var_1_7 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L77] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L78] var_1_11 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L79] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L80] var_1_12 = __VERIFIER_nondet_float() [L81] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L81] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L82] var_1_13 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L83] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L84] var_1_14 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L85] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L98] RET updateVariables() [L99] CALL step() [L37] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L44] COND FALSE !(var_1_7 < (var_1_11 - var_1_12)) [L51] var_1_10 = var_1_14 VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L53] COND TRUE \read(var_1_2) VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L54] COND TRUE (var_1_7 - ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) <= var_1_10 [L55] var_1_6 = ((((256) < 0 ) ? -(256) : (256))) VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=256] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return (((! var_1_2) ? ((! var_1_2) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - var_1_5)))) : 1) && (var_1_2 ? (((var_1_7 - ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) <= var_1_10) ? (var_1_6 == ((unsigned short int) ((((256) < 0 ) ? -(256) : (256))))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) 16)))) && ((var_1_7 < (var_1_11 - var_1_12)) ? (((var_1_7 / 7.2) <= var_1_11) ? (var_1_10 == ((double) (var_1_13 - var_1_14))) : (var_1_10 == ((double) var_1_13))) : (var_1_10 == ((double) var_1_14))) ; VAL [\result=0, isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=256] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=256] [L19] reach_error() VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 120 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 202 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 912/936 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-18 23:58:10,228 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_amount25_file-79.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 e506e1f7b38bbd8fe6b4b58e9d148d1ba7590120c1d7e1a0e5beae3abdd695ad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:58:12,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:58:12,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 23:58:12,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:58:12,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:58:12,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:58:12,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:58:12,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:58:12,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:58:12,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:58:12,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:58:12,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:58:12,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:58:12,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:58:12,442 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:58:12,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:58:12,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:58:12,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:58:12,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:58:12,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:58:12,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:58:12,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:58:12,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:58:12,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 23:58:12,448 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 23:58:12,448 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:58:12,448 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 23:58:12,448 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:58:12,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:58:12,449 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:58:12,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:58:12,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:58:12,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:58:12,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:58:12,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:58:12,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:58:12,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:58:12,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:58:12,453 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 23:58:12,453 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 23:58:12,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:58:12,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:58:12,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:58:12,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:58:12,455 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 -> e506e1f7b38bbd8fe6b4b58e9d148d1ba7590120c1d7e1a0e5beae3abdd695ad [2024-11-18 23:58:12,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:58:12,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:58:12,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:58:12,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:58:12,804 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:58:12,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-79.i [2024-11-18 23:58:14,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:58:14,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:58:14,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-79.i [2024-11-18 23:58:14,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29c19fb08/f638dfe4a4e44cc990c37f46f27f38d4/FLAG320a81a24 [2024-11-18 23:58:14,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29c19fb08/f638dfe4a4e44cc990c37f46f27f38d4 [2024-11-18 23:58:14,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:58:14,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:58:14,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:58:14,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:58:14,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:58:14,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:14,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c9f6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14, skipping insertion in model container [2024-11-18 23:58:14,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:14,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:58:14,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-79.i[915,928] [2024-11-18 23:58:14,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:58:14,936 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:58:14,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-79.i[915,928] [2024-11-18 23:58:14,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:58:14,983 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:58:14,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14 WrapperNode [2024-11-18 23:58:14,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:58:14,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:58:14,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:58:14,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:58:14,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:15,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:15,036 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-18 23:58:15,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:58:15,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:58:15,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:58:15,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:58:15,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:15,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:15,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:15,063 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-18 23:58:15,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:15,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:15,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:15,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:15,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:15,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:15,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:58:15,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:58:15,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:58:15,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:58:15,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14" (1/1) ... [2024-11-18 23:58:15,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:58:15,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:58:15,127 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-18 23:58:15,129 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-18 23:58:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:58:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 23:58:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:58:15,161 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:58:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:58:15,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:58:15,249 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:58:15,251 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:58:28,697 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-18 23:58:28,697 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:58:28,708 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:58:28,708 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:58:28,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:28 BoogieIcfgContainer [2024-11-18 23:58:28,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:58:28,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:58:28,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:58:28,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:58:28,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:58:14" (1/3) ... [2024-11-18 23:58:28,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4759cf34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:58:28, skipping insertion in model container [2024-11-18 23:58:28,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:14" (2/3) ... [2024-11-18 23:58:28,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4759cf34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:58:28, skipping insertion in model container [2024-11-18 23:58:28,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:28" (3/3) ... [2024-11-18 23:58:28,719 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-79.i [2024-11-18 23:58:28,733 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:58:28,733 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:58:28,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:58:28,789 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;@689c2cb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:58:28,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:58:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 23:58:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-18 23:58:28,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:58:28,800 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:58:28,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:58:28,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:58:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2094661051, now seen corresponding path program 1 times [2024-11-18 23:58:28,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:58:28,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687536636] [2024-11-18 23:58:28,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:58:28,815 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-18 23:58:28,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:58:28,818 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-18 23:58:28,819 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-18 23:58:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:58:29,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:58:29,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:58:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-18 23:58:29,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:58:29,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:58:29,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687536636] [2024-11-18 23:58:29,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687536636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:58:29,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:58:29,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 23:58:29,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072169306] [2024-11-18 23:58:29,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:58:29,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:58:29,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:58:29,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:58:29,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:58:29,766 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-18 23:58:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:58:29,787 INFO L93 Difference]: Finished difference Result 87 states and 143 transitions. [2024-11-18 23:58:29,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:58:29,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-11-18 23:58:29,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:58:29,795 INFO L225 Difference]: With dead ends: 87 [2024-11-18 23:58:29,795 INFO L226 Difference]: Without dead ends: 43 [2024-11-18 23:58:29,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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-18 23:58:29,801 INFO L432 NwaCegarLoop]: 61 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, 61 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-18 23:58:29,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:58:29,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-18 23:58:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-18 23:58:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 23:58:29,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2024-11-18 23:58:29,832 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 86 [2024-11-18 23:58:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:58:29,833 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2024-11-18 23:58:29,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-18 23:58:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2024-11-18 23:58:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-18 23:58:29,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:58:29,836 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:58:29,861 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-18 23:58:30,037 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-18 23:58:30,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:58:30,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:58:30,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1830614459, now seen corresponding path program 1 times [2024-11-18 23:58:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:58:30,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214036808] [2024-11-18 23:58:30,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:58:30,040 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-18 23:58:30,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:58:30,042 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-18 23:58:30,043 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-18 23:58:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:58:30,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 23:58:30,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:58:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-18 23:58:31,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:58:31,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:58:31,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214036808] [2024-11-18 23:58:31,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214036808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:58:31,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:58:31,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:58:31,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284833852] [2024-11-18 23:58:31,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:58:31,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:58:31,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:58:31,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:58:31,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:58:31,033 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 23:58:35,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 23:58:39,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 23:58:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:58:39,465 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2024-11-18 23:58:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:58:39,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2024-11-18 23:58:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:58:39,577 INFO L225 Difference]: With dead ends: 94 [2024-11-18 23:58:39,577 INFO L226 Difference]: Without dead ends: 54 [2024-11-18 23:58:39,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:58:39,579 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 15 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-18 23:58:39,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 106 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2024-11-18 23:58:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-18 23:58:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2024-11-18 23:58:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 23:58:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-18 23:58:39,588 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 86 [2024-11-18 23:58:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:58:39,590 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-18 23:58:39,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 23:58:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-18 23:58:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-18 23:58:39,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:58:39,593 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:58:39,631 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-18 23:58:39,793 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-18 23:58:39,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:58:39,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:58:39,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1150033681, now seen corresponding path program 1 times [2024-11-18 23:58:39,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:58:39,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5948258] [2024-11-18 23:58:39,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:58:39,796 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-18 23:58:39,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:58:39,799 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-18 23:58:39,800 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-18 23:58:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:58:40,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 23:58:40,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:59:16,615 WARN L286 SmtUtils]: Spent 9.35s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-18 23:59:33,131 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification. DAG size of input: 10 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 23:59:44,698 WARN L286 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 10 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)