./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-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-10.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 7129afa67a628c8316ab9be317c869a9a3ba073bbe9f050ef49fac8f66f147d5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:33:31,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:33:31,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:33:31,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:33:31,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:33:31,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:33:31,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:33:31,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:33:31,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:33:31,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:33:31,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:33:31,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:33:31,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:33:31,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:33:31,428 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:33:31,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:33:31,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:33:31,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:33:31,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:33:31,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:33:31,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:33:31,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:33:31,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:33:31,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:33:31,432 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:33:31,432 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:33:31,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:33:31,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:33:31,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:33:31,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:33:31,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:33:31,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:33:31,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:33:31,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:33:31,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:33:31,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:33:31,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:33:31,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:33:31,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:33:31,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:33:31,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:33:31,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:33:31,437 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 -> 7129afa67a628c8316ab9be317c869a9a3ba073bbe9f050ef49fac8f66f147d5 [2024-10-13 03:33:31,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:33:31,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:33:31,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:33:31,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:33:31,711 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:33:31,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-10.i [2024-10-13 03:33:33,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:33:33,399 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:33:33,400 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-10.i [2024-10-13 03:33:33,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/585a6a673/90cf0e69bf634dc5a20da85889976c24/FLAG7375aa2b2 [2024-10-13 03:33:33,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/585a6a673/90cf0e69bf634dc5a20da85889976c24 [2024-10-13 03:33:33,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:33:33,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:33:33,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:33:33,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:33:33,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:33:33,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2930274c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33, skipping insertion in model container [2024-10-13 03:33:33,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:33:33,623 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-10.i[916,929] [2024-10-13 03:33:33,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:33:33,692 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:33:33,705 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-10.i[916,929] [2024-10-13 03:33:33,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:33:33,767 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:33:33,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33 WrapperNode [2024-10-13 03:33:33,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:33:33,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:33:33,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:33:33,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:33:33,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,837 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-10-13 03:33:33,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:33:33,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:33:33,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:33:33,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:33:33,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,885 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-13 03:33:33,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:33:33,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:33:33,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:33:33,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:33:33,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33" (1/1) ... [2024-10-13 03:33:33,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:33:33,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:33:33,948 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-13 03:33:33,951 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-13 03:33:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:33:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:33:33,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:33:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:33:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:33:33,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:33:34,085 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:33:34,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:33:34,310 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:33:34,310 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:33:34,370 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:33:34,373 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:33:34,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:33:34 BoogieIcfgContainer [2024-10-13 03:33:34,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:33:34,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:33:34,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:33:34,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:33:34,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:33:33" (1/3) ... [2024-10-13 03:33:34,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573d8508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:33:34, skipping insertion in model container [2024-10-13 03:33:34,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:33" (2/3) ... [2024-10-13 03:33:34,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573d8508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:33:34, skipping insertion in model container [2024-10-13 03:33:34,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:33:34" (3/3) ... [2024-10-13 03:33:34,384 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-10.i [2024-10-13 03:33:34,403 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:33:34,403 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:33:34,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:33:34,473 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;@e0b47e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:33:34,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:33:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:33:34,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 03:33:34,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:33:34,491 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:33:34,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:33:34,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:33:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2080088819, now seen corresponding path program 1 times [2024-10-13 03:33:34,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:33:34,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490956641] [2024-10-13 03:33:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:33:34,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:33:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:33:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:33:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:33:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:33:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:33:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:33:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:33:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:33:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:33:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:33:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:33:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:33:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:33:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:33:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:34,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:33:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:35,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:33:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:35,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:33:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:35,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:33:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:35,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:33:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:33:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:35,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:33:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:35,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:33:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:33:35,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:33:35,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490956641] [2024-10-13 03:33:35,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490956641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:33:35,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:33:35,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:33:35,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893391940] [2024-10-13 03:33:35,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:33:35,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:33:35,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:33:35,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:33:35,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:33:35,089 INFO L87 Difference]: Start difference. First operand has 51 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:33:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:33:35,138 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2024-10-13 03:33:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:33:35,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 130 [2024-10-13 03:33:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:33:35,152 INFO L225 Difference]: With dead ends: 99 [2024-10-13 03:33:35,153 INFO L226 Difference]: Without dead ends: 49 [2024-10-13 03:33:35,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-13 03:33:35,163 INFO L432 NwaCegarLoop]: 71 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, 71 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-13 03:33:35,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:33:35,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-13 03:33:35,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-13 03:33:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:33:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2024-10-13 03:33:35,219 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 130 [2024-10-13 03:33:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:33:35,220 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 74 transitions. [2024-10-13 03:33:35,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:33:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 74 transitions. [2024-10-13 03:33:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 03:33:35,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:33:35,227 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:33:35,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:33:35,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:33:35,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:33:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1678234573, now seen corresponding path program 1 times [2024-10-13 03:33:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:33:35,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480986673] [2024-10-13 03:33:35,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:33:35,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:33:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:33:35,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:33:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:33:35,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:33:35,576 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:33:35,578 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:33:35,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:33:35,583 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 03:33:35,691 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:33:35,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:33:35 BoogieIcfgContainer [2024-10-13 03:33:35,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:33:35,695 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:33:35,695 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:33:35,695 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:33:35,699 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:33:34" (3/4) ... [2024-10-13 03:33:35,701 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:33:35,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:33:35,702 INFO L158 Benchmark]: Toolchain (without parser) took 2273.16ms. Allocated memory is still 209.7MB. Free memory was 139.2MB in the beginning and 121.2MB in the end (delta: 18.0MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-10-13 03:33:35,703 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:33:35,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.39ms. Allocated memory is still 209.7MB. Free memory was 138.8MB in the beginning and 124.9MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 03:33:35,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.96ms. Allocated memory is still 209.7MB. Free memory was 124.9MB in the beginning and 122.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:33:35,704 INFO L158 Benchmark]: Boogie Preprocessor took 72.36ms. Allocated memory is still 209.7MB. Free memory was 122.4MB in the beginning and 119.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:33:35,704 INFO L158 Benchmark]: RCFGBuilder took 459.56ms. Allocated memory is still 209.7MB. Free memory was 119.5MB in the beginning and 98.9MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 03:33:35,705 INFO L158 Benchmark]: TraceAbstraction took 1318.42ms. Allocated memory is still 209.7MB. Free memory was 98.2MB in the beginning and 122.2MB in the end (delta: -24.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:33:35,705 INFO L158 Benchmark]: Witness Printer took 6.83ms. Allocated memory is still 209.7MB. Free memory was 122.2MB in the beginning and 121.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:33:35,710 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.17ms. Allocated memory is still 121.6MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.39ms. Allocated memory is still 209.7MB. Free memory was 138.8MB in the beginning and 124.9MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.96ms. Allocated memory is still 209.7MB. Free memory was 124.9MB in the beginning and 122.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.36ms. Allocated memory is still 209.7MB. Free memory was 122.4MB in the beginning and 119.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 459.56ms. Allocated memory is still 209.7MB. Free memory was 119.5MB in the beginning and 98.9MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1318.42ms. Allocated memory is still 209.7MB. Free memory was 98.2MB in the beginning and 122.2MB in the end (delta: -24.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.83ms. Allocated memory is still 209.7MB. Free memory was 122.2MB in the beginning and 121.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 to_int at line 109. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_2 = 8; [L24] signed long int var_1_3 = 9; [L25] signed long int var_1_6 = 1000000; [L26] signed long int var_1_7 = 49; [L27] signed long int var_1_8 = 0; [L28] signed char var_1_9 = -10; [L29] unsigned short int var_1_10 = 58996; [L30] unsigned short int var_1_11 = 32; [L31] signed char var_1_12 = 32; [L32] signed char var_1_13 = 16; [L33] signed char var_1_14 = 2; [L34] signed long int var_1_15 = 32; [L35] signed long int var_1_17 = 1000000000; [L36] signed long int var_1_18 = 0; [L37] signed char var_1_19 = 2; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; [L40] signed long int last_1_var_1_3 = 9; [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] CALL updateLastVariables() [L106] last_1_var_1_3 = var_1_3 [L116] RET updateLastVariables() [L117] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_3=9, var_1_6=1000000, var_1_7=49, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_3=9, var_1_6=1000000, var_1_7=49, var_1_8=0, var_1_9=-10] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_3=9, var_1_6=1000000, var_1_7=49, var_1_8=0, var_1_9=-10] [L73] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=1000000, var_1_7=49, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=1000000, var_1_7=49, var_1_8=0, var_1_9=-10] [L73] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=1000000, var_1_7=49, var_1_8=0, var_1_9=-10] [L74] var_1_6 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=49, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=49, var_1_8=0, var_1_9=-10] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=49, var_1_8=0, var_1_9=-10] [L76] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=49, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=49, var_1_8=0, var_1_9=-10] [L76] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=49, var_1_8=0, var_1_9=-10] [L77] var_1_7 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L78] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L79] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L79] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L80] var_1_8 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L81] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L82] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L82] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L83] var_1_10 = __VERIFIER_nondet_ushort() [L84] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L84] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L85] CALL assume_abort_if_not(var_1_10 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L85] RET assume_abort_if_not(var_1_10 <= 65535) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L86] var_1_11 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L87] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L88] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L88] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L89] var_1_12 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L90] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L91] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L91] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L92] var_1_13 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L93] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L94] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L94] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L95] var_1_14 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L96] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L97] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L97] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1000000000, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L98] var_1_17 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_17 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L99] RET assume_abort_if_not(var_1_17 >= 536870911) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L100] CALL assume_abort_if_not(var_1_17 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L100] RET assume_abort_if_not(var_1_17 <= 1073741823) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L101] var_1_21 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_21 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L102] RET assume_abort_if_not(var_1_21 >= 1) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L103] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L103] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L117] RET updateVariables() [L118] CALL step() [L44] var_1_1 = var_1_2 [L45] var_1_18 = var_1_8 [L46] var_1_19 = var_1_12 [L47] var_1_20 = var_1_21 [L48] signed char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_3=9, stepLocal_1=0, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-10] [L49] COND TRUE (- (var_1_10 - var_1_11)) >= stepLocal_1 [L50] var_1_9 = (var_1_12 - ((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=32, var_1_17=1073741823, var_1_18=0, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-4] [L54] COND TRUE \read(var_1_20) [L55] var_1_15 = (var_1_12 - var_1_14) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=-3, var_1_17=1073741823, var_1_18=0, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-4] [L59] signed long int stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_3=9, stepLocal_0=-3, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=-3, var_1_17=1073741823, var_1_18=0, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_3=9, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-4] [L60] COND TRUE stepLocal_0 < var_1_1 [L61] var_1_3 = -0.5 VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=-3, var_1_17=1073741823, var_1_18=0, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-4] [L118] RET step() [L119] CALL, EXPR property() [L109-L110] return ((((((var_1_1 == ((unsigned long int) var_1_2)) && ((var_1_15 < var_1_1) ? (var_1_3 == ((signed long int) -0.5)) : (((- last_1_var_1_3) == (var_1_6 - var_1_7)) ? (var_1_3 == ((signed long int) var_1_8)) : (var_1_3 == ((signed long int) var_1_8))))) && (((- (var_1_10 - var_1_11)) >= var_1_19) ? (var_1_9 == ((signed char) (var_1_12 - ((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14)))))) : (var_1_9 == ((signed char) ((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))))))) && (var_1_20 ? (var_1_15 == ((signed long int) (var_1_12 - var_1_14))) : (var_1_15 == ((signed long int) (var_1_13 - ((var_1_17 - 4) + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) && (var_1_18 == ((signed long int) var_1_8))) && (var_1_19 == ((signed char) var_1_12))) && (var_1_20 == ((unsigned char) var_1_21)) ; [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=-3, var_1_17=1073741823, var_1_18=0, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_3=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_3=9, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=4, var_1_14=3, var_1_15=-3, var_1_17=1073741823, var_1_18=0, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_3=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 71 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 924/924 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-13 03:33:35,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-10.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 7129afa67a628c8316ab9be317c869a9a3ba073bbe9f050ef49fac8f66f147d5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:33:37,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:33:38,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:33:38,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:33:38,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:33:38,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:33:38,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:33:38,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:33:38,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:33:38,065 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:33:38,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:33:38,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:33:38,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:33:38,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:33:38,067 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:33:38,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:33:38,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:33:38,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:33:38,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:33:38,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:33:38,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:33:38,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:33:38,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:33:38,073 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:33:38,073 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:33:38,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:33:38,074 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:33:38,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:33:38,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:33:38,074 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:33:38,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:33:38,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:33:38,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:33:38,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:33:38,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:33:38,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:33:38,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:33:38,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:33:38,077 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:33:38,077 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:33:38,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:33:38,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:33:38,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:33:38,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:33:38,079 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:33:38,079 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 -> 7129afa67a628c8316ab9be317c869a9a3ba073bbe9f050ef49fac8f66f147d5 [2024-10-13 03:33:38,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:33:38,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:33:38,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:33:38,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:33:38,430 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:33:38,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-10.i [2024-10-13 03:33:39,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:33:40,084 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:33:40,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-10.i [2024-10-13 03:33:40,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a64ded8dc/3f838a2f397e4e29b29b18029113a4ba/FLAG4e0636d92 [2024-10-13 03:33:40,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a64ded8dc/3f838a2f397e4e29b29b18029113a4ba [2024-10-13 03:33:40,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:33:40,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:33:40,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:33:40,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:33:40,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:33:40,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5543bd35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40, skipping insertion in model container [2024-10-13 03:33:40,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:33:40,325 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-10.i[916,929] [2024-10-13 03:33:40,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:33:40,404 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:33:40,418 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-10.i[916,929] [2024-10-13 03:33:40,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:33:40,470 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:33:40,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40 WrapperNode [2024-10-13 03:33:40,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:33:40,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:33:40,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:33:40,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:33:40,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,530 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-10-13 03:33:40,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:33:40,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:33:40,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:33:40,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:33:40,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,567 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-13 03:33:40,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:33:40,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:33:40,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:33:40,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:33:40,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40" (1/1) ... [2024-10-13 03:33:40,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:33:40,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:33:40,638 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-13 03:33:40,643 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-13 03:33:40,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:33:40,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:33:40,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:33:40,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:33:40,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:33:40,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:33:40,801 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:33:40,807 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:33:41,110 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:33:41,111 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:33:41,178 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:33:41,179 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:33:41,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:33:41 BoogieIcfgContainer [2024-10-13 03:33:41,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:33:41,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:33:41,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:33:41,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:33:41,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:33:40" (1/3) ... [2024-10-13 03:33:41,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4de978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:33:41, skipping insertion in model container [2024-10-13 03:33:41,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:40" (2/3) ... [2024-10-13 03:33:41,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4de978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:33:41, skipping insertion in model container [2024-10-13 03:33:41,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:33:41" (3/3) ... [2024-10-13 03:33:41,193 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-10.i [2024-10-13 03:33:41,210 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:33:41,211 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:33:41,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:33:41,311 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;@2754692c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:33:41,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:33:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:33:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 03:33:41,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:33:41,331 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:33:41,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:33:41,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:33:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2080088819, now seen corresponding path program 1 times [2024-10-13 03:33:41,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:33:41,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865838103] [2024-10-13 03:33:41,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:33:41,356 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-13 03:33:41,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:33:41,359 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-13 03:33:41,361 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-13 03:33:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:41,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:33:41,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:33:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2024-10-13 03:33:41,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:33:41,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:33:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865838103] [2024-10-13 03:33:41,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865838103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:33:41,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:33:41,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:33:41,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185180003] [2024-10-13 03:33:41,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:33:41,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:33:41,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:33:41,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:33:41,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:33:41,630 INFO L87 Difference]: Start difference. First operand has 51 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:33:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:33:41,671 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2024-10-13 03:33:41,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:33:41,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 130 [2024-10-13 03:33:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:33:41,683 INFO L225 Difference]: With dead ends: 99 [2024-10-13 03:33:41,683 INFO L226 Difference]: Without dead ends: 49 [2024-10-13 03:33:41,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-13 03:33:41,693 INFO L432 NwaCegarLoop]: 71 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, 71 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-13 03:33:41,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:33:41,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-13 03:33:41,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-13 03:33:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:33:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2024-10-13 03:33:41,760 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 130 [2024-10-13 03:33:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:33:41,762 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 74 transitions. [2024-10-13 03:33:41,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:33:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 74 transitions. [2024-10-13 03:33:41,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 03:33:41,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:33:41,772 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:33:41,778 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-13 03:33:41,972 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-13 03:33:41,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:33:41,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:33:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1678234573, now seen corresponding path program 1 times [2024-10-13 03:33:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:33:41,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806112970] [2024-10-13 03:33:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:33:41,975 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-13 03:33:41,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:33:41,977 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-13 03:33:41,978 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-13 03:33:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:42,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 03:33:42,125 INFO L278 TraceCheckSpWp]: Computing forward predicates...