./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.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 2a8173a95b98f2f1ade3ddbfa72a82a390b4308045cd4f85b878a79ad12c3bb8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:16:37,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:16:37,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:16:37,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:16:37,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:16:37,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:16:37,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:16:37,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:16:37,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:16:37,630 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:16:37,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:16:37,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:16:37,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:16:37,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:16:37,632 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:16:37,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:16:37,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:16:37,634 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:16:37,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:16:37,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:16:37,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:16:37,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:16:37,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:16:37,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:16:37,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:16:37,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:16:37,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:16:37,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:16:37,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:16:37,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:16:37,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:16:37,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:16:37,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:16:37,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:16:37,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:16:37,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:16:37,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:16:37,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:16:37,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:16:37,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:16:37,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:16:37,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:16:37,648 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 -> 2a8173a95b98f2f1ade3ddbfa72a82a390b4308045cd4f85b878a79ad12c3bb8 [2024-11-10 08:16:37,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:16:37,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:16:37,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:16:37,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:16:37,948 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:16:37,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i [2024-11-10 08:16:39,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:16:39,632 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:16:39,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i [2024-11-10 08:16:39,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/310acc9f0/1e2d7a4e1c134568b28edb3f3b3a0b67/FLAG1f1c6cb55 [2024-11-10 08:16:40,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/310acc9f0/1e2d7a4e1c134568b28edb3f3b3a0b67 [2024-11-10 08:16:40,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:16:40,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:16:40,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:16:40,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:16:40,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:16:40,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1782f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40, skipping insertion in model container [2024-11-10 08:16:40,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:16:40,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i[915,928] [2024-11-10 08:16:40,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:16:40,286 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:16:40,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i[915,928] [2024-11-10 08:16:40,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:16:40,330 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:16:40,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40 WrapperNode [2024-11-10 08:16:40,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:16:40,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:16:40,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:16:40,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:16:40,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,372 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-11-10 08:16:40,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:16:40,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:16:40,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:16:40,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:16:40,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,397 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:16:40,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,403 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:16:40,409 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:16:40,409 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:16:40,409 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:16:40,410 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:16:40,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:16:40,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:16:40,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:16:40,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:16:40,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:16:40,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:16:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:16:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:16:40,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:16:40,580 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:16:40,586 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:16:40,797 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:16:40,798 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:16:40,813 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:16:40,813 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:16:40,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:40 BoogieIcfgContainer [2024-11-10 08:16:40,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:16:40,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:16:40,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:16:40,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:16:40,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:16:40" (1/3) ... [2024-11-10 08:16:40,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0722eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:16:40, skipping insertion in model container [2024-11-10 08:16:40,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (2/3) ... [2024-11-10 08:16:40,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0722eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:16:40, skipping insertion in model container [2024-11-10 08:16:40,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:40" (3/3) ... [2024-11-10 08:16:40,826 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-28.i [2024-11-10 08:16:40,839 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:16:40,840 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:16:40,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:16:40,902 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;@584cf0ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:16:40,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:16:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:16:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 08:16:40,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:40,921 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:16:40,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:40,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:40,927 INFO L85 PathProgramCache]: Analyzing trace with hash 673308029, now seen corresponding path program 1 times [2024-11-10 08:16:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:40,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828943887] [2024-11-10 08:16:40,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:40,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:16:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:16:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 08:16:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:16:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 08:16:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:16:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:16:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:16:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:16:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:16:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 08:16:41,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:41,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828943887] [2024-11-10 08:16:41,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828943887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:41,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:41,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:16:41,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532446005] [2024-11-10 08:16:41,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:41,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:16:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:41,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:16:41,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:16:41,228 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 08:16:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:41,251 INFO L93 Difference]: Finished difference Result 76 states and 116 transitions. [2024-11-10 08:16:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:16:41,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2024-11-10 08:16:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:41,261 INFO L225 Difference]: With dead ends: 76 [2024-11-10 08:16:41,261 INFO L226 Difference]: Without dead ends: 37 [2024-11-10 08:16:41,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:16:41,267 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-10 08:16:41,267 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-10 08:16:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-10 08:16:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-10 08:16:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:16:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-11-10 08:16:41,315 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 75 [2024-11-10 08:16:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:41,315 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-10 08:16:41,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 08:16:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-11-10 08:16:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 08:16:41,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:41,327 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:16:41,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:16:41,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:41,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:41,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1080359168, now seen corresponding path program 1 times [2024-11-10 08:16:41,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:41,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738403945] [2024-11-10 08:16:41,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:41,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:16:41,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:16:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:16:41,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:16:41,635 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:16:41,636 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:16:41,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:16:41,641 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 08:16:41,713 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:16:41,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:16:41 BoogieIcfgContainer [2024-11-10 08:16:41,717 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:16:41,718 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:16:41,718 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:16:41,719 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:16:41,719 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:40" (3/4) ... [2024-11-10 08:16:41,722 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:16:41,723 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:16:41,724 INFO L158 Benchmark]: Toolchain (without parser) took 1697.73ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 85.0MB in the beginning and 168.9MB in the end (delta: -83.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:16:41,724 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:16:41,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.00ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 71.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:16:41,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.30ms. Allocated memory is still 159.4MB. Free memory was 71.5MB in the beginning and 69.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:16:41,726 INFO L158 Benchmark]: Boogie Preprocessor took 34.38ms. Allocated memory is still 159.4MB. Free memory was 69.5MB in the beginning and 67.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:16:41,727 INFO L158 Benchmark]: IcfgBuilder took 405.98ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 67.6MB in the beginning and 189.3MB in the end (delta: -121.6MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-11-10 08:16:41,727 INFO L158 Benchmark]: TraceAbstraction took 900.43ms. Allocated memory is still 220.2MB. Free memory was 188.2MB in the beginning and 170.0MB in the end (delta: 18.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-10 08:16:41,731 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 220.2MB. Free memory was 170.0MB in the beginning and 168.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:16:41,733 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.18ms. Allocated memory is still 159.4MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.00ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 71.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.30ms. Allocated memory is still 159.4MB. Free memory was 71.5MB in the beginning and 69.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.38ms. Allocated memory is still 159.4MB. Free memory was 69.5MB in the beginning and 67.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 405.98ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 67.6MB in the beginning and 189.3MB in the end (delta: -121.6MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 900.43ms. Allocated memory is still 220.2MB. Free memory was 188.2MB in the beginning and 170.0MB in the end (delta: 18.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 220.2MB. Free memory was 170.0MB in the beginning and 168.9MB 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 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] double var_1_2 = 10.6; [L24] double var_1_3 = 1.8; [L25] double var_1_4 = 31.8; [L26] double var_1_5 = 24.25; [L27] signed char var_1_6 = 1; [L28] signed char var_1_7 = -25; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 8; VAL [isInitial=0, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_2=53/5, var_1_3=9/5, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L72] isInitial = 1 [L73] FCALL initially() [L74] COND TRUE 1 [L75] FCALL updateLastVariables() [L76] CALL updateVariables() [L46] var_1_2 = __VERIFIER_nondet_double() [L47] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_3=9/5, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_3=9/5, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L47] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_3=9/5, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L48] var_1_3 = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L49] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L50] var_1_4 = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L51] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L52] var_1_5 = __VERIFIER_nondet_double() [L53] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L53] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L54] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L54] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L55] var_1_6 = __VERIFIER_nondet_char() [L56] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-25, var_1_8=1, var_1_9=0] [L56] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-25, var_1_8=1, var_1_9=0] [L57] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-25, var_1_8=1, var_1_9=0] [L57] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-25, var_1_8=1, var_1_9=0] [L58] var_1_7 = __VERIFIER_nondet_char() [L59] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-126, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-126, var_1_8=1, var_1_9=0] [L59] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-126, var_1_8=1, var_1_9=0] [L60] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-126, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-126, var_1_8=1, var_1_9=0] [L60] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-126, var_1_8=1, var_1_9=0] [L61] var_1_9 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-126, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-126, var_1_8=1] [L62] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-126, var_1_8=1] [L63] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-126, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-126, var_1_8=1, var_1_9=-256] [L63] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=-127, var_1_7=-126, var_1_8=1, var_1_9=-256] [L76] RET updateVariables() [L77] CALL step() [L36] COND FALSE !(var_1_2 > ((var_1_3 * var_1_4) / var_1_5)) [L39] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-126, var_1_6=-127, var_1_7=-126, var_1_8=1, var_1_9=-256] [L41] var_1_8 = var_1_9 [L42] var_1_10 = var_1_9 [L43] var_1_11 = 10 VAL [isInitial=1, var_1_10=-256, var_1_11=10, var_1_1=-126, var_1_6=-127, var_1_7=-126, var_1_8=-256, var_1_9=-256] [L77] RET step() [L78] CALL, EXPR property() [L68-L69] return ((((var_1_2 > ((var_1_3 * var_1_4) / var_1_5)) ? (var_1_1 == ((signed char) ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_7))) && (var_1_8 == ((unsigned char) var_1_9))) && (var_1_10 == ((unsigned char) var_1_9))) && (var_1_11 == ((unsigned char) 10)) ; VAL [\result=0, isInitial=1, var_1_10=-256, var_1_11=10, var_1_1=-126, var_1_6=-127, var_1_7=-126, var_1_8=-256, var_1_9=-256] [L78] RET, EXPR property() [L78] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-256, var_1_11=10, var_1_1=-126, var_1_6=-127, var_1_7=-126, var_1_8=-256, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, var_1_10=-256, var_1_11=10, var_1_1=-126, var_1_6=-127, var_1_7=-126, var_1_8=-256, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 48 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 74 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 08:16:41,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.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 2a8173a95b98f2f1ade3ddbfa72a82a390b4308045cd4f85b878a79ad12c3bb8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:16:43,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:16:44,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:16:44,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:16:44,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:16:44,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:16:44,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:16:44,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:16:44,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:16:44,120 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:16:44,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:16:44,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:16:44,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:16:44,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:16:44,122 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:16:44,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:16:44,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:16:44,123 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:16:44,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:16:44,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:16:44,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:16:44,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:16:44,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:16:44,127 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:16:44,127 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:16:44,128 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:16:44,128 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:16:44,128 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:16:44,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:16:44,129 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:16:44,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:16:44,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:16:44,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:16:44,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:16:44,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:16:44,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:16:44,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:16:44,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:16:44,132 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:16:44,133 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:16:44,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:16:44,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:16:44,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:16:44,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:16:44,135 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 -> 2a8173a95b98f2f1ade3ddbfa72a82a390b4308045cd4f85b878a79ad12c3bb8 [2024-11-10 08:16:44,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:16:44,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:16:44,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:16:44,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:16:44,504 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:16:44,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i [2024-11-10 08:16:46,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:16:46,309 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:16:46,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i [2024-11-10 08:16:46,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617abd1c9/5542b0ad34b844f881a12380dc16fd6a/FLAGc64b08480 [2024-11-10 08:16:46,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617abd1c9/5542b0ad34b844f881a12380dc16fd6a [2024-11-10 08:16:46,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:16:46,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:16:46,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:16:46,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:16:46,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:16:46,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:16:46" (1/1) ... [2024-11-10 08:16:46,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29dd6a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:46, skipping insertion in model container [2024-11-10 08:16:46,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:16:46" (1/1) ... [2024-11-10 08:16:46,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:16:46,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i[915,928] [2024-11-10 08:16:46,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:16:46,953 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:16:46,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i[915,928] [2024-11-10 08:16:46,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:16:47,013 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:16:47,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47 WrapperNode [2024-11-10 08:16:47,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:16:47,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:16:47,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:16:47,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:16:47,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47" (1/1) ... [2024-11-10 08:16:47,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47" (1/1) ... [2024-11-10 08:16:47,068 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2024-11-10 08:16:47,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:16:47,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:16:47,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:16:47,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:16:47,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47" (1/1) ... [2024-11-10 08:16:47,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47" (1/1) ... [2024-11-10 08:16:47,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47" (1/1) ... [2024-11-10 08:16:47,109 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:16:47,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47" (1/1) ... [2024-11-10 08:16:47,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47" (1/1) ... [2024-11-10 08:16:47,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47" (1/1) ... [2024-11-10 08:16:47,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47" (1/1) ... [2024-11-10 08:16:47,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47" (1/1) ... [2024-11-10 08:16:47,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47" (1/1) ... [2024-11-10 08:16:47,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:16:47,136 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:16:47,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:16:47,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:16:47,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47" (1/1) ... [2024-11-10 08:16:47,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:16:47,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:16:47,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:16:47,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:16:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:16:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:16:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:16:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:16:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:16:47,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:16:47,312 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:16:47,315 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:17:00,503 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:17:00,503 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:17:00,518 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:17:00,519 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:17:00,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:00 BoogieIcfgContainer [2024-11-10 08:17:00,520 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:17:00,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:17:00,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:17:00,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:17:00,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:16:46" (1/3) ... [2024-11-10 08:17:00,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0f19d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:00, skipping insertion in model container [2024-11-10 08:17:00,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:47" (2/3) ... [2024-11-10 08:17:00,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0f19d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:00, skipping insertion in model container [2024-11-10 08:17:00,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:00" (3/3) ... [2024-11-10 08:17:00,531 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-28.i [2024-11-10 08:17:00,544 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:17:00,544 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:17:00,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:17:00,622 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;@294ced4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:17:00,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:17:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:17:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 08:17:00,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:00,636 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:17:00,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:00,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:00,642 INFO L85 PathProgramCache]: Analyzing trace with hash 673308029, now seen corresponding path program 1 times [2024-11-10 08:17:00,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:17:00,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269464524] [2024-11-10 08:17:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:00,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:17:00,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:17:00,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:17:00,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 08:17:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:01,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:17:01,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:17:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-10 08:17:01,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:17:01,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:17:01,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269464524] [2024-11-10 08:17:01,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269464524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:01,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:01,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:17:01,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090159852] [2024-11-10 08:17:01,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:01,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:17:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:17:01,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:17:01,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:17:01,572 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 08:17:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:01,598 INFO L93 Difference]: Finished difference Result 76 states and 116 transitions. [2024-11-10 08:17:01,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:17:01,601 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), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 75 [2024-11-10 08:17:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:01,608 INFO L225 Difference]: With dead ends: 76 [2024-11-10 08:17:01,608 INFO L226 Difference]: Without dead ends: 37 [2024-11-10 08:17:01,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:17:01,618 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-10 08:17:01,620 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-10 08:17:01,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-10 08:17:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-10 08:17:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:17:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-11-10 08:17:01,676 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 75 [2024-11-10 08:17:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:01,677 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-10 08:17:01,678 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), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 08:17:01,678 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-11-10 08:17:01,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 08:17:01,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:01,683 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:17:01,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 08:17:01,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:17:01,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:01,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:01,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1080359168, now seen corresponding path program 1 times [2024-11-10 08:17:01,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:17:01,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323250527] [2024-11-10 08:17:01,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:01,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:17:01,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:17:01,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:17:01,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 08:17:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:02,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 08:17:02,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:17:11,335 WARN L286 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 08:17:19,663 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 08:17:23,843 WARN L851 $PredicateComparison]: unable to prove that (and (not (fp.gt c_~var_1_2~0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0))) (= c_~var_1_7~0 c_~var_1_1~0)) is different from false [2024-11-10 08:17:27,999 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.gt c_~var_1_2~0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0))) (= c_~var_1_7~0 c_~var_1_1~0)) is different from true [2024-11-10 08:17:36,612 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 08:17:45,214 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 08:17:53,852 WARN L286 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 08:18:02,241 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 08:18:10,925 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 08:18:15,103 WARN L851 $PredicateComparison]: unable to prove that (and (not (fp.gt c_~var_1_2~0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0))) (= c_~var_1_7~0 c_~var_1_1~0) (= (_ bv10 8) c_~var_1_11~0) (= c_~var_1_8~0 c_~var_1_9~0) (= c_~var_1_10~0 c_~var_1_9~0)) is different from false [2024-11-10 08:18:19,275 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.gt c_~var_1_2~0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0))) (= c_~var_1_7~0 c_~var_1_1~0) (= (_ bv10 8) c_~var_1_11~0) (= c_~var_1_8~0 c_~var_1_9~0) (= c_~var_1_10~0 c_~var_1_9~0)) is different from true