./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.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 92146e8486cd1fa4cd649b10702b8ab5c79eabd98f42ded8c5df34143d7c4a50 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:55:21,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:55:21,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:55:21,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:55:21,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:55:21,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:55:21,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:55:21,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:55:21,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:55:21,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:55:21,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:55:21,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:55:21,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:55:21,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:55:21,485 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:55:21,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:55:21,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:55:21,487 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:55:21,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:55:21,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:55:21,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:55:21,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:55:21,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:55:21,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:55:21,489 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:55:21,489 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:55:21,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:55:21,489 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:55:21,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:55:21,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:55:21,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:55:21,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:55:21,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:55:21,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:55:21,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:55:21,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:55:21,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:55:21,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:55:21,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:55:21,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:55:21,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:55:21,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:55:21,495 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 -> 92146e8486cd1fa4cd649b10702b8ab5c79eabd98f42ded8c5df34143d7c4a50 [2024-10-24 08:55:21,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:55:21,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:55:21,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:55:21,737 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:55:21,737 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:55:21,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i [2024-10-24 08:55:23,060 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:55:23,222 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:55:23,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i [2024-10-24 08:55:23,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c865cc02/4c610ce2d7524d4590bdea410973dcf4/FLAGb809dda1f [2024-10-24 08:55:23,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c865cc02/4c610ce2d7524d4590bdea410973dcf4 [2024-10-24 08:55:23,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:55:23,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:55:23,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:55:23,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:55:23,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:55:23,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44621121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23, skipping insertion in model container [2024-10-24 08:55:23,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:55:23,401 WARN L248 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_floatingpointinfluence_no-floats_file-46.i[916,929] [2024-10-24 08:55:23,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:55:23,465 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:55:23,479 WARN L248 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_floatingpointinfluence_no-floats_file-46.i[916,929] [2024-10-24 08:55:23,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:55:23,534 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:55:23,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23 WrapperNode [2024-10-24 08:55:23,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:55:23,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:55:23,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:55:23,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:55:23,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,574 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-10-24 08:55:23,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:55:23,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:55:23,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:55:23,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:55:23,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,618 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-10-24 08:55:23,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,622 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:55:23,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:55:23,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:55:23,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:55:23,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:55:23,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:55:23,666 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-10-24 08:55:23,675 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-10-24 08:55:23,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:55:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:55:23,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:55:23,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:55:23,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:55:23,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:55:23,772 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:55:23,774 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:55:24,029 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 08:55:24,030 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:55:24,058 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:55:24,058 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:55:24,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:55:24 BoogieIcfgContainer [2024-10-24 08:55:24,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:55:24,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:55:24,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:55:24,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:55:24,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:55:23" (1/3) ... [2024-10-24 08:55:24,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f1514f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:55:24, skipping insertion in model container [2024-10-24 08:55:24,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23" (2/3) ... [2024-10-24 08:55:24,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f1514f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:55:24, skipping insertion in model container [2024-10-24 08:55:24,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:55:24" (3/3) ... [2024-10-24 08:55:24,067 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-46.i [2024-10-24 08:55:24,080 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:55:24,080 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:55:24,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:55:24,141 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;@20774234, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:55:24,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:55:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:55:24,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 08:55:24,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:24,154 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:55:24,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:24,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:24,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1844215411, now seen corresponding path program 1 times [2024-10-24 08:55:24,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:55:24,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786689312] [2024-10-24 08:55:24,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:55:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:55:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:55:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:55:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:55:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:55:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:55:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:55:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:55:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:55:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:55:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:55:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:55:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:55:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:55:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:55:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:55:24,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:55:24,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786689312] [2024-10-24 08:55:24,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786689312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:55:24,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:55:24,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:55:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501134898] [2024-10-24 08:55:24,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:55:24,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:55:24,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:55:24,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:55:24,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:55:24,499 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:55:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:55:24,524 INFO L93 Difference]: Finished difference Result 101 states and 175 transitions. [2024-10-24 08:55:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:55:24,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2024-10-24 08:55:24,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:55:24,534 INFO L225 Difference]: With dead ends: 101 [2024-10-24 08:55:24,535 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 08:55:24,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-10-24 08:55:24,572 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:55:24,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:55:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 08:55:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-24 08:55:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:55:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-10-24 08:55:24,638 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 96 [2024-10-24 08:55:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:55:24,638 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-10-24 08:55:24,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:55:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-10-24 08:55:24,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 08:55:24,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:24,645 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:55:24,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:55:24,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:24,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:24,646 INFO L85 PathProgramCache]: Analyzing trace with hash 470893493, now seen corresponding path program 1 times [2024-10-24 08:55:24,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:55:24,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563280051] [2024-10-24 08:55:24,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:24,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:55:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:55:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:55:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:55:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:55:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:55:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:55:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:55:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:55:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:55:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:55:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:55:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:55:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:55:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:55:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:55:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:55:24,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:55:24,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563280051] [2024-10-24 08:55:24,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563280051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:55:24,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:55:24,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:55:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077951038] [2024-10-24 08:55:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:55:24,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:55:24,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:55:24,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:55:24,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:55:24,958 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:55:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:55:25,045 INFO L93 Difference]: Finished difference Result 113 states and 162 transitions. [2024-10-24 08:55:25,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:55:25,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2024-10-24 08:55:25,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:55:25,047 INFO L225 Difference]: With dead ends: 113 [2024-10-24 08:55:25,048 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 08:55:25,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:55:25,050 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 20 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:55:25,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 231 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:55:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 08:55:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-10-24 08:55:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 08:55:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2024-10-24 08:55:25,069 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 96 [2024-10-24 08:55:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:55:25,070 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2024-10-24 08:55:25,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:55:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2024-10-24 08:55:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 08:55:25,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:25,072 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:55:25,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:55:25,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:25,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:25,073 INFO L85 PathProgramCache]: Analyzing trace with hash 528151795, now seen corresponding path program 1 times [2024-10-24 08:55:25,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:55:25,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376933375] [2024-10-24 08:55:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:25,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:55:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:55:25,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848130728] [2024-10-24 08:55:25,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:25,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:55:25,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:55:25,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:55:25,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 08:55:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:55:25,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:55:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:55:25,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:55:25,339 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:55:25,340 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:55:25,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 08:55:25,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:55:25,552 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 08:55:25,645 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:55:25,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:55:25 BoogieIcfgContainer [2024-10-24 08:55:25,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:55:25,649 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:55:25,649 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:55:25,649 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:55:25,649 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:55:24" (3/4) ... [2024-10-24 08:55:25,651 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:55:25,652 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:55:25,653 INFO L158 Benchmark]: Toolchain (without parser) took 2408.62ms. Allocated memory is still 205.5MB. Free memory was 133.8MB in the beginning and 89.6MB in the end (delta: 44.1MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2024-10-24 08:55:25,653 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:55:25,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.63ms. Allocated memory is still 205.5MB. Free memory was 133.2MB in the beginning and 118.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 08:55:25,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.62ms. Allocated memory is still 205.5MB. Free memory was 118.5MB in the beginning and 115.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:55:25,654 INFO L158 Benchmark]: Boogie Preprocessor took 59.96ms. Allocated memory is still 205.5MB. Free memory was 115.7MB in the beginning and 113.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:55:25,654 INFO L158 Benchmark]: RCFGBuilder took 422.18ms. Allocated memory is still 205.5MB. Free memory was 113.4MB in the beginning and 92.7MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 08:55:25,659 INFO L158 Benchmark]: TraceAbstraction took 1587.77ms. Allocated memory is still 205.5MB. Free memory was 91.8MB in the beginning and 89.6MB in the end (delta: 2.2MB). Peak memory consumption was 703.1kB. Max. memory is 16.1GB. [2024-10-24 08:55:25,659 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 205.5MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:55:25,660 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 144.7MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.63ms. Allocated memory is still 205.5MB. Free memory was 133.2MB in the beginning and 118.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.62ms. Allocated memory is still 205.5MB. Free memory was 118.5MB in the beginning and 115.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.96ms. Allocated memory is still 205.5MB. Free memory was 115.7MB in the beginning and 113.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 422.18ms. Allocated memory is still 205.5MB. Free memory was 113.4MB in the beginning and 92.7MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1587.77ms. Allocated memory is still 205.5MB. Free memory was 91.8MB in the beginning and 89.6MB in the end (delta: 2.2MB). Peak memory consumption was 703.1kB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 205.5MB. Free memory is still 89.6MB. 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 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed long int var_1_2 = 31; [L24] signed char var_1_4 = -8; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 1; [L28] unsigned char var_1_9 = 1; [L29] signed short int var_1_10 = -4; [L30] signed short int var_1_12 = 32; [L31] signed char var_1_13 = -25; [L32] signed char var_1_16 = 4; [L33] unsigned char last_1_var_1_1 = 1; [L34] signed short int last_1_var_1_10 = -4; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_1 = var_1_1 [L98] last_1_var_1_10 = var_1_10 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L73] var_1_2 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L74] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L75] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L76] var_1_4 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_4 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L77] RET assume_abort_if_not(var_1_4 >= -128) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L78] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L80] var_1_6 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_7=0, var_1_8=1, var_1_9=1] [L81] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_7=0, var_1_8=1, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L83] var_1_7 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_8=1, var_1_9=1] [L84] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_8=1, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L85] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L86] var_1_9 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L87] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L88] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L88] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L89] var_1_12 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L90] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L91] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L91] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L92] var_1_16 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L93] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L94] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L94] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L109] RET updateVariables() [L110] CALL step() [L38] COND FALSE !(last_1_var_1_10 <= (var_1_12 / var_1_4)) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L43] signed long int stepLocal_1 = (((var_1_4) < (var_1_13)) ? (var_1_4) : (var_1_13)); [L44] signed long int stepLocal_0 = var_1_13 / var_1_4; VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=5, stepLocal_1=-25, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L45] COND FALSE !((- var_1_2) >= 16.75) [L60] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=5, stepLocal_1=-25, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L62] signed char stepLocal_2 = var_1_13; VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=5, stepLocal_1=-25, stepLocal_2=-25, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L63] EXPR var_1_13 | var_1_13 VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=5, stepLocal_1=-25, stepLocal_2=-25, var_1_10=-4, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L63] COND TRUE ((var_1_13 | var_1_13) + var_1_4) < stepLocal_2 [L64] var_1_10 = (var_1_12 - 256) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=5, stepLocal_1=-25, var_1_10=5, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L68] COND FALSE !(1 == var_1_4) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=5, stepLocal_1=-25, var_1_10=5, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR ((((- var_1_2) >= 16.75) ? (((var_1_13 / var_1_4) >= var_1_13) ? ((((((var_1_4) < (var_1_13)) ? (var_1_4) : (var_1_13))) > -32) ? (var_1_1 == ((unsigned char) 0)) : (var_1_1 == ((unsigned char) (var_1_6 || var_1_7)))) : (var_1_6 ? (var_1_1 == ((unsigned char) 1)) : (var_1_1 == ((unsigned char) var_1_7)))) : (var_1_1 == ((unsigned char) 1))) && ((1 == var_1_4) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && ((((var_1_13 | var_1_13) + var_1_4) < var_1_13) ? (var_1_10 == ((signed short int) (var_1_12 - 256))) : (var_1_10 == ((signed short int) 128))) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=5, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L101-L102] return (((((- var_1_2) >= 16.75) ? (((var_1_13 / var_1_4) >= var_1_13) ? ((((((var_1_4) < (var_1_13)) ? (var_1_4) : (var_1_13))) > -32) ? (var_1_1 == ((unsigned char) 0)) : (var_1_1 == ((unsigned char) (var_1_6 || var_1_7)))) : (var_1_6 ? (var_1_1 == ((unsigned char) 1)) : (var_1_1 == ((unsigned char) var_1_7)))) : (var_1_1 == ((unsigned char) 1))) && ((1 == var_1_4) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && ((((var_1_13 | var_1_13) + var_1_4) < var_1_13) ? (var_1_10 == ((signed short int) (var_1_12 - 256))) : (var_1_10 == ((signed short int) 128)))) && ((last_1_var_1_10 <= (var_1_12 / var_1_4)) ? (last_1_var_1_1 ? (var_1_13 == ((signed char) var_1_16)) : 1) : 1) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=5, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=5, var_1_12=261, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 299 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 130 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=2, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 840/840 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-10-24 08:55:25,686 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.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 92146e8486cd1fa4cd649b10702b8ab5c79eabd98f42ded8c5df34143d7c4a50 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:55:27,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:55:27,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:55:27,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:55:27,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:55:27,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:55:27,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:55:27,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:55:27,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:55:27,886 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:55:27,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:55:27,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:55:27,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:55:27,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:55:27,887 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:55:27,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:55:27,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:55:27,891 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:55:27,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:55:27,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:55:27,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:55:27,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:55:27,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:55:27,893 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:55:27,893 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:55:27,893 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:55:27,893 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:55:27,894 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:55:27,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:55:27,894 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:55:27,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:55:27,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:55:27,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:55:27,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:55:27,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:55:27,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:55:27,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:55:27,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:55:27,896 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:55:27,896 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:55:27,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:55:27,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:55:27,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:55:27,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:55:27,898 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:55:27,898 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 -> 92146e8486cd1fa4cd649b10702b8ab5c79eabd98f42ded8c5df34143d7c4a50 [2024-10-24 08:55:28,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:55:28,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:55:28,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:55:28,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:55:28,197 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:55:28,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i [2024-10-24 08:55:29,550 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:55:29,745 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:55:29,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i [2024-10-24 08:55:29,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78ff3c042/895b1533e6404c51b4d51a270d0ca8a3/FLAG1c0dccb9f [2024-10-24 08:55:30,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78ff3c042/895b1533e6404c51b4d51a270d0ca8a3 [2024-10-24 08:55:30,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:55:30,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:55:30,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:55:30,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:55:30,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:55:30,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd64486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30, skipping insertion in model container [2024-10-24 08:55:30,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:55:30,321 WARN L248 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_floatingpointinfluence_no-floats_file-46.i[916,929] [2024-10-24 08:55:30,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:55:30,380 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:55:30,391 WARN L248 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_floatingpointinfluence_no-floats_file-46.i[916,929] [2024-10-24 08:55:30,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:55:30,418 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:55:30,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30 WrapperNode [2024-10-24 08:55:30,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:55:30,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:55:30,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:55:30,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:55:30,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,475 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-10-24 08:55:30,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:55:30,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:55:30,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:55:30,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:55:30,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,510 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-10-24 08:55:30,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:55:30,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:55:30,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:55:30,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:55:30,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30" (1/1) ... [2024-10-24 08:55:30,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:55:30,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:55:30,564 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-10-24 08:55:30,569 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-10-24 08:55:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:55:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:55:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:55:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:55:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:55:30,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:55:30,672 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:55:30,673 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:55:31,400 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 08:55:31,400 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:55:31,446 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:55:31,447 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:55:31,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:55:31 BoogieIcfgContainer [2024-10-24 08:55:31,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:55:31,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:55:31,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:55:31,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:55:31,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:55:30" (1/3) ... [2024-10-24 08:55:31,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58847a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:55:31, skipping insertion in model container [2024-10-24 08:55:31,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:30" (2/3) ... [2024-10-24 08:55:31,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58847a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:55:31, skipping insertion in model container [2024-10-24 08:55:31,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:55:31" (3/3) ... [2024-10-24 08:55:31,457 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-46.i [2024-10-24 08:55:31,482 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:55:31,483 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:55:31,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:55:31,536 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;@1fdf58a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:55:31,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:55:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:55:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 08:55:31,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:31,548 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:55:31,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:31,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:31,554 INFO L85 PathProgramCache]: Analyzing trace with hash -355662635, now seen corresponding path program 1 times [2024-10-24 08:55:31,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:55:31,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943746943] [2024-10-24 08:55:31,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:31,567 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-10-24 08:55:31,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:55:31,570 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-10-24 08:55:31,571 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-10-24 08:55:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:55:31,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:55:31,721 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-24 08:55:31,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:55:31,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:55:31,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943746943] [2024-10-24 08:55:31,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943746943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:55:31,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:55:31,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:55:31,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977558750] [2024-10-24 08:55:31,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:55:31,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:55:31,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:55:31,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:55:31,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:55:31,765 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:55:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:55:32,242 INFO L93 Difference]: Finished difference Result 87 states and 153 transitions. [2024-10-24 08:55:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:55:32,257 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 93 [2024-10-24 08:55:32,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:55:32,263 INFO L225 Difference]: With dead ends: 87 [2024-10-24 08:55:32,263 INFO L226 Difference]: Without dead ends: 43 [2024-10-24 08:55:32,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-10-24 08:55:32,269 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:55:32,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:55:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-24 08:55:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-24 08:55:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:55:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2024-10-24 08:55:32,304 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 65 transitions. Word has length 93 [2024-10-24 08:55:32,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:55:32,304 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 65 transitions. [2024-10-24 08:55:32,305 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:55:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 65 transitions. [2024-10-24 08:55:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 08:55:32,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:32,308 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:55:32,315 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-10-24 08:55:32,508 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-10-24 08:55:32,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:32,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash -533326125, now seen corresponding path program 1 times [2024-10-24 08:55:32,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:55:32,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118669189] [2024-10-24 08:55:32,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:32,510 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-10-24 08:55:32,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:55:32,516 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-10-24 08:55:32,517 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-10-24 08:55:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:32,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 08:55:32,649 INFO L278 TraceCheckSpWp]: Computing forward predicates...