./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.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 71fe371b3648f25840026374af24a61fcda8c56564401f21f9e8d01fae27caed --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:54:32,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:54:32,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:54:32,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:54:32,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:54:32,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:54:32,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:54:32,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:54:32,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:54:32,397 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:54:32,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:54:32,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:54:32,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:54:32,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:54:32,400 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:54:32,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:54:32,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:54:32,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:54:32,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:54:32,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:54:32,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:54:32,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:54:32,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:54:32,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:54:32,406 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:54:32,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:54:32,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:54:32,407 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:54:32,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:54:32,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:54:32,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:54:32,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:54:32,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:54:32,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:54:32,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:54:32,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:54:32,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:54:32,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:54:32,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:54:32,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:54:32,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:54:32,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:54:32,412 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 -> 71fe371b3648f25840026374af24a61fcda8c56564401f21f9e8d01fae27caed [2024-11-12 04:54:32,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:54:32,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:54:32,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:54:32,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:54:32,698 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:54:32,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-11-12 04:54:34,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:54:34,408 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:54:34,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-11-12 04:54:34,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063a919af/1094da1834a34904a3db87791b83087f/FLAG9aa4d3987 [2024-11-12 04:54:34,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063a919af/1094da1834a34904a3db87791b83087f [2024-11-12 04:54:34,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:54:34,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:54:34,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:54:34,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:54:34,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:54:34,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d586994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34, skipping insertion in model container [2024-11-12 04:54:34,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:54:34,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i[916,929] [2024-11-12 04:54:34,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:54:34,752 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:54:34,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i[916,929] [2024-11-12 04:54:34,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:54:34,805 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:54:34,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34 WrapperNode [2024-11-12 04:54:34,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:54:34,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:54:34,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:54:34,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:54:34,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,864 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-11-12 04:54:34,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:54:34,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:54:34,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:54:34,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:54:34,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,903 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:54:34,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:54:34,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:54:34,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:54:34,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:54:34,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34" (1/1) ... [2024-11-12 04:54:34,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:54:34,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:54:34,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:54:34,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:54:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:54:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:54:35,015 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:54:35,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:54:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:54:35,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:54:35,093 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:54:35,095 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:54:35,429 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-12 04:54:35,430 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:54:35,443 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:54:35,444 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:54:35,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:54:35 BoogieIcfgContainer [2024-11-12 04:54:35,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:54:35,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:54:35,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:54:35,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:54:35,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:54:34" (1/3) ... [2024-11-12 04:54:35,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118afa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:54:35, skipping insertion in model container [2024-11-12 04:54:35,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:34" (2/3) ... [2024-11-12 04:54:35,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118afa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:54:35, skipping insertion in model container [2024-11-12 04:54:35,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:54:35" (3/3) ... [2024-11-12 04:54:35,454 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-95.i [2024-11-12 04:54:35,469 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:54:35,469 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:54:35,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:54:35,531 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;@21945fe6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:54:35,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:54:35,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:54:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 04:54:35,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:54:35,554 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:54:35,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:54:35,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:54:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash 360092605, now seen corresponding path program 1 times [2024-11-12 04:54:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:54:35,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940966724] [2024-11-12 04:54:35,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:54:35,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:54:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:54:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:54:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:54:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:54:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:54:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:54:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:54:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:54:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:54:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:54:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:54:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:54:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:54:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:54:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:54:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:54:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:54:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:54:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:54:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 04:54:35,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:54:35,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940966724] [2024-11-12 04:54:35,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940966724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:54:35,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:54:35,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:54:35,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654481583] [2024-11-12 04:54:35,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:54:35,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:54:35,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:54:35,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:54:35,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:54:35,946 INFO L87 Difference]: Start difference. First operand has 67 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 04:54:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:54:35,976 INFO L93 Difference]: Finished difference Result 127 states and 211 transitions. [2024-11-12 04:54:35,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:54:35,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 122 [2024-11-12 04:54:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:54:35,987 INFO L225 Difference]: With dead ends: 127 [2024-11-12 04:54:35,987 INFO L226 Difference]: Without dead ends: 63 [2024-11-12 04:54:35,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:54:35,993 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:54:35,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:54:36,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-12 04:54:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-12 04:54:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:54:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2024-11-12 04:54:36,043 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 122 [2024-11-12 04:54:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:54:36,043 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2024-11-12 04:54:36,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 04:54:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2024-11-12 04:54:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 04:54:36,047 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:54:36,048 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:54:36,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:54:36,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:54:36,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:54:36,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1432269755, now seen corresponding path program 1 times [2024-11-12 04:54:36,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:54:36,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796847097] [2024-11-12 04:54:36,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:54:36,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:54:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:54:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:54:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:54:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:54:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:54:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:54:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:54:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:54:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:54:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:54:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:54:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:54:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:54:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:54:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:54:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:54:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:54:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:54:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:54:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 04:54:36,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:54:36,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796847097] [2024-11-12 04:54:36,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796847097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:54:36,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:54:36,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:54:36,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819852731] [2024-11-12 04:54:36,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:54:36,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:54:36,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:54:36,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:54:36,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:54:36,519 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:54:36,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:54:36,549 INFO L93 Difference]: Finished difference Result 124 states and 183 transitions. [2024-11-12 04:54:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:54:36,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-12 04:54:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:54:36,554 INFO L225 Difference]: With dead ends: 124 [2024-11-12 04:54:36,554 INFO L226 Difference]: Without dead ends: 64 [2024-11-12 04:54:36,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:54:36,559 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:54:36,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:54:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-12 04:54:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-12 04:54:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:54:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2024-11-12 04:54:36,578 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 122 [2024-11-12 04:54:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:54:36,580 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2024-11-12 04:54:36,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:54:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-11-12 04:54:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-12 04:54:36,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:54:36,585 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:54:36,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:54:36,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:54:36,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:54:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1217660633, now seen corresponding path program 1 times [2024-11-12 04:54:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:54:36,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850481793] [2024-11-12 04:54:36,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:54:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:54:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:54:36,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639303267] [2024-11-12 04:54:36,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:54:36,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:54:36,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:54:36,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:54:36,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 04:54:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:54:36,768 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:54:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:54:36,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:54:36,876 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:54:36,877 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:54:36,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 04:54:37,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:54:37,083 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 04:54:37,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:54:37,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:54:37 BoogieIcfgContainer [2024-11-12 04:54:37,180 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:54:37,180 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:54:37,181 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:54:37,181 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:54:37,181 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:54:35" (3/4) ... [2024-11-12 04:54:37,183 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:54:37,184 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:54:37,185 INFO L158 Benchmark]: Toolchain (without parser) took 2748.70ms. Allocated memory is still 172.0MB. Free memory was 103.7MB in the beginning and 78.8MB in the end (delta: 24.9MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-11-12 04:54:37,185 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory was 80.9MB in the beginning and 80.7MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:54:37,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.07ms. Allocated memory is still 172.0MB. Free memory was 103.5MB in the beginning and 139.2MB in the end (delta: -35.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-11-12 04:54:37,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.02ms. Allocated memory is still 172.0MB. Free memory was 139.2MB in the beginning and 135.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:54:37,186 INFO L158 Benchmark]: Boogie Preprocessor took 60.45ms. Allocated memory is still 172.0MB. Free memory was 135.7MB in the beginning and 131.4MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:54:37,186 INFO L158 Benchmark]: RCFGBuilder took 519.20ms. Allocated memory is still 172.0MB. Free memory was 130.8MB in the beginning and 109.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 04:54:37,187 INFO L158 Benchmark]: TraceAbstraction took 1732.49ms. Allocated memory is still 172.0MB. Free memory was 109.1MB in the beginning and 79.8MB in the end (delta: 29.4MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2024-11-12 04:54:37,187 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 172.0MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:54:37,189 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory was 80.9MB in the beginning and 80.7MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.07ms. Allocated memory is still 172.0MB. Free memory was 103.5MB in the beginning and 139.2MB in the end (delta: -35.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.02ms. Allocated memory is still 172.0MB. Free memory was 139.2MB in the beginning and 135.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.45ms. Allocated memory is still 172.0MB. Free memory was 135.7MB in the beginning and 131.4MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 519.20ms. Allocated memory is still 172.0MB. Free memory was 130.8MB in the beginning and 109.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1732.49ms. Allocated memory is still 172.0MB. Free memory was 109.1MB in the beginning and 79.8MB in the end (delta: 29.4MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 172.0MB. Free memory is still 78.8MB. 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 to_int at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed long int var_1_3 = 1; [L24] signed long int var_1_4 = 8; [L25] signed long int var_1_5 = 255; [L26] signed long int var_1_6 = 50; [L27] unsigned char var_1_7 = 0; [L28] unsigned long int var_1_8 = 8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 5; [L31] unsigned char var_1_12 = 2; [L32] signed short int var_1_13 = 0; [L33] unsigned long int var_1_14 = 16; [L34] signed char var_1_16 = -1; [L35] signed char var_1_17 = -16; [L36] unsigned char last_1_var_1_7 = 0; VAL [isInitial=0, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=8, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L88] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=8, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L58] var_1_4 = __VERIFIER_nondet_long() [L59] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L59] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L60] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L60] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L61] var_1_5 = __VERIFIER_nondet_long() [L62] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L62] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L63] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L63] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L64] var_1_6 = __VERIFIER_nondet_long() [L65] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L65] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L66] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L66] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L67] var_1_8 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0] [L69] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L69] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L70] var_1_10 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L71] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L72] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L72] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L73] var_1_11 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L74] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L75] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L75] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L78] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L78] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L79] var_1_14 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L80] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L81] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L81] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L82] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L82] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L83] var_1_17 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L84] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L85] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L85] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L99] RET updateVariables() [L100] CALL step() [L40] var_1_1 = ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))) [L41] var_1_3 = ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f))))) [L42] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L43] EXPR var_1_16 & var_1_1 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L43] signed long int stepLocal_0 = var_1_16 & var_1_1; [L44] COND TRUE (- (3351680781u - var_1_8)) > stepLocal_0 [L45] var_1_7 = (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L47] EXPR var_1_7 >> var_1_7 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L47] COND FALSE !((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) [L50] COND FALSE !(var_1_16 >= var_1_1) [L53] var_1_13 = 256 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=256, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR ((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((signed long int) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=256, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_3=23, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L91] EXPR (((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((signed long int) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1)) && (((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) ? (var_1_13 == ((signed short int) ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))))) : ((var_1_16 >= var_1_1) ? (var_1_13 == ((signed short int) (-5 + (var_1_12 - var_1_11)))) : (var_1_13 == ((signed short int) 256)))) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=256, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_3=23, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L91-L92] return ((((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((signed long int) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1)) && (((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) ? (var_1_13 == ((signed short int) ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))))) : ((var_1_16 >= var_1_1) ? (var_1_13 == ((signed short int) (-5 + (var_1_12 - var_1_11)))) : (var_1_13 == ((signed short int) 256))))) && (var_1_16 == ((signed char) var_1_17)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=256, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_3=23, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=256, var_1_12=0, var_1_13=256, var_1_14=-4294967295, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_3=23, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4294967296] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 183 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=0, 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 04:54:37,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.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 71fe371b3648f25840026374af24a61fcda8c56564401f21f9e8d01fae27caed --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:54:39,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:54:39,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:54:39,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:54:39,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:54:39,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:54:39,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:54:39,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:54:39,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:54:39,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:54:39,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:54:39,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:54:39,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:54:39,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:54:39,510 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:54:39,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:54:39,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:54:39,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:54:39,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:54:39,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:54:39,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:54:39,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:54:39,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:54:39,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:54:39,516 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:54:39,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:54:39,516 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:54:39,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:54:39,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:54:39,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:54:39,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:54:39,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:54:39,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:54:39,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:54:39,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:54:39,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:54:39,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:54:39,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:54:39,522 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:54:39,522 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:54:39,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:54:39,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:54:39,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:54:39,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:54:39,524 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 -> 71fe371b3648f25840026374af24a61fcda8c56564401f21f9e8d01fae27caed [2024-11-12 04:54:39,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:54:39,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:54:39,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:54:39,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:54:39,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:54:39,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-11-12 04:54:41,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:54:41,563 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:54:41,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-11-12 04:54:41,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/562514781/82059fa96f2b4b63bad5ecce7e682554/FLAG3df6c187a [2024-11-12 04:54:41,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/562514781/82059fa96f2b4b63bad5ecce7e682554 [2024-11-12 04:54:41,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:54:41,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:54:41,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:54:41,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:54:41,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:54:41,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:54:41" (1/1) ... [2024-11-12 04:54:41,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@89ca0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:41, skipping insertion in model container [2024-11-12 04:54:41,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:54:41" (1/1) ... [2024-11-12 04:54:41,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:54:42,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i[916,929] [2024-11-12 04:54:42,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:54:42,211 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:54:42,224 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i[916,929] [2024-11-12 04:54:42,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:54:42,298 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:54:42,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42 WrapperNode [2024-11-12 04:54:42,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:54:42,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:54:42,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:54:42,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:54:42,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42" (1/1) ... [2024-11-12 04:54:42,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42" (1/1) ... [2024-11-12 04:54:42,345 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-12 04:54:42,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:54:42,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:54:42,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:54:42,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:54:42,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42" (1/1) ... [2024-11-12 04:54:42,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42" (1/1) ... [2024-11-12 04:54:42,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42" (1/1) ... [2024-11-12 04:54:42,397 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:54:42,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42" (1/1) ... [2024-11-12 04:54:42,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42" (1/1) ... [2024-11-12 04:54:42,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42" (1/1) ... [2024-11-12 04:54:42,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42" (1/1) ... [2024-11-12 04:54:42,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42" (1/1) ... [2024-11-12 04:54:42,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42" (1/1) ... [2024-11-12 04:54:42,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:54:42,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:54:42,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:54:42,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:54:42,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42" (1/1) ... [2024-11-12 04:54:42,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:54:42,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:54:42,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:54:42,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:54:42,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:54:42,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:54:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:54:42,512 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:54:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:54:42,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:54:42,586 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:54:42,591 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:54:48,246 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 04:54:48,247 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:54:48,258 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:54:48,258 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:54:48,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:54:48 BoogieIcfgContainer [2024-11-12 04:54:48,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:54:48,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:54:48,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:54:48,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:54:48,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:54:41" (1/3) ... [2024-11-12 04:54:48,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad830d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:54:48, skipping insertion in model container [2024-11-12 04:54:48,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:42" (2/3) ... [2024-11-12 04:54:48,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad830d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:54:48, skipping insertion in model container [2024-11-12 04:54:48,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:54:48" (3/3) ... [2024-11-12 04:54:48,280 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-95.i [2024-11-12 04:54:48,297 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:54:48,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:54:48,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:54:48,357 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;@364aa51f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:54:48,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:54:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:54:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 04:54:48,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:54:48,370 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:54:48,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:54:48,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:54:48,376 INFO L85 PathProgramCache]: Analyzing trace with hash 311912880, now seen corresponding path program 1 times [2024-11-12 04:54:48,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:54:48,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278918943] [2024-11-12 04:54:48,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:54:48,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:54:48,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:54:48,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:54:48,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 04:54:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:48,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:54:48,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:54:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-12 04:54:48,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:54:48,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:54:48,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278918943] [2024-11-12 04:54:48,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278918943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:54:48,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:54:48,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:54:48,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808100151] [2024-11-12 04:54:48,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:54:48,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:54:48,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:54:48,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:54:48,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:54:48,700 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 04:54:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:54:48,726 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2024-11-12 04:54:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:54:48,728 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2024-11-12 04:54:48,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:54:48,734 INFO L225 Difference]: With dead ends: 93 [2024-11-12 04:54:48,734 INFO L226 Difference]: Without dead ends: 46 [2024-11-12 04:54:48,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:54:48,742 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:54:48,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:54:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-12 04:54:48,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-12 04:54:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:54:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-12 04:54:48,778 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 115 [2024-11-12 04:54:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:54:48,778 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-12 04:54:48,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 04:54:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-12 04:54:48,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 04:54:48,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:54:48,782 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:54:48,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 04:54:48,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:54:48,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:54:48,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:54:48,986 INFO L85 PathProgramCache]: Analyzing trace with hash 470655502, now seen corresponding path program 1 times [2024-11-12 04:54:48,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:54:48,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284517868] [2024-11-12 04:54:48,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:54:48,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:54:48,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:54:48,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:54:48,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 04:54:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:49,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 04:54:49,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:54:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 340 proven. 33 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-11-12 04:54:49,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:54:49,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:54:49,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284517868] [2024-11-12 04:54:49,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284517868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:54:49,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2077135719] [2024-11-12 04:54:49,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:54:49,907 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 04:54:49,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 04:54:49,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 04:54:49,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-12 04:54:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:50,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 04:54:50,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:54:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 340 proven. 33 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-11-12 04:54:51,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:54:51,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2077135719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:54:51,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:54:51,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-11-12 04:54:51,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223462955] [2024-11-12 04:54:51,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:54:51,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 04:54:51,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:54:51,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 04:54:51,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-12 04:54:51,176 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2024-11-12 04:54:56,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:54:58,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:55:01,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:55:04,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:55:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:55:04,393 INFO L93 Difference]: Finished difference Result 149 states and 207 transitions. [2024-11-12 04:55:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 04:55:04,445 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 116 [2024-11-12 04:55:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:55:04,447 INFO L225 Difference]: With dead ends: 149 [2024-11-12 04:55:04,448 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 04:55:04,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2024-11-12 04:55:04,454 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 60 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-12 04:55:04,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 218 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2024-11-12 04:55:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 04:55:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 50. [2024-11-12 04:55:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:55:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2024-11-12 04:55:04,477 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 116 [2024-11-12 04:55:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:55:04,478 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2024-11-12 04:55:04,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2024-11-12 04:55:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2024-11-12 04:55:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 04:55:04,482 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:55:04,482 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:55:04,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-12 04:55:04,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 04:55:04,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:55:04,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:55:04,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:55:04,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1304351860, now seen corresponding path program 1 times [2024-11-12 04:55:04,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:55:04,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272427694] [2024-11-12 04:55:04,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:55:04,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:55:04,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:55:04,889 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:55:04,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 04:55:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:55:05,097 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:55:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:55:05,285 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-12 04:55:05,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [220486185] [2024-11-12 04:55:05,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:55:05,287 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 04:55:05,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 04:55:05,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 04:55:05,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-12 04:55:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:55:05,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 04:55:05,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:55:17,026 WARN L286 SmtUtils]: Spent 7.68s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 04:55:41,624 WARN L286 SmtUtils]: Spent 7.41s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 04:55:49,751 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 04:55:57,280 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 513.0 2.0))) (.cse3 (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_6~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 129.0 8.0))))) (let ((.cse0 (fp.lt .cse2 .cse3)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (bvadd c_~var_1_4~0 (bvneg c_~var_1_5~0))))) (or (and .cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode .cse1 .cse2)) c_~var_1_3~0)) (and (not .cse0) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode .cse1 .cse3)) c_~var_1_3~0))))) (= c_~var_1_16~0 c_~var_1_17~0) (= c_~var_1_1~0 ((_ zero_extend 24) c_~last_1_var_1_7~0)) (bvsle ((_ zero_extend 24) c_~var_1_12~0) (_ bv127 32)) (bvsle ((_ zero_extend 24) c_~var_1_11~0) (_ bv127 32)) (bvsle ((_ zero_extend 24) c_~var_1_10~0) (_ bv127 32))) is different from false [2024-11-12 04:56:08,195 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)