./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-73.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 2d76b174fceab1b4f0b7c723c11189a89dfae9fb8b439d670404c7bcb817a6a0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:53:17,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:53:17,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:53:17,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:53:17,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:53:17,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:53:17,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:53:17,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:53:17,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:53:17,167 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:53:17,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:53:17,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:53:17,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:53:17,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:53:17,169 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:53:17,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:53:17,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:53:17,170 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:53:17,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:53:17,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:53:17,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:53:17,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:53:17,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:53:17,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:53:17,176 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:53:17,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:53:17,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:53:17,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:53:17,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:53:17,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:53:17,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:53:17,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:53:17,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:53:17,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:53:17,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:53:17,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:53:17,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:53:17,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:53:17,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:53:17,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:53:17,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:53:17,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:53:17,181 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d76b174fceab1b4f0b7c723c11189a89dfae9fb8b439d670404c7bcb817a6a0 [2024-11-09 00:53:17,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:53:17,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:53:17,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:53:17,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:53:17,463 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:53:17,464 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-73.i [2024-11-09 00:53:18,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:53:19,043 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:53:19,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-73.i [2024-11-09 00:53:19,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c828d275f/3571d641e7f948bab54f662a9bfb25ba/FLAG2d99aa7c9 [2024-11-09 00:53:19,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c828d275f/3571d641e7f948bab54f662a9bfb25ba [2024-11-09 00:53:19,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:53:19,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:53:19,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:53:19,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:53:19,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:53:19,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a368945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19, skipping insertion in model container [2024-11-09 00:53:19,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:53:19,640 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-73.i[915,928] [2024-11-09 00:53:19,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:53:19,694 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:53:19,704 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-73.i[915,928] [2024-11-09 00:53:19,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:53:19,741 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:53:19,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19 WrapperNode [2024-11-09 00:53:19,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:53:19,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:53:19,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:53:19,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:53:19,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,789 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-11-09 00:53:19,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:53:19,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:53:19,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:53:19,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:53:19,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,828 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-09 00:53:19,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:53:19,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:53:19,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:53:19,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:53:19,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19" (1/1) ... [2024-11-09 00:53:19,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:53:19,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:53:19,887 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-09 00:53:19,896 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-09 00:53:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:53:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:53:19,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:53:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:53:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:53:19,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:53:20,021 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:53:20,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:53:20,286 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:53:20,286 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:53:20,298 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:53:20,298 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:53:20,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:53:20 BoogieIcfgContainer [2024-11-09 00:53:20,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:53:20,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:53:20,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:53:20,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:53:20,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:53:19" (1/3) ... [2024-11-09 00:53:20,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b162212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:53:20, skipping insertion in model container [2024-11-09 00:53:20,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:19" (2/3) ... [2024-11-09 00:53:20,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b162212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:53:20, skipping insertion in model container [2024-11-09 00:53:20,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:53:20" (3/3) ... [2024-11-09 00:53:20,317 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-73.i [2024-11-09 00:53:20,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:53:20,331 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:53:20,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:53:20,385 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;@93d2ee2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:53:20,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:53:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:53:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 00:53:20,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:53:20,401 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:53:20,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:53:20,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:53:20,407 INFO L85 PathProgramCache]: Analyzing trace with hash 715450892, now seen corresponding path program 1 times [2024-11-09 00:53:20,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:53:20,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941390825] [2024-11-09 00:53:20,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:53:20,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:53:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:53:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:20,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:53:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:20,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:53:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:20,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:53:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:20,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:53:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:20,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:53:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:20,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:53:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:20,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:53:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:20,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:53:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:53:20,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:53:20,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941390825] [2024-11-09 00:53:20,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941390825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:53:20,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:53:20,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:53:20,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578308164] [2024-11-09 00:53:20,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:53:20,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:53:20,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:53:20,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:53:20,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:53:20,742 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 00:53:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:53:20,767 INFO L93 Difference]: Finished difference Result 71 states and 113 transitions. [2024-11-09 00:53:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:53:20,769 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2024-11-09 00:53:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:53:20,776 INFO L225 Difference]: With dead ends: 71 [2024-11-09 00:53:20,777 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 00:53:20,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-09 00:53:20,783 INFO L432 NwaCegarLoop]: 48 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, 48 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-09 00:53:20,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:53:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 00:53:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 00:53:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:53:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2024-11-09 00:53:20,840 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 63 [2024-11-09 00:53:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:53:20,840 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2024-11-09 00:53:20,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 00:53:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2024-11-09 00:53:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 00:53:20,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:53:20,869 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:53:20,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:53:20,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:53:20,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:53:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash 476516110, now seen corresponding path program 1 times [2024-11-09 00:53:20,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:53:20,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420995558] [2024-11-09 00:53:20,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:53:20,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:53:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:53:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:53:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:53:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:53:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:53:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:53:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:53:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:53:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:53:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:53:21,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:53:21,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420995558] [2024-11-09 00:53:21,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420995558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:53:21,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:53:21,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:53:21,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40918700] [2024-11-09 00:53:21,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:53:21,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:53:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:53:21,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:53:21,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:53:21,409 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:53:21,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:53:21,570 INFO L93 Difference]: Finished difference Result 100 states and 139 transitions. [2024-11-09 00:53:21,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:53:21,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2024-11-09 00:53:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:53:21,575 INFO L225 Difference]: With dead ends: 100 [2024-11-09 00:53:21,575 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 00:53:21,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:53:21,579 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 41 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:53:21,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 150 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:53:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 00:53:21,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2024-11-09 00:53:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:53:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2024-11-09 00:53:21,603 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 63 [2024-11-09 00:53:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:53:21,604 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2024-11-09 00:53:21,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:53:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2024-11-09 00:53:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 00:53:21,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:53:21,607 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:53:21,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:53:21,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:53:21,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:53:21,610 INFO L85 PathProgramCache]: Analyzing trace with hash -627591792, now seen corresponding path program 1 times [2024-11-09 00:53:21,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:53:21,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832741036] [2024-11-09 00:53:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:53:21,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:53:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:53:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:53:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:53:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:53:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:53:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:53:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:53:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:53:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:53:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:53:21,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:53:21,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832741036] [2024-11-09 00:53:21,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832741036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:53:21,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:53:21,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:53:21,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425443685] [2024-11-09 00:53:21,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:53:21,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:53:21,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:53:21,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:53:21,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:53:21,707 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:53:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:53:21,738 INFO L93 Difference]: Finished difference Result 99 states and 135 transitions. [2024-11-09 00:53:21,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:53:21,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-09 00:53:21,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:53:21,740 INFO L225 Difference]: With dead ends: 99 [2024-11-09 00:53:21,742 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 00:53:21,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-09 00:53:21,743 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:53:21,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 95 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:53:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 00:53:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2024-11-09 00:53:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:53:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2024-11-09 00:53:21,755 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 64 [2024-11-09 00:53:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:53:21,756 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2024-11-09 00:53:21,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:53:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2024-11-09 00:53:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 00:53:21,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:53:21,758 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:53:21,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:53:21,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:53:21,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:53:21,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1436938418, now seen corresponding path program 1 times [2024-11-09 00:53:21,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:53:21,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525710366] [2024-11-09 00:53:21,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:53:21,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:53:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:53:21,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:53:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:53:21,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:53:21,896 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:53:21,898 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:53:21,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:53:21,903 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 00:53:21,967 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:53:21,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:53:21 BoogieIcfgContainer [2024-11-09 00:53:21,971 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:53:21,972 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:53:21,972 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:53:21,972 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:53:21,972 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:53:20" (3/4) ... [2024-11-09 00:53:21,975 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:53:21,976 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:53:21,977 INFO L158 Benchmark]: Toolchain (without parser) took 2543.06ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 90.8MB in the beginning and 72.2MB in the end (delta: 18.6MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2024-11-09 00:53:21,977 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:53:21,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.13ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 76.6MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:53:21,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.64ms. Allocated memory is still 163.6MB. Free memory was 76.6MB in the beginning and 74.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:53:21,981 INFO L158 Benchmark]: Boogie Preprocessor took 53.82ms. Allocated memory is still 163.6MB. Free memory was 74.1MB in the beginning and 70.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:53:21,981 INFO L158 Benchmark]: RCFGBuilder took 454.19ms. Allocated memory is still 163.6MB. Free memory was 70.4MB in the beginning and 130.9MB in the end (delta: -60.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-11-09 00:53:21,984 INFO L158 Benchmark]: TraceAbstraction took 1670.88ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 130.2MB in the beginning and 73.3MB in the end (delta: 57.0MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2024-11-09 00:53:21,984 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 201.3MB. Free memory was 73.3MB in the beginning and 72.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:53:21,986 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.13ms. Allocated memory is still 163.6MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.13ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 76.6MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.64ms. Allocated memory is still 163.6MB. Free memory was 76.6MB in the beginning and 74.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.82ms. Allocated memory is still 163.6MB. Free memory was 74.1MB in the beginning and 70.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 454.19ms. Allocated memory is still 163.6MB. Free memory was 70.4MB in the beginning and 130.9MB in the end (delta: -60.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1670.88ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 130.2MB in the beginning and 73.3MB in the end (delta: 57.0MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 201.3MB. Free memory was 73.3MB in the beginning and 72.2MB in the end (delta: 1.0MB). 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 someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someUnaryDOUBLEoperation at line 24. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] unsigned char var_1_6 = 1; [L24] double var_1_7 = -0.41; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] unsigned char var_1_12 = 10; [L29] signed short int var_1_13 = -64; [L30] signed long int var_1_14 = 10; [L31] signed short int var_1_15 = -1; [L32] unsigned char last_1_var_1_8 = 25; [L33] signed long int last_1_var_1_14 = 10; VAL [isInitial=0, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L77] last_1_var_1_8 = var_1_8 [L78] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L88] RET updateLastVariables() [L89] CALL updateVariables() [L61] var_1_6 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L62] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L63] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L63] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L64] var_1_7 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L65] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L66] var_1_9 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L67] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L68] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L68] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L69] var_1_10 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L70] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L71] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L71] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L72] var_1_12 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L73] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L74] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=5, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=5, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L74] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=5, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L89] RET updateVariables() [L90] CALL step() [L37] signed long int stepLocal_0 = (((last_1_var_1_8) > ((last_1_var_1_14 + last_1_var_1_14))) ? (last_1_var_1_8) : ((last_1_var_1_14 + last_1_var_1_14))); VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, stepLocal_0=25, var_1_10=10, var_1_12=5, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L38] COND TRUE last_1_var_1_14 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=5, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=10] [L39] COND FALSE !(! var_1_6) [L42] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=5, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=25, var_1_9=10] [L45] COND TRUE \read(var_1_6) [L46] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=5, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=10, var_1_9=10] [L52] COND TRUE (9.99999999999995E13f + var_1_1) >= var_1_1 [L53] var_1_13 = (-4 + var_1_10) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=5, var_1_13=6, var_1_14=10, var_1_15=-1, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=10, var_1_9=10] [L57] var_1_15 = var_1_12 [L58] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=5, var_1_13=6, var_1_14=5, var_1_15=5, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=10, var_1_9=10] [L90] RET step() [L91] CALL, EXPR property() [L81-L82] return (((((last_1_var_1_14 <= ((((last_1_var_1_8) > ((last_1_var_1_14 + last_1_var_1_14))) ? (last_1_var_1_8) : ((last_1_var_1_14 + last_1_var_1_14))))) ? ((! var_1_6) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((var_1_1 < (var_1_1 + var_1_7)) ? (var_1_8 == ((unsigned char) var_1_12)) : 1))) && (((9.99999999999995E13f + var_1_1) >= var_1_1) ? (var_1_13 == ((signed short int) (-4 + var_1_10))) : (var_1_13 == ((signed short int) (((((var_1_9) < (8)) ? (var_1_9) : (8))) - 32))))) && (var_1_14 == ((signed long int) var_1_15))) && (var_1_15 == ((signed short int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=5, var_1_13=6, var_1_14=5, var_1_15=5, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=10, var_1_9=10] [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=5, var_1_13=6, var_1_14=5, var_1_15=5, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=10, var_1_9=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=10, var_1_12=5, var_1_13=6, var_1_14=5, var_1_15=5, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=10, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 293 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 149 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 249 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 432/432 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-09 00:53:22,020 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-73.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 2d76b174fceab1b4f0b7c723c11189a89dfae9fb8b439d670404c7bcb817a6a0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:53:24,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:53:24,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:53:24,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:53:24,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:53:24,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:53:24,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:53:24,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:53:24,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:53:24,348 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:53:24,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:53:24,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:53:24,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:53:24,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:53:24,351 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:53:24,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:53:24,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:53:24,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:53:24,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:53:24,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:53:24,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:53:24,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:53:24,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:53:24,357 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:53:24,358 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:53:24,358 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:53:24,358 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:53:24,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:53:24,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:53:24,359 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:53:24,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:53:24,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:53:24,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:53:24,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:53:24,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:53:24,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:53:24,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:53:24,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:53:24,362 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:53:24,363 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:53:24,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:53:24,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:53:24,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:53:24,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:53:24,364 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 -> 2d76b174fceab1b4f0b7c723c11189a89dfae9fb8b439d670404c7bcb817a6a0 [2024-11-09 00:53:24,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:53:24,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:53:24,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:53:24,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:53:24,722 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:53:24,723 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-73.i [2024-11-09 00:53:26,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:53:26,572 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:53:26,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-73.i [2024-11-09 00:53:26,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c8993b5/d0c36b22ba29401ea7383576e23f3a1a/FLAGe0bd78871 [2024-11-09 00:53:26,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c8993b5/d0c36b22ba29401ea7383576e23f3a1a [2024-11-09 00:53:26,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:53:26,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:53:26,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:53:26,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:53:26,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:53:26,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:53:26" (1/1) ... [2024-11-09 00:53:26,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4144a496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:26, skipping insertion in model container [2024-11-09 00:53:26,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:53:26" (1/1) ... [2024-11-09 00:53:26,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:53:27,155 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-73.i[915,928] [2024-11-09 00:53:27,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:53:27,229 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:53:27,241 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-73.i[915,928] [2024-11-09 00:53:27,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:53:27,286 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:53:27,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27 WrapperNode [2024-11-09 00:53:27,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:53:27,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:53:27,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:53:27,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:53:27,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27" (1/1) ... [2024-11-09 00:53:27,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27" (1/1) ... [2024-11-09 00:53:27,339 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-11-09 00:53:27,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:53:27,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:53:27,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:53:27,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:53:27,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27" (1/1) ... [2024-11-09 00:53:27,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27" (1/1) ... [2024-11-09 00:53:27,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27" (1/1) ... [2024-11-09 00:53:27,375 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-09 00:53:27,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27" (1/1) ... [2024-11-09 00:53:27,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27" (1/1) ... [2024-11-09 00:53:27,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27" (1/1) ... [2024-11-09 00:53:27,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27" (1/1) ... [2024-11-09 00:53:27,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27" (1/1) ... [2024-11-09 00:53:27,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27" (1/1) ... [2024-11-09 00:53:27,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:53:27,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:53:27,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:53:27,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:53:27,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27" (1/1) ... [2024-11-09 00:53:27,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:53:27,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:53:27,449 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-09 00:53:27,456 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-09 00:53:27,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:53:27,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:53:27,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:53:27,514 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:53:27,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:53:27,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:53:27,604 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:53:27,607 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:53:28,633 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:53:28,634 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:53:28,646 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:53:28,647 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:53:28,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:53:28 BoogieIcfgContainer [2024-11-09 00:53:28,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:53:28,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:53:28,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:53:28,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:53:28,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:53:26" (1/3) ... [2024-11-09 00:53:28,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcc7ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:53:28, skipping insertion in model container [2024-11-09 00:53:28,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:27" (2/3) ... [2024-11-09 00:53:28,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcc7ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:53:28, skipping insertion in model container [2024-11-09 00:53:28,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:53:28" (3/3) ... [2024-11-09 00:53:28,660 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-73.i [2024-11-09 00:53:28,678 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:53:28,678 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:53:28,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:53:28,743 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;@650ba0b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:53:28,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:53:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:53:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 00:53:28,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:53:28,760 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:53:28,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:53:28,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:53:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash 715450892, now seen corresponding path program 1 times [2024-11-09 00:53:28,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:53:28,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677039086] [2024-11-09 00:53:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:53:28,790 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-09 00:53:28,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:53:28,793 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-09 00:53:28,794 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-09 00:53:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:29,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:53:29,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:53:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 00:53:29,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:53:29,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:53:29,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677039086] [2024-11-09 00:53:29,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677039086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:53:29,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:53:29,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:53:29,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307749436] [2024-11-09 00:53:29,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:53:29,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:53:29,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:53:29,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:53:29,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:53:29,145 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 00:53:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:53:29,175 INFO L93 Difference]: Finished difference Result 71 states and 113 transitions. [2024-11-09 00:53:29,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:53:29,177 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2024-11-09 00:53:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:53:29,185 INFO L225 Difference]: With dead ends: 71 [2024-11-09 00:53:29,185 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 00:53:29,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-09 00:53:29,193 INFO L432 NwaCegarLoop]: 48 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, 48 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-09 00:53:29,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:53:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 00:53:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 00:53:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:53:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2024-11-09 00:53:29,241 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 63 [2024-11-09 00:53:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:53:29,242 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2024-11-09 00:53:29,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 00:53:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2024-11-09 00:53:29,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 00:53:29,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:53:29,246 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:53:29,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:53:29,447 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-09 00:53:29,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:53:29,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:53:29,448 INFO L85 PathProgramCache]: Analyzing trace with hash 476516110, now seen corresponding path program 1 times [2024-11-09 00:53:29,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:53:29,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406200615] [2024-11-09 00:53:29,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:53:29,450 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-09 00:53:29,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:53:29,453 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-09 00:53:29,458 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-09 00:53:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:29,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:53:29,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:53:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:53:30,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:53:30,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:53:30,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406200615] [2024-11-09 00:53:30,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406200615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:53:30,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:53:30,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:53:30,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181605217] [2024-11-09 00:53:30,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:53:30,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:53:30,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:53:30,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:53:30,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:53:30,435 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:53:31,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:53:31,873 INFO L93 Difference]: Finished difference Result 102 states and 142 transitions. [2024-11-09 00:53:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:53:31,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2024-11-09 00:53:31,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:53:31,888 INFO L225 Difference]: With dead ends: 102 [2024-11-09 00:53:31,888 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 00:53:31,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:53:31,890 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 36 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:53:31,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 00:53:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 00:53:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2024-11-09 00:53:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:53:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2024-11-09 00:53:31,915 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 63 [2024-11-09 00:53:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:53:31,916 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2024-11-09 00:53:31,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:53:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2024-11-09 00:53:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 00:53:31,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:53:31,918 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:53:31,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:53:32,118 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-09 00:53:32,119 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:53:32,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:53:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash -627591792, now seen corresponding path program 1 times [2024-11-09 00:53:32,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:53:32,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725200202] [2024-11-09 00:53:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:53:32,121 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-09 00:53:32,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:53:32,125 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-09 00:53:32,126 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-09 00:53:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:32,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 00:53:32,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:53:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:53:32,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:53:32,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:53:32,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725200202] [2024-11-09 00:53:32,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725200202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:53:32,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:53:32,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:53:32,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890369157] [2024-11-09 00:53:32,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:53:32,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:53:32,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:53:32,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:53:32,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:53:32,360 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:53:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:53:32,839 INFO L93 Difference]: Finished difference Result 99 states and 135 transitions. [2024-11-09 00:53:32,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:53:32,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-09 00:53:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:53:32,842 INFO L225 Difference]: With dead ends: 99 [2024-11-09 00:53:32,844 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 00:53:32,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-09 00:53:32,846 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 00:53:32,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 94 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 00:53:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 00:53:32,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2024-11-09 00:53:32,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:53:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2024-11-09 00:53:32,863 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 64 [2024-11-09 00:53:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:53:32,864 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2024-11-09 00:53:32,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:53:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2024-11-09 00:53:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 00:53:32,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:53:32,869 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:53:32,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 00:53:33,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:53:33,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:53:33,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:53:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1436938418, now seen corresponding path program 1 times [2024-11-09 00:53:33,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:53:33,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716199059] [2024-11-09 00:53:33,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:53:33,071 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-09 00:53:33,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:53:33,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:53:33,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 00:53:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:33,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 00:53:33,264 INFO L278 TraceCheckSpWp]: Computing forward predicates...