./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_has-floats_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_has-floats_file-86.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 03eb8d0594f660e397efb8ed7c8e04abe62220780abc754b35c25622af978718 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:58:23,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:58:23,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:58:23,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:58:23,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:58:23,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:58:23,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:58:23,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:58:23,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:58:23,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:58:23,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:58:23,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:58:23,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:58:23,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:58:23,882 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:58:23,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:58:23,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:58:23,883 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:58:23,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:58:23,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:58:23,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:58:23,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:58:23,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:58:23,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:58:23,890 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:58:23,890 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:58:23,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:58:23,891 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:58:23,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:58:23,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:58:23,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:58:23,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:58:23,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:58:23,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:58:23,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:58:23,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:58:23,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:58:23,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:58:23,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:58:23,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:58:23,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:58:23,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:58:23,895 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 -> 03eb8d0594f660e397efb8ed7c8e04abe62220780abc754b35c25622af978718 [2024-10-14 10:58:24,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:58:24,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:58:24,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:58:24,135 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:58:24,135 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:58:24,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i [2024-10-14 10:58:25,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:58:25,797 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:58:25,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i [2024-10-14 10:58:25,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf92ad1f3/1c717be1331c4f188c10d98a5448d6b4/FLAGdb85c018f [2024-10-14 10:58:25,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf92ad1f3/1c717be1331c4f188c10d98a5448d6b4 [2024-10-14 10:58:25,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:58:25,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:58:25,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:58:25,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:58:25,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:58:25,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:58:25" (1/1) ... [2024-10-14 10:58:25,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d38e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:25, skipping insertion in model container [2024-10-14 10:58:25,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:58:25" (1/1) ... [2024-10-14 10:58:25,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:58:25,989 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_has-floats_file-86.i[917,930] [2024-10-14 10:58:26,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:58:26,070 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:58:26,082 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_has-floats_file-86.i[917,930] [2024-10-14 10:58:26,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:58:26,117 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:58:26,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26 WrapperNode [2024-10-14 10:58:26,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:58:26,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:58:26,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:58:26,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:58:26,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26" (1/1) ... [2024-10-14 10:58:26,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26" (1/1) ... [2024-10-14 10:58:26,176 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-10-14 10:58:26,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:58:26,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:58:26,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:58:26,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:58:26,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26" (1/1) ... [2024-10-14 10:58:26,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26" (1/1) ... [2024-10-14 10:58:26,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26" (1/1) ... [2024-10-14 10:58:26,205 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-14 10:58:26,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26" (1/1) ... [2024-10-14 10:58:26,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26" (1/1) ... [2024-10-14 10:58:26,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26" (1/1) ... [2024-10-14 10:58:26,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26" (1/1) ... [2024-10-14 10:58:26,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26" (1/1) ... [2024-10-14 10:58:26,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26" (1/1) ... [2024-10-14 10:58:26,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:58:26,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:58:26,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:58:26,223 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:58:26,224 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26" (1/1) ... [2024-10-14 10:58:26,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:58:26,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:58:26,325 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-14 10:58:26,338 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-14 10:58:26,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:58:26,372 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:58:26,372 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:58:26,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:58:26,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:58:26,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:58:26,444 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:58:26,445 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:58:26,742 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-14 10:58:26,746 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:58:26,775 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:58:26,777 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:58:26,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:58:26 BoogieIcfgContainer [2024-10-14 10:58:26,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:58:26,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:58:26,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:58:26,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:58:26,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:58:25" (1/3) ... [2024-10-14 10:58:26,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dc89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:58:26, skipping insertion in model container [2024-10-14 10:58:26,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:26" (2/3) ... [2024-10-14 10:58:26,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dc89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:58:26, skipping insertion in model container [2024-10-14 10:58:26,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:58:26" (3/3) ... [2024-10-14 10:58:26,785 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-86.i [2024-10-14 10:58:26,800 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:58:26,801 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:58:26,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:58:26,862 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;@47eb5696, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:58:26,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:58:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 10:58:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 10:58:26,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:58:26,880 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:58:26,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:58:26,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:58:26,885 INFO L85 PathProgramCache]: Analyzing trace with hash 120422145, now seen corresponding path program 1 times [2024-10-14 10:58:26,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:58:26,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530140872] [2024-10-14 10:58:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:58:26,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:58:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:58:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:58:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:58:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:58:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:58:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:58:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:58:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:58:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:58:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:58:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:58:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:58:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:58:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:58:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:58:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:58:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:58:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:58:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:58:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:58:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:58:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:58:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:58:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:58:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:58:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-14 10:58:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:58:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530140872] [2024-10-14 10:58:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530140872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:58:27,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:58:27,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:58:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852796109] [2024-10-14 10:58:27,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:58:27,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:58:27,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:58:27,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:58:27,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:58:27,226 INFO L87 Difference]: Start difference. First operand has 67 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 10:58:27,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:58:27,261 INFO L93 Difference]: Finished difference Result 131 states and 227 transitions. [2024-10-14 10:58:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:58:27,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 151 [2024-10-14 10:58:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:58:27,270 INFO L225 Difference]: With dead ends: 131 [2024-10-14 10:58:27,270 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 10:58:27,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-14 10:58:27,277 INFO L432 NwaCegarLoop]: 94 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, 94 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-14 10:58:27,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:58:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 10:58:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-14 10:58:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 10:58:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2024-10-14 10:58:27,320 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 97 transitions. Word has length 151 [2024-10-14 10:58:27,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:58:27,320 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 97 transitions. [2024-10-14 10:58:27,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 10:58:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 97 transitions. [2024-10-14 10:58:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 10:58:27,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:58:27,323 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:58:27,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:58:27,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:58:27,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:58:27,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1157344635, now seen corresponding path program 1 times [2024-10-14 10:58:27,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:58:27,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480123824] [2024-10-14 10:58:27,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:58:27,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:58:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:58:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:58:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:58:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:58:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:58:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:58:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:58:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:58:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:58:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:58:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:58:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:58:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:58:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:58:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:58:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:58:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:58:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:58:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:58:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:58:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:58:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:58:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:58:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:58:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:58:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-14 10:58:27,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:58:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480123824] [2024-10-14 10:58:27,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480123824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:58:27,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:58:27,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:58:27,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256165648] [2024-10-14 10:58:27,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:58:27,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:58:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:58:27,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:58:27,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:58:27,512 INFO L87 Difference]: Start difference. First operand 65 states and 97 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 10:58:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:58:27,562 INFO L93 Difference]: Finished difference Result 149 states and 220 transitions. [2024-10-14 10:58:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:58:27,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 151 [2024-10-14 10:58:27,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:58:27,565 INFO L225 Difference]: With dead ends: 149 [2024-10-14 10:58:27,565 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 10:58:27,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:58:27,567 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 21 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:58:27,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 190 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:58:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 10:58:27,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2024-10-14 10:58:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 10:58:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2024-10-14 10:58:27,583 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 111 transitions. Word has length 151 [2024-10-14 10:58:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:58:27,584 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 111 transitions. [2024-10-14 10:58:27,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 10:58:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2024-10-14 10:58:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 10:58:27,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:58:27,588 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:58:27,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:58:27,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:58:27,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:58:27,589 INFO L85 PathProgramCache]: Analyzing trace with hash 764317625, now seen corresponding path program 1 times [2024-10-14 10:58:27,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:58:27,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252358717] [2024-10-14 10:58:27,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:58:27,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:58:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:58:27,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:58:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:58:27,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:58:27,738 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:58:27,739 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:58:27,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:58:27,743 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 10:58:27,824 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:58:27,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:58:27 BoogieIcfgContainer [2024-10-14 10:58:27,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:58:27,831 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:58:27,831 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:58:27,831 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:58:27,831 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:58:26" (3/4) ... [2024-10-14 10:58:27,833 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:58:27,834 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:58:27,835 INFO L158 Benchmark]: Toolchain (without parser) took 2007.64ms. Allocated memory is still 188.7MB. Free memory was 121.5MB in the beginning and 122.2MB in the end (delta: -654.1kB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2024-10-14 10:58:27,837 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:58:27,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.41ms. Allocated memory is still 188.7MB. Free memory was 121.3MB in the beginning and 106.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 10:58:27,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.85ms. Allocated memory is still 188.7MB. Free memory was 106.2MB in the beginning and 101.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:58:27,838 INFO L158 Benchmark]: Boogie Preprocessor took 45.19ms. Allocated memory is still 188.7MB. Free memory was 101.4MB in the beginning and 93.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 10:58:27,838 INFO L158 Benchmark]: RCFGBuilder took 554.45ms. Allocated memory is still 188.7MB. Free memory was 92.7MB in the beginning and 135.7MB in the end (delta: -43.0MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-10-14 10:58:27,838 INFO L158 Benchmark]: TraceAbstraction took 1051.33ms. Allocated memory is still 188.7MB. Free memory was 135.7MB in the beginning and 123.0MB in the end (delta: 12.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-10-14 10:58:27,839 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 188.7MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:58:27,842 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.41ms. Allocated memory is still 188.7MB. Free memory was 121.3MB in the beginning and 106.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.85ms. Allocated memory is still 188.7MB. Free memory was 106.2MB in the beginning and 101.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.19ms. Allocated memory is still 188.7MB. Free memory was 101.4MB in the beginning and 93.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 554.45ms. Allocated memory is still 188.7MB. Free memory was 92.7MB in the beginning and 135.7MB in the end (delta: -43.0MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1051.33ms. Allocated memory is still 188.7MB. Free memory was 135.7MB in the beginning and 123.0MB in the end (delta: 12.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 188.7MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_3 = 2; [L25] signed short int var_1_4 = 256; [L26] signed short int var_1_5 = -256; [L27] signed short int var_1_6 = 2; [L28] float var_1_7 = 255.8; [L29] float var_1_8 = 127.8; [L30] float var_1_9 = 128.5; [L31] float var_1_10 = 499.3; [L32] unsigned short int var_1_11 = 10; [L33] unsigned char var_1_12 = 1; [L34] unsigned short int var_1_13 = 8; [L35] unsigned short int var_1_14 = 256; [L36] unsigned short int var_1_15 = 1; [L37] unsigned short int var_1_16 = 16; [L38] unsigned short int var_1_17 = 57705; [L39] unsigned long int var_1_18 = 64; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L66] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L66] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L67] var_1_3 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_3 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L68] RET assume_abort_if_not(var_1_3 >= -16383) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L69] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L69] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L70] var_1_4 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_4 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L71] RET assume_abort_if_not(var_1_4 >= -8191) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L72] CALL assume_abort_if_not(var_1_4 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L72] RET assume_abort_if_not(var_1_4 <= 8192) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L73] var_1_5 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_5 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L74] RET assume_abort_if_not(var_1_5 >= -8191) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L75] CALL assume_abort_if_not(var_1_5 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L75] RET assume_abort_if_not(var_1_5 <= 8191) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L76] var_1_6 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L77] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L78] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L78] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L79] var_1_8 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5, var_1_9=257/2] [L80] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5, var_1_9=257/2] [L81] var_1_9 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L82] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L83] var_1_10 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L84] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L87] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L87] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L88] var_1_13 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L89] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L90] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L90] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L91] var_1_14 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L92] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L93] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L93] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L94] var_1_15 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L96] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L96] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L97] var_1_16 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L99] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L99] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L100] var_1_17 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L101] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L102] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L102] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L115] RET updateVariables() [L116] CALL step() [L43] COND FALSE !(! var_1_2) [L46] var_1_1 = var_1_5 VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=64, var_1_1=8191, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L48] signed short int stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=8191, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=64, var_1_1=8191, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767, var_1_7=1279/5] [L49] COND TRUE stepLocal_0 > 2 [L50] var_1_7 = ((var_1_8 + var_1_9) - var_1_10) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=64, var_1_1=8191, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767] [L52] var_1_18 = var_1_17 VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=65534, var_1_1=8191, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767] [L53] COND TRUE var_1_2 && var_1_12 [L54] var_1_11 = (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))) VAL [isInitial=1, var_1_11=65533, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=65534, var_1_1=8191, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767] [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR (((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((float) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15))))) VAL [isInitial=1, var_1_11=65533, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=65534, var_1_1=8191, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767] [L107-L108] return ((((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((float) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15)))))) && (var_1_18 == ((unsigned long int) var_1_17)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=65533, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=65534, var_1_1=8191, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767] [L19] reach_error() VAL [isInitial=1, var_1_11=65533, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=65534, var_1_18=65534, var_1_1=8191, var_1_2=1, var_1_3=0, var_1_4=8192, var_1_5=8191, var_1_6=-32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 284 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 198 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 453 NumberOfCodeBlocks, 453 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2400/2400 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-14 10:58:27,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.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 03eb8d0594f660e397efb8ed7c8e04abe62220780abc754b35c25622af978718 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:58:29,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:58:29,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:58:29,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:58:29,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:58:29,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:58:29,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:58:29,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:58:29,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:58:29,989 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:58:29,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:58:29,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:58:29,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:58:29,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:58:29,992 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:58:29,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:58:29,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:58:29,992 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:58:29,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:58:29,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:58:29,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:58:29,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:58:29,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:58:29,996 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:58:29,996 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:58:29,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:58:29,997 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:58:29,997 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:58:29,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:58:29,997 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:58:29,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:58:29,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:58:29,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:58:29,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:58:29,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:58:29,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:58:29,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:58:29,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:58:29,999 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:58:29,999 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:58:29,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:58:30,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:58:30,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:58:30,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:58:30,000 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:58:30,000 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 -> 03eb8d0594f660e397efb8ed7c8e04abe62220780abc754b35c25622af978718 [2024-10-14 10:58:30,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:58:30,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:58:30,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:58:30,296 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:58:30,297 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:58:30,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i [2024-10-14 10:58:31,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:58:31,889 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:58:31,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i [2024-10-14 10:58:31,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d51446230/2c4d9a21c3514500ae79dd5591523533/FLAG16a27f361 [2024-10-14 10:58:31,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d51446230/2c4d9a21c3514500ae79dd5591523533 [2024-10-14 10:58:31,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:58:31,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:58:31,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:58:31,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:58:31,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:58:31,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:58:31" (1/1) ... [2024-10-14 10:58:31,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dfcae38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:31, skipping insertion in model container [2024-10-14 10:58:31,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:58:31" (1/1) ... [2024-10-14 10:58:31,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:58:32,090 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_has-floats_file-86.i[917,930] [2024-10-14 10:58:32,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:58:32,174 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:58:32,184 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_has-floats_file-86.i[917,930] [2024-10-14 10:58:32,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:58:32,229 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:58:32,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32 WrapperNode [2024-10-14 10:58:32,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:58:32,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:58:32,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:58:32,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:58:32,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32" (1/1) ... [2024-10-14 10:58:32,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32" (1/1) ... [2024-10-14 10:58:32,285 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-10-14 10:58:32,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:58:32,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:58:32,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:58:32,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:58:32,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32" (1/1) ... [2024-10-14 10:58:32,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32" (1/1) ... [2024-10-14 10:58:32,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32" (1/1) ... [2024-10-14 10:58:32,318 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-14 10:58:32,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32" (1/1) ... [2024-10-14 10:58:32,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32" (1/1) ... [2024-10-14 10:58:32,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32" (1/1) ... [2024-10-14 10:58:32,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32" (1/1) ... [2024-10-14 10:58:32,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32" (1/1) ... [2024-10-14 10:58:32,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32" (1/1) ... [2024-10-14 10:58:32,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:58:32,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:58:32,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:58:32,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:58:32,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32" (1/1) ... [2024-10-14 10:58:32,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:58:32,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:58:32,391 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-14 10:58:32,398 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-14 10:58:32,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:58:32,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:58:32,432 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:58:32,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:58:32,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:58:32,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:58:32,496 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:58:32,498 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:58:32,859 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 10:58:32,859 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:58:32,890 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:58:32,890 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:58:32,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:58:32 BoogieIcfgContainer [2024-10-14 10:58:32,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:58:32,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:58:32,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:58:32,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:58:32,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:58:31" (1/3) ... [2024-10-14 10:58:32,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339e6ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:58:32, skipping insertion in model container [2024-10-14 10:58:32,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:58:32" (2/3) ... [2024-10-14 10:58:32,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339e6ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:58:32, skipping insertion in model container [2024-10-14 10:58:32,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:58:32" (3/3) ... [2024-10-14 10:58:32,897 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-86.i [2024-10-14 10:58:32,910 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:58:32,911 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:58:32,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:58:32,971 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;@b870174, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:58:32,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:58:32,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 10:58:32,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-14 10:58:32,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:58:32,990 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:58:32,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:58:32,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:58:32,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2035973591, now seen corresponding path program 1 times [2024-10-14 10:58:33,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:58:33,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227011182] [2024-10-14 10:58:33,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:58:33,008 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-14 10:58:33,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:58:33,011 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-14 10:58:33,041 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-14 10:58:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:33,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:58:33,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:58:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-10-14 10:58:33,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:58:33,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:58:33,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227011182] [2024-10-14 10:58:33,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227011182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:58:33,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:58:33,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:58:33,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669725496] [2024-10-14 10:58:33,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:58:33,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:58:33,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:58:33,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:58:33,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:58:33,366 INFO L87 Difference]: Start difference. First operand has 58 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 10:58:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:58:33,666 INFO L93 Difference]: Finished difference Result 113 states and 201 transitions. [2024-10-14 10:58:33,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:58:33,675 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 149 [2024-10-14 10:58:33,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:58:33,680 INFO L225 Difference]: With dead ends: 113 [2024-10-14 10:58:33,681 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 10:58:33,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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-14 10:58:33,686 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 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.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:58:33,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:58:33,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 10:58:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-14 10:58:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 10:58:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2024-10-14 10:58:33,724 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 149 [2024-10-14 10:58:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:58:33,724 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2024-10-14 10:58:33,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 10:58:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2024-10-14 10:58:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-14 10:58:33,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:58:33,731 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:58:33,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 10:58:33,932 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-14 10:58:33,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:58:33,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:58:33,934 INFO L85 PathProgramCache]: Analyzing trace with hash -46069981, now seen corresponding path program 1 times [2024-10-14 10:58:33,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:58:33,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333161580] [2024-10-14 10:58:33,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:58:33,937 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-14 10:58:33,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:58:33,939 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-14 10:58:33,940 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-14 10:58:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:34,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 10:58:34,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:58:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-14 10:58:34,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:58:34,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:58:34,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333161580] [2024-10-14 10:58:34,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333161580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:58:34,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:58:34,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:58:34,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917106672] [2024-10-14 10:58:34,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:58:34,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:58:34,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:58:34,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:58:34,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:58:34,191 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 10:58:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:58:34,381 INFO L93 Difference]: Finished difference Result 122 states and 181 transitions. [2024-10-14 10:58:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:58:34,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 149 [2024-10-14 10:58:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:58:34,390 INFO L225 Difference]: With dead ends: 122 [2024-10-14 10:58:34,390 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 10:58:34,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:58:34,392 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:58:34,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 159 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:58:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 10:58:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-10-14 10:58:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 10:58:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-10-14 10:58:34,401 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 149 [2024-10-14 10:58:34,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:58:34,402 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-10-14 10:58:34,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 10:58:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-10-14 10:58:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-14 10:58:34,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:58:34,404 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:58:34,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 10:58:34,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:58:34,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:58:34,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:58:34,610 INFO L85 PathProgramCache]: Analyzing trace with hash -855416607, now seen corresponding path program 1 times [2024-10-14 10:58:34,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:58:34,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543713016] [2024-10-14 10:58:34,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:58:34,611 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-14 10:58:34,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:58:34,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:58:34,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 10:58:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:58:34,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 10:58:34,859 INFO L278 TraceCheckSpWp]: Computing forward predicates...