./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-43.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_codestructure_dependencies_file-43.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 0c17c914e863ecde37b0d9eebaa4b759e86beaa02deb4bbf5ca1b0e732d82914 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:09:06,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:09:06,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:09:06,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:09:06,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:09:06,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:09:06,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:09:06,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:09:06,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:09:06,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:09:06,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:09:06,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:09:06,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:09:06,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:09:06,818 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:09:06,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:09:06,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:09:06,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:09:06,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:09:06,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:09:06,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:09:06,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:09:06,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:09:06,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:09:06,829 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:09:06,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:09:06,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:09:06,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:09:06,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:09:06,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:09:06,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:09:06,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:09:06,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:09:06,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:09:06,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:09:06,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:09:06,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:09:06,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:09:06,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:09:06,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:09:06,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:09:06,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:09:06,833 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 -> 0c17c914e863ecde37b0d9eebaa4b759e86beaa02deb4bbf5ca1b0e732d82914 [2024-11-10 03:09:07,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:09:07,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:09:07,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:09:07,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:09:07,064 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:09:07,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-43.i [2024-11-10 03:09:08,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:09:08,612 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:09:08,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-43.i [2024-11-10 03:09:08,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/784c68105/ad5fcf70e35943789d04507f6708e411/FLAG29ddfe081 [2024-11-10 03:09:09,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/784c68105/ad5fcf70e35943789d04507f6708e411 [2024-11-10 03:09:09,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:09:09,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:09:09,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:09:09,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:09:09,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:09:09,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d5dd53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09, skipping insertion in model container [2024-11-10 03:09:09,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:09:09,182 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_codestructure_dependencies_file-43.i[919,932] [2024-11-10 03:09:09,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:09:09,256 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:09:09,265 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_codestructure_dependencies_file-43.i[919,932] [2024-11-10 03:09:09,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:09:09,311 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:09:09,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09 WrapperNode [2024-11-10 03:09:09,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:09:09,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:09:09,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:09:09,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:09:09,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,388 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-10 03:09:09,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:09:09,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:09:09,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:09:09,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:09:09,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,415 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 03:09:09,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,421 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:09:09,427 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:09:09,427 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:09:09,427 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:09:09,429 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09" (1/1) ... [2024-11-10 03:09:09,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:09:09,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:09:09,475 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 03:09:09,477 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 03:09:09,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:09:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:09:09,515 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:09:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:09:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:09:09,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:09:09,589 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:09:09,590 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:09:09,837 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L135: havoc property_#t~bitwise20#1;havoc property_#t~short21#1; [2024-11-10 03:09:09,873 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 03:09:09,873 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:09:09,898 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:09:09,898 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:09:09,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:09:09 BoogieIcfgContainer [2024-11-10 03:09:09,899 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:09:09,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:09:09,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:09:09,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:09:09,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:09:09" (1/3) ... [2024-11-10 03:09:09,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf9df7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:09:09, skipping insertion in model container [2024-11-10 03:09:09,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:09" (2/3) ... [2024-11-10 03:09:09,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf9df7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:09:09, skipping insertion in model container [2024-11-10 03:09:09,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:09:09" (3/3) ... [2024-11-10 03:09:09,907 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-43.i [2024-11-10 03:09:09,920 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:09:09,921 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:09:09,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:09:09,981 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;@9141a0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:09:09,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:09:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:09:09,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 03:09:10,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:09:10,001 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:09:10,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:09:10,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:09:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2108709322, now seen corresponding path program 1 times [2024-11-10 03:09:10,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:09:10,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707192071] [2024-11-10 03:09:10,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:09:10,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:09:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:09:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:09:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 03:09:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:09:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:09:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 03:09:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 03:09:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 03:09:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 03:09:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:09:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:09:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 03:09:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 03:09:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 03:09:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 03:09:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 03:09:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 03:09:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:09:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:09:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:09:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 03:09:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:09:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 03:09:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 03:09:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 03:09:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 03:09:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:09:10,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:09:10,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707192071] [2024-11-10 03:09:10,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707192071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:09:10,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:09:10,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:09:10,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617433388] [2024-11-10 03:09:10,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:09:10,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:09:10,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:09:10,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:09:10,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:09:10,398 INFO L87 Difference]: Start difference. First operand has 81 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:09:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:09:10,425 INFO L93 Difference]: Finished difference Result 154 states and 265 transitions. [2024-11-10 03:09:10,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:09:10,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2024-11-10 03:09:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:09:10,435 INFO L225 Difference]: With dead ends: 154 [2024-11-10 03:09:10,436 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 03:09:10,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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 03:09:10,441 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:09:10,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:09:10,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 03:09:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-10 03:09:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:09:10,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2024-11-10 03:09:10,515 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 166 [2024-11-10 03:09:10,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:09:10,516 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2024-11-10 03:09:10,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:09:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2024-11-10 03:09:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 03:09:10,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:09:10,519 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:09:10,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:09:10,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:09:10,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:09:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1318596458, now seen corresponding path program 1 times [2024-11-10 03:09:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:09:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285360311] [2024-11-10 03:09:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:09:10,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:09:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:09:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:09:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 03:09:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:09:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:09:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 03:09:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 03:09:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 03:09:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 03:09:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:09:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:09:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 03:09:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 03:09:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 03:09:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 03:09:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 03:09:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 03:09:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:09:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:09:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:09:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 03:09:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:09:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 03:09:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 03:09:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 03:09:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 03:09:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:09:10,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:09:10,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285360311] [2024-11-10 03:09:10,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285360311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:09:10,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:09:10,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:09:10,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109165814] [2024-11-10 03:09:10,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:09:10,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:09:10,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:09:10,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:09:10,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:09:10,847 INFO L87 Difference]: Start difference. First operand 76 states and 115 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:09:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:09:10,872 INFO L93 Difference]: Finished difference Result 150 states and 229 transitions. [2024-11-10 03:09:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:09:10,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-11-10 03:09:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:09:10,877 INFO L225 Difference]: With dead ends: 150 [2024-11-10 03:09:10,877 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 03:09:10,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:09:10,879 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:09:10,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:09:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 03:09:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-10 03:09:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:09:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2024-11-10 03:09:10,894 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 166 [2024-11-10 03:09:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:09:10,896 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2024-11-10 03:09:10,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:09:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2024-11-10 03:09:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 03:09:10,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:09:10,899 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:09:10,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:09:10,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:09:10,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:09:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash 424213877, now seen corresponding path program 1 times [2024-11-10 03:09:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:09:10,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651424665] [2024-11-10 03:09:10,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:09:10,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:09:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:09:11,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:09:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:09:11,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:09:11,224 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:09:11,225 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:09:11,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:09:11,229 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 03:09:11,316 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:09:11,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:09:11 BoogieIcfgContainer [2024-11-10 03:09:11,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:09:11,319 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:09:11,319 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:09:11,323 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:09:11,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:09:09" (3/4) ... [2024-11-10 03:09:11,326 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:09:11,327 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:09:11,327 INFO L158 Benchmark]: Toolchain (without parser) took 2316.93ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 80.4MB in the beginning and 138.5MB in the end (delta: -58.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:09:11,328 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 151.0MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:09:11,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.42ms. Allocated memory is still 151.0MB. Free memory was 80.1MB in the beginning and 64.4MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 03:09:11,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.09ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 64.2MB in the beginning and 164.1MB in the end (delta: -99.9MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-11-10 03:09:11,329 INFO L158 Benchmark]: Boogie Preprocessor took 37.56ms. Allocated memory is still 192.9MB. Free memory was 164.1MB in the beginning and 161.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 03:09:11,329 INFO L158 Benchmark]: IcfgBuilder took 472.13ms. Allocated memory is still 192.9MB. Free memory was 159.9MB in the beginning and 136.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 03:09:11,329 INFO L158 Benchmark]: TraceAbstraction took 1417.98ms. Allocated memory is still 192.9MB. Free memory was 136.9MB in the beginning and 138.5MB in the end (delta: -1.6MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2024-11-10 03:09:11,330 INFO L158 Benchmark]: Witness Printer took 7.62ms. Allocated memory is still 192.9MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:09:11,331 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.21ms. Allocated memory is still 151.0MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.42ms. Allocated memory is still 151.0MB. Free memory was 80.1MB in the beginning and 64.4MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.09ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 64.2MB in the beginning and 164.1MB in the end (delta: -99.9MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.56ms. Allocated memory is still 192.9MB. Free memory was 164.1MB in the beginning and 161.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 472.13ms. Allocated memory is still 192.9MB. Free memory was 159.9MB in the beginning and 136.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1417.98ms. Allocated memory is still 192.9MB. Free memory was 136.9MB in the beginning and 138.5MB in the end (delta: -1.6MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Witness Printer took 7.62ms. Allocated memory is still 192.9MB. Free memory is still 138.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 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 1000.6; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 10.4; [L25] float var_1_4 = 31.4; [L26] double var_1_5 = 7.75; [L27] double var_1_6 = 63.1; [L28] signed char var_1_7 = 32; [L29] signed char var_1_10 = 64; [L30] signed short int var_1_11 = 5; [L31] unsigned short int var_1_12 = 4; [L32] unsigned char var_1_13 = 1; [L33] unsigned short int var_1_14 = 49632; [L34] unsigned short int var_1_15 = 0; [L35] signed char var_1_16 = 50; [L36] signed char var_1_18 = 2; [L37] signed char var_1_19 = 25; [L38] signed char var_1_20 = 10; [L39] signed char var_1_21 = 1; [L40] signed char var_1_22 = 8; [L41] unsigned long int var_1_23 = 25; [L42] unsigned short int var_1_24 = 32; [L43] signed long int var_1_26 = 50; [L44] signed char last_1_var_1_7 = 32; [L45] signed short int last_1_var_1_11 = 5; [L46] signed long int last_1_var_1_26 = 50; VAL [isInitial=0, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_2=10227/40, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] CALL updateLastVariables() [L130] last_1_var_1_7 = var_1_7 [L131] last_1_var_1_11 = var_1_11 [L132] last_1_var_1_26 = var_1_26 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_2=10227/40, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L142] RET updateLastVariables() [L143] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L88] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L89] var_1_3 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L90] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L91] var_1_4 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L92] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L93] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L93] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L94] var_1_5 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_6=631/10, var_1_7=32] [L95] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_6=631/10, var_1_7=32] [L96] var_1_6 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L97] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L98] var_1_10 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L99] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L100] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L100] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L101] var_1_13 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L102] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L103] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L103] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L104] var_1_14 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L105] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L106] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L106] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L107] var_1_15 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L108] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L109] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L109] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L110] var_1_18 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L111] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L112] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L112] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L113] var_1_19 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L114] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L115] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L115] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L116] var_1_20 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L117] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L118] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L118] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L119] var_1_21 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L120] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L121] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L121] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L122] var_1_22 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L123] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L124] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L124] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L125] var_1_24 = __VERIFIER_nondet_ushort() [L126] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_26=50, var_1_7=32] [L126] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_26=50, var_1_7=32] [L127] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=32639, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=32639, var_1_26=50, var_1_7=32] [L127] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=32639, var_1_26=50, var_1_7=32] [L143] RET updateVariables() [L144] CALL step() [L50] COND FALSE !((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) [L53] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=49637, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=32639, var_1_26=50, var_1_5=49637, var_1_7=32] [L55] COND TRUE var_1_1 > var_1_4 [L56] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=-127, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=49637, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=32639, var_1_26=50, var_1_5=49637, var_1_7=32] [L60] COND TRUE \read(var_1_13) [L61] var_1_12 = (var_1_14 - var_1_15) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=-127, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-63, var_1_1=49637, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=32639, var_1_26=50, var_1_5=49637, var_1_7=32] [L63] COND TRUE var_1_1 <= (((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))) + var_1_1) [L64] var_1_16 = ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=-127, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-127, var_1_18=63, var_1_19=-63, var_1_1=49637, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=32639, var_1_26=50, var_1_5=49637, var_1_7=32] [L72] COND TRUE (- (var_1_14 - var_1_24)) < var_1_10 [L73] var_1_23 = (var_1_24 + (var_1_22 + 4u)) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=-127, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-127, var_1_18=63, var_1_19=-63, var_1_1=49637, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=32769, var_1_24=32639, var_1_26=50, var_1_5=49637, var_1_7=32] [L77] COND FALSE !(var_1_6 != 49.125) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=-127, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-127, var_1_18=63, var_1_19=-63, var_1_1=49637, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=32769, var_1_24=32639, var_1_26=50, var_1_5=49637, var_1_7=32] [L82] EXPR var_1_12 & last_1_var_1_7 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=-127, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-127, var_1_18=63, var_1_19=-63, var_1_1=49637, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=32769, var_1_24=32639, var_1_26=50, var_1_5=49637, var_1_7=32] [L82] COND FALSE !(-4 > (var_1_12 & last_1_var_1_7)) [L144] RET step() [L145] CALL, EXPR property() [L135] EXPR (((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_12 & last_1_var_1_7)) ? (var_1_7 == ((signed char) var_1_10)) : 1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=-127, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-127, var_1_18=63, var_1_19=-63, var_1_1=49637, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=32769, var_1_24=32639, var_1_26=50, var_1_5=49637, var_1_7=32] [L135-L136] return ((((((((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_12 & last_1_var_1_7)) ? (var_1_7 == ((signed char) var_1_10)) : 1)) && ((var_1_1 > var_1_4) ? (var_1_11 == ((signed short int) var_1_10)) : (var_1_11 == ((signed short int) ((((last_1_var_1_11) < (((16 - 32) + (64 + var_1_10)))) ? (last_1_var_1_11) : (((16 - 32) + (64 + var_1_10))))))))) && (var_1_13 ? (var_1_12 == ((unsigned short int) (var_1_14 - var_1_15))) : 1)) && ((var_1_1 <= (((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))) + var_1_1)) ? (var_1_16 == ((signed char) ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))))) : ((var_1_19 < var_1_20) ? (var_1_16 == ((signed char) (var_1_21 - var_1_22))) : (var_1_16 == ((signed char) var_1_10))))) && (((- (var_1_14 - var_1_24)) < var_1_10) ? (var_1_23 == ((unsigned long int) (var_1_24 + (var_1_22 + 4u)))) : (var_1_23 == ((unsigned long int) ((((var_1_14) < (var_1_12)) ? (var_1_14) : (var_1_12))))))) && ((var_1_6 != 49.125) ? ((((((64u) < 0 ) ? -(64u) : (64u))) < last_1_var_1_26) ? (var_1_26 == ((signed long int) var_1_15)) : 1) : 1) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=-127, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-127, var_1_18=63, var_1_19=-63, var_1_1=49637, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=32769, var_1_24=32639, var_1_26=50, var_1_5=49637, var_1_7=32] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-127, var_1_11=-127, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-127, var_1_18=63, var_1_19=-63, var_1_1=49637, var_1_20=63, var_1_21=125, var_1_22=126, var_1_23=32769, var_1_24=32639, var_1_26=50, var_1_5=49637, var_1_7=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 332 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 225 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2600/2600 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 03:09:11,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-43.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 0c17c914e863ecde37b0d9eebaa4b759e86beaa02deb4bbf5ca1b0e732d82914 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:09:13,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:09:13,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:09:13,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:09:13,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:09:13,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:09:13,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:09:13,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:09:13,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:09:13,484 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:09:13,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:09:13,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:09:13,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:09:13,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:09:13,485 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:09:13,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:09:13,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:09:13,486 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:09:13,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:09:13,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:09:13,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:09:13,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:09:13,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:09:13,489 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:09:13,489 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:09:13,489 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:09:13,490 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:09:13,490 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:09:13,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:09:13,490 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:09:13,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:09:13,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:09:13,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:09:13,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:09:13,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:09:13,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:09:13,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:09:13,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:09:13,492 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:09:13,492 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:09:13,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:09:13,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:09:13,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:09:13,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:09:13,493 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 -> 0c17c914e863ecde37b0d9eebaa4b759e86beaa02deb4bbf5ca1b0e732d82914 [2024-11-10 03:09:13,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:09:13,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:09:13,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:09:13,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:09:13,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:09:13,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-43.i [2024-11-10 03:09:15,180 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:09:15,398 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:09:15,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-43.i [2024-11-10 03:09:15,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e24302ebc/332335afa47b435ba03b72b76c9e863e/FLAG0a80e6e4c [2024-11-10 03:09:15,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e24302ebc/332335afa47b435ba03b72b76c9e863e [2024-11-10 03:09:15,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:09:15,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:09:15,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:09:15,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:09:15,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:09:15,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681b89d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15, skipping insertion in model container [2024-11-10 03:09:15,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:09:15,602 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_codestructure_dependencies_file-43.i[919,932] [2024-11-10 03:09:15,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:09:15,654 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:09:15,663 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_codestructure_dependencies_file-43.i[919,932] [2024-11-10 03:09:15,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:09:15,733 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:09:15,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15 WrapperNode [2024-11-10 03:09:15,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:09:15,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:09:15,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:09:15,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:09:15,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,794 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-10 03:09:15,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:09:15,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:09:15,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:09:15,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:09:15,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,828 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 03:09:15,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:09:15,856 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:09:15,856 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:09:15,856 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:09:15,857 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15" (1/1) ... [2024-11-10 03:09:15,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:09:15,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:09:15,894 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 03:09:15,904 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 03:09:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:09:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:09:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:09:15,943 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:09:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:09:15,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:09:16,030 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:09:16,032 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:09:26,837 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:09:26,837 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:09:26,854 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:09:26,855 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:09:26,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:09:26 BoogieIcfgContainer [2024-11-10 03:09:26,855 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:09:26,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:09:26,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:09:26,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:09:26,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:09:15" (1/3) ... [2024-11-10 03:09:26,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641a3ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:09:26, skipping insertion in model container [2024-11-10 03:09:26,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:15" (2/3) ... [2024-11-10 03:09:26,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641a3ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:09:26, skipping insertion in model container [2024-11-10 03:09:26,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:09:26" (3/3) ... [2024-11-10 03:09:26,865 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-43.i [2024-11-10 03:09:26,889 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:09:26,890 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:09:26,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:09:26,952 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;@3899dc31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:09:26,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:09:26,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:09:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 03:09:26,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:09:26,966 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:09:26,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:09:26,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:09:26,971 INFO L85 PathProgramCache]: Analyzing trace with hash -777069532, now seen corresponding path program 1 times [2024-11-10 03:09:26,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:09:26,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532712425] [2024-11-10 03:09:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:09:26,982 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 03:09:26,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:09:26,989 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 03:09:26,994 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 03:09:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:27,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:09:27,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:09:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-10 03:09:27,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:09:27,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:09:27,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532712425] [2024-11-10 03:09:27,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532712425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:09:27,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:09:27,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:09:27,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51506137] [2024-11-10 03:09:27,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:09:27,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:09:27,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:09:27,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:09:27,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:09:27,454 INFO L87 Difference]: Start difference. First operand has 72 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:09:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:09:27,474 INFO L93 Difference]: Finished difference Result 136 states and 237 transitions. [2024-11-10 03:09:27,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:09:27,476 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2024-11-10 03:09:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:09:27,482 INFO L225 Difference]: With dead ends: 136 [2024-11-10 03:09:27,482 INFO L226 Difference]: Without dead ends: 67 [2024-11-10 03:09:27,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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 03:09:27,487 INFO L432 NwaCegarLoop]: 100 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, 100 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 03:09:27,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:09:27,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-10 03:09:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-10 03:09:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:09:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2024-11-10 03:09:27,549 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 163 [2024-11-10 03:09:27,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:09:27,549 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2024-11-10 03:09:27,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:09:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2024-11-10 03:09:27,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 03:09:27,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:09:27,556 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:09:27,569 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 03:09:27,759 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 03:09:27,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:09:27,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:09:27,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1768072803, now seen corresponding path program 1 times [2024-11-10 03:09:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:09:27,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924559090] [2024-11-10 03:09:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:09:27,762 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 03:09:27,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:09:27,765 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 03:09:27,766 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 03:09:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:09:28,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 03:09:28,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:09:45,458 WARN L286 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 03:10:13,111 WARN L286 SmtUtils]: Spent 17.46s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 03:10:25,587 WARN L286 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 03:10:33,719 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 03:10:39,893 WARN L286 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 03:10:47,168 WARN L286 SmtUtils]: Spent 7.27s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 03:10:52,761 WARN L286 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)