./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.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 2ed1635dc6d8064ed19cc47260dbac48845189c1db702c0725e361d24a01f9fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:54:10,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:54:10,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:54:10,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:54:10,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:54:10,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:54:10,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:54:10,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:54:10,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:54:10,663 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:54:10,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:54:10,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:54:10,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:54:10,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:54:10,665 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:54:10,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:54:10,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:54:10,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:54:10,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:54:10,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:54:10,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:54:10,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:54:10,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:54:10,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:54:10,672 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:54:10,672 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:54:10,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:54:10,672 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:54:10,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:54:10,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:54:10,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:54:10,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:54:10,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:54:10,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:54:10,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:54:10,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:54:10,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:54:10,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:54:10,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:54:10,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:54:10,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:54:10,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:54:10,675 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 -> 2ed1635dc6d8064ed19cc47260dbac48845189c1db702c0725e361d24a01f9fc [2024-11-10 06:54:10,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:54:10,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:54:10,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:54:10,893 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:54:10,893 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:54:10,894 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-53.i [2024-11-10 06:54:12,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:54:12,610 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:54:12,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.i [2024-11-10 06:54:12,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce0262fb/60a3e557628643f0b5cf50a31fd6982a/FLAGc3bc0d5ff [2024-11-10 06:54:12,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce0262fb/60a3e557628643f0b5cf50a31fd6982a [2024-11-10 06:54:12,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:54:12,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:54:12,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:54:12,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:54:12,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:54:12,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4718aae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12, skipping insertion in model container [2024-11-10 06:54:12,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:54:12,805 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-53.i[916,929] [2024-11-10 06:54:12,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:54:12,868 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:54:12,877 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-53.i[916,929] [2024-11-10 06:54:12,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:54:12,970 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:54:12,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12 WrapperNode [2024-11-10 06:54:12,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:54:12,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:54:12,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:54:12,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:54:12,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:13,007 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-10 06:54:13,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:54:13,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:54:13,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:54:13,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:54:13,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:13,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:13,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:13,031 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:54:13,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:13,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:13,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:13,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:13,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:13,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:13,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:54:13,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:54:13,042 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:54:13,042 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:54:13,043 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:13,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:54:13,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:54:13,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:54:13,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:54:13,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:54:13,128 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:54:13,128 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:54:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:54:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:54:13,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:54:13,199 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:54:13,201 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:54:13,421 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 06:54:13,421 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:54:13,432 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:54:13,433 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:54:13,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:54:13 BoogieIcfgContainer [2024-11-10 06:54:13,434 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:54:13,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:54:13,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:54:13,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:54:13,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:54:12" (1/3) ... [2024-11-10 06:54:13,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c98c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:54:13, skipping insertion in model container [2024-11-10 06:54:13,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (2/3) ... [2024-11-10 06:54:13,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c98c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:54:13, skipping insertion in model container [2024-11-10 06:54:13,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:54:13" (3/3) ... [2024-11-10 06:54:13,444 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-53.i [2024-11-10 06:54:13,460 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:54:13,460 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:54:13,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:54:13,523 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;@1ddf04b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:54:13,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:54:13,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:54:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 06:54:13,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:54:13,536 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:54:13,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:54:13,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:54:13,541 INFO L85 PathProgramCache]: Analyzing trace with hash 8961443, now seen corresponding path program 1 times [2024-11-10 06:54:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:54:13,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810425196] [2024-11-10 06:54:13,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:54:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:54:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:54:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:54:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:54:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:54:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:54:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:54:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:54:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:54:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:54:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:54:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:54:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:54:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:54:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:54:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:54:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:54:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:54:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:54:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:54:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 06:54:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:54:13,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:54:13,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810425196] [2024-11-10 06:54:13,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810425196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:54:13,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:54:13,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:54:13,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166671681] [2024-11-10 06:54:13,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:54:13,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:54:13,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:54:13,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:54:13,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:54:13,893 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:54:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:54:13,926 INFO L93 Difference]: Finished difference Result 110 states and 187 transitions. [2024-11-10 06:54:13,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:54:13,929 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-10 06:54:13,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:54:13,936 INFO L225 Difference]: With dead ends: 110 [2024-11-10 06:54:13,937 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 06:54:13,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:54:13,943 INFO L432 NwaCegarLoop]: 79 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, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:54:13,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:54:13,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 06:54:13,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 06:54:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:54:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-10 06:54:13,984 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 125 [2024-11-10 06:54:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:54:13,984 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-10 06:54:13,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:54:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-10 06:54:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 06:54:13,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:54:13,988 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:54:13,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:54:13,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:54:13,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:54:13,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2117695069, now seen corresponding path program 1 times [2024-11-10 06:54:13,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:54:13,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034558587] [2024-11-10 06:54:13,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:54:13,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:54:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:14,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:54:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:14,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:54:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:14,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:54:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:14,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:54:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:54:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:54:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:54:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:54:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:54:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:54:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:54:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:54:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:54:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:54:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:54:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:54:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:54:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:54:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:54:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 06:54:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 105 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-11-10 06:54:15,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:54:15,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034558587] [2024-11-10 06:54:15,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034558587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:54:15,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208825457] [2024-11-10 06:54:15,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:54:15,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:54:15,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:54:15,104 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-10 06:54:15,109 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-10 06:54:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:15,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 06:54:15,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:54:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 210 proven. 171 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-10 06:54:16,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:54:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 174 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-10 06:54:17,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208825457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:54:17,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:54:17,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 15] total 31 [2024-11-10 06:54:17,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332363674] [2024-11-10 06:54:17,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:54:17,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-10 06:54:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:54:17,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 06:54:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=642, Unknown=0, NotChecked=0, Total=930 [2024-11-10 06:54:17,257 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 31 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 28 states have internal predecessors, (88), 9 states have call successors, (58), 5 states have call predecessors, (58), 12 states have return successors, (59), 8 states have call predecessors, (59), 9 states have call successors, (59) [2024-11-10 06:54:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:54:17,713 INFO L93 Difference]: Finished difference Result 125 states and 171 transitions. [2024-11-10 06:54:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 06:54:17,714 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 28 states have internal predecessors, (88), 9 states have call successors, (58), 5 states have call predecessors, (58), 12 states have return successors, (59), 8 states have call predecessors, (59), 9 states have call successors, (59) Word has length 125 [2024-11-10 06:54:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:54:17,716 INFO L225 Difference]: With dead ends: 125 [2024-11-10 06:54:17,716 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 06:54:17,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=412, Invalid=848, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 06:54:17,718 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 174 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:54:17,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 247 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:54:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 06:54:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2024-11-10 06:54:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:54:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2024-11-10 06:54:17,743 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 125 [2024-11-10 06:54:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:54:17,745 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2024-11-10 06:54:17,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 28 states have internal predecessors, (88), 9 states have call successors, (58), 5 states have call predecessors, (58), 12 states have return successors, (59), 8 states have call predecessors, (59), 9 states have call successors, (59) [2024-11-10 06:54:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2024-11-10 06:54:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 06:54:17,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:54:17,747 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:54:17,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 06:54:17,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:54:17,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:54:17,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:54:17,949 INFO L85 PathProgramCache]: Analyzing trace with hash -162851489, now seen corresponding path program 1 times [2024-11-10 06:54:17,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:54:17,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468172934] [2024-11-10 06:54:17,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:54:17,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:54:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:54:18,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:54:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:54:18,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:54:18,070 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:54:18,072 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:54:18,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:54:18,077 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 06:54:18,156 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:54:18,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:54:18 BoogieIcfgContainer [2024-11-10 06:54:18,161 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:54:18,162 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:54:18,162 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:54:18,162 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:54:18,162 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:54:13" (3/4) ... [2024-11-10 06:54:18,164 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:54:18,165 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:54:18,166 INFO L158 Benchmark]: Toolchain (without parser) took 5533.44ms. Allocated memory was 199.2MB in the beginning and 272.6MB in the end (delta: 73.4MB). Free memory was 130.2MB in the beginning and 127.5MB in the end (delta: 2.7MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. [2024-11-10 06:54:18,166 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:54:18,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.48ms. Allocated memory is still 199.2MB. Free memory was 130.0MB in the beginning and 169.4MB in the end (delta: -39.4MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-11-10 06:54:18,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.92ms. Allocated memory is still 199.2MB. Free memory was 169.4MB in the beginning and 166.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:54:18,169 INFO L158 Benchmark]: Boogie Preprocessor took 33.35ms. Allocated memory is still 199.2MB. Free memory was 166.8MB in the beginning and 163.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:54:18,169 INFO L158 Benchmark]: IcfgBuilder took 391.76ms. Allocated memory is still 199.2MB. Free memory was 163.2MB in the beginning and 145.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 06:54:18,169 INFO L158 Benchmark]: TraceAbstraction took 4724.55ms. Allocated memory was 199.2MB in the beginning and 272.6MB in the end (delta: 73.4MB). Free memory was 144.3MB in the beginning and 127.5MB in the end (delta: 16.8MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2024-11-10 06:54:18,169 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 272.6MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:54:18,170 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.48ms. Allocated memory is still 199.2MB. Free memory was 130.0MB in the beginning and 169.4MB in the end (delta: -39.4MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.92ms. Allocated memory is still 199.2MB. Free memory was 169.4MB in the beginning and 166.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.35ms. Allocated memory is still 199.2MB. Free memory was 166.8MB in the beginning and 163.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 391.76ms. Allocated memory is still 199.2MB. Free memory was 163.2MB in the beginning and 145.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4724.55ms. Allocated memory was 199.2MB in the beginning and 272.6MB in the end (delta: 73.4MB). Free memory was 144.3MB in the beginning and 127.5MB in the end (delta: 16.8MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 272.6MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_3 = 1456677701; [L24] unsigned long int var_1_4 = 1000000000; [L25] unsigned long int var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 0; [L29] signed long int var_1_9 = 256; [L30] signed long int var_1_10 = 8; [L31] unsigned char var_1_11 = 1; [L32] unsigned short int var_1_12 = 16; [L33] unsigned long int var_1_13 = 3110219175; [L34] unsigned short int var_1_14 = 128; [L35] unsigned char var_1_15 = 1; [L36] unsigned char var_1_16 = 0; VAL [isInitial=0, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L68] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L69] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L69] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L70] var_1_4 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L71] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L72] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L72] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L73] var_1_5 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L74] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L75] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L75] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L76] var_1_7 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=256] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=256] [L78] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L78] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L79] var_1_9 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L80] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L81] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L81] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L83] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L84] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L85] var_1_11 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L86] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L87] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L88] var_1_13 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L89] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L90] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L91] var_1_14 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L92] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L94] var_1_16 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L95] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L96] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L109] RET updateVariables() [L110] CALL step() [L40] var_1_6 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L41] COND TRUE var_1_5 <= (var_1_13 - var_1_4) [L42] var_1_12 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L44] COND TRUE (var_1_9 * 16.5f) > var_1_10 [L45] var_1_15 = (! var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L49] var_1_1 = (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))) [L50] signed long int stepLocal_1 = (((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)); [L51] unsigned long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=-3221225472, stepLocal_1=65534, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=131069, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L52] COND TRUE stepLocal_1 != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))) VAL [isInitial=1, stepLocal_0=-3221225472, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=131069, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L53] COND FALSE !(var_1_9 == var_1_10) VAL [isInitial=1, stepLocal_0=-3221225472, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=131069, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return ((((var_1_1 == ((unsigned long int) (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))))) && (var_1_6 == ((unsigned char) var_1_7))) && ((((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12))) != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) ? ((var_1_9 == var_1_10) ? (var_1_6 ? ((var_1_3 >= var_1_12) ? (var_1_8 == ((unsigned char) (var_1_7 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_7))) : 1) : 1) : (var_1_8 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_13 - var_1_4)) ? (var_1_12 == ((unsigned short int) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))) : 1)) && (((var_1_9 * 16.5f) > var_1_10) ? (var_1_15 == ((unsigned char) (! var_1_11))) : (var_1_15 == ((unsigned char) (var_1_11 && var_1_16)))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=131069, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=131069, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=13835058057429647359U, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=131069, var_1_3=-3221225472, var_1_4=-3221225473, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 326 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 428 IncrementalHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 135 mSDtfsCounter, 428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 501 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 496 ConstructedInterpolants, 0 QuantifiedInterpolants, 3017 SizeOfPredicates, 8 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2590/3040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 06:54:18,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.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 2ed1635dc6d8064ed19cc47260dbac48845189c1db702c0725e361d24a01f9fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:54:20,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:54:20,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:54:20,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:54:20,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:54:20,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:54:20,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:54:20,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:54:20,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:54:20,655 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:54:20,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:54:20,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:54:20,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:54:20,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:54:20,657 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:54:20,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:54:20,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:54:20,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:54:20,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:54:20,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:54:20,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:54:20,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:54:20,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:54:20,660 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:54:20,661 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:54:20,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:54:20,661 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:54:20,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:54:20,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:54:20,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:54:20,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:54:20,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:54:20,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:54:20,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:54:20,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:54:20,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:54:20,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:54:20,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:54:20,664 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:54:20,664 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:54:20,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:54:20,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:54:20,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:54:20,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:54:20,666 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 -> 2ed1635dc6d8064ed19cc47260dbac48845189c1db702c0725e361d24a01f9fc [2024-11-10 06:54:20,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:54:20,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:54:20,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:54:20,977 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:54:20,977 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:54:20,980 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-53.i [2024-11-10 06:54:22,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:54:22,829 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:54:22,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.i [2024-11-10 06:54:22,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac809ad70/6f7154b7493141cc9b4f1f90fbf7b26e/FLAG242d95f8a [2024-11-10 06:54:22,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac809ad70/6f7154b7493141cc9b4f1f90fbf7b26e [2024-11-10 06:54:22,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:54:22,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:54:22,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:54:22,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:54:22,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:54:22,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:54:22" (1/1) ... [2024-11-10 06:54:22,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78410bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:22, skipping insertion in model container [2024-11-10 06:54:22,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:54:22" (1/1) ... [2024-11-10 06:54:22,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:54:23,038 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-53.i[916,929] [2024-11-10 06:54:23,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:54:23,104 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:54:23,116 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-53.i[916,929] [2024-11-10 06:54:23,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:54:23,172 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:54:23,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23 WrapperNode [2024-11-10 06:54:23,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:54:23,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:54:23,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:54:23,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:54:23,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23" (1/1) ... [2024-11-10 06:54:23,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23" (1/1) ... [2024-11-10 06:54:23,221 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-10 06:54:23,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:54:23,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:54:23,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:54:23,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:54:23,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23" (1/1) ... [2024-11-10 06:54:23,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23" (1/1) ... [2024-11-10 06:54:23,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23" (1/1) ... [2024-11-10 06:54:23,263 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:54:23,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23" (1/1) ... [2024-11-10 06:54:23,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23" (1/1) ... [2024-11-10 06:54:23,273 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23" (1/1) ... [2024-11-10 06:54:23,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23" (1/1) ... [2024-11-10 06:54:23,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23" (1/1) ... [2024-11-10 06:54:23,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23" (1/1) ... [2024-11-10 06:54:23,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:54:23,288 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:54:23,289 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:54:23,289 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:54:23,289 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23" (1/1) ... [2024-11-10 06:54:23,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:54:23,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:54:23,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:54:23,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:54:23,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:54:23,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:54:23,373 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:54:23,373 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:54:23,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:54:23,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:54:23,438 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:54:23,440 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:54:26,086 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 06:54:26,086 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:54:26,097 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:54:26,097 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:54:26,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:54:26 BoogieIcfgContainer [2024-11-10 06:54:26,098 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:54:26,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:54:26,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:54:26,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:54:26,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:54:22" (1/3) ... [2024-11-10 06:54:26,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b80e7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:54:26, skipping insertion in model container [2024-11-10 06:54:26,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:23" (2/3) ... [2024-11-10 06:54:26,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b80e7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:54:26, skipping insertion in model container [2024-11-10 06:54:26,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:54:26" (3/3) ... [2024-11-10 06:54:26,108 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-53.i [2024-11-10 06:54:26,132 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:54:26,133 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:54:26,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:54:26,197 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;@57f8c330, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:54:26,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:54:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:54:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 06:54:26,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:54:26,215 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:54:26,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:54:26,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:54:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash 8961443, now seen corresponding path program 1 times [2024-11-10 06:54:26,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:54:26,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683843640] [2024-11-10 06:54:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:54:26,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:54:26,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:54:26,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:54:26,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 06:54:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:26,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:54:26,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:54:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-10 06:54:26,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:54:26,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:54:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683843640] [2024-11-10 06:54:26,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683843640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:54:26,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:54:26,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:54:26,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973952100] [2024-11-10 06:54:26,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:54:26,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:54:26,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:54:26,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:54:26,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:54:26,511 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:54:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:54:26,533 INFO L93 Difference]: Finished difference Result 110 states and 187 transitions. [2024-11-10 06:54:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:54:26,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-10 06:54:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:54:26,542 INFO L225 Difference]: With dead ends: 110 [2024-11-10 06:54:26,542 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 06:54:26,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:54:26,548 INFO L432 NwaCegarLoop]: 79 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, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:54:26,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:54:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 06:54:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 06:54:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:54:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-10 06:54:26,583 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 125 [2024-11-10 06:54:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:54:26,583 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-10 06:54:26,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:54:26,584 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-10 06:54:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 06:54:26,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:54:26,586 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:54:26,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 06:54:26,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:54:26,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:54:26,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:54:26,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2117695069, now seen corresponding path program 1 times [2024-11-10 06:54:26,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:54:26,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644129828] [2024-11-10 06:54:26,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:54:26,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:54:26,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:54:26,798 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:54:26,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 06:54:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:26,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 06:54:26,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:54:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 88 proven. 192 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 06:54:28,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:54:28,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:54:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644129828] [2024-11-10 06:54:28,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644129828] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:54:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [724442522] [2024-11-10 06:54:28,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:54:28,486 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 06:54:28,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 06:54:28,491 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-10 06:54:28,492 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-10 06:54:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:28,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 06:54:28,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:55:38,288 WARN L286 SmtUtils]: Spent 7.78s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)