./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.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 1f9a5c686ad01cfcc91f09109693d5ac5bccd775344ac75524882bf1ef1e7afb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:56:32,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:56:32,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 23:56:32,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:56:32,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:56:32,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:56:32,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:56:32,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:56:32,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:56:32,622 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:56:32,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:56:32,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:56:32,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:56:32,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:56:32,625 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:56:32,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:56:32,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:56:32,626 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:56:32,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:56:32,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:56:32,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:56:32,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:56:32,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:56:32,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:56:32,629 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:56:32,629 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:56:32,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:56:32,630 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:56:32,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:56:32,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:56:32,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:56:32,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:56:32,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:56:32,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:56:32,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:56:32,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:56:32,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:56:32,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:56:32,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:56:32,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:56:32,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:56:32,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:56:32,633 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 -> 1f9a5c686ad01cfcc91f09109693d5ac5bccd775344ac75524882bf1ef1e7afb [2024-10-12 23:56:32,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:56:32,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:56:32,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:56:32,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:56:32,858 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:56:32,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i [2024-10-12 23:56:34,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:56:34,223 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:56:34,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i [2024-10-12 23:56:34,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2ba2c6f/f60b4b0de6c741cb925029250ddf84c9/FLAGc7d755469 [2024-10-12 23:56:34,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2ba2c6f/f60b4b0de6c741cb925029250ddf84c9 [2024-10-12 23:56:34,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:56:34,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:56:34,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:56:34,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:56:34,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:56:34,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:34,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad963b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34, skipping insertion in model container [2024-10-12 23:56:34,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:34,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:56:34,774 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i[919,932] [2024-10-12 23:56:34,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:56:34,823 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:56:34,832 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i[919,932] [2024-10-12 23:56:34,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:56:34,875 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:56:34,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34 WrapperNode [2024-10-12 23:56:34,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:56:34,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:56:34,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:56:34,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:56:34,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:34,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:34,927 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-10-12 23:56:34,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:56:34,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:56:34,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:56:34,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:56:34,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:34,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:34,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:34,967 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:56:34,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:34,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:34,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:34,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:34,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:34,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:34,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:56:34,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:56:34,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:56:34,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:56:34,997 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34" (1/1) ... [2024-10-12 23:56:35,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:56:35,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:56:35,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:56:35,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:56:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:56:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:56:35,063 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:56:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:56:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:56:35,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:56:35,140 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:56:35,142 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:56:35,443 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-12 23:56:35,443 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:56:35,473 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:56:35,475 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:56:35,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:56:35 BoogieIcfgContainer [2024-10-12 23:56:35,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:56:35,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:56:35,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:56:35,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:56:35,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:56:34" (1/3) ... [2024-10-12 23:56:35,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffb277a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:56:35, skipping insertion in model container [2024-10-12 23:56:35,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:34" (2/3) ... [2024-10-12 23:56:35,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffb277a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:56:35, skipping insertion in model container [2024-10-12 23:56:35,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:56:35" (3/3) ... [2024-10-12 23:56:35,483 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-99.i [2024-10-12 23:56:35,495 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:56:35,495 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:56:35,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:56:35,575 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;@65373508, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:56:35,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:56:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 48 states have (on average 1.4375) internal successors, (69), 49 states have internal predecessors, (69), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 23:56:35,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-12 23:56:35,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:56:35,589 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:56:35,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:56:35,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:56:35,593 INFO L85 PathProgramCache]: Analyzing trace with hash 792453830, now seen corresponding path program 1 times [2024-10-12 23:56:35,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:56:35,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960634160] [2024-10-12 23:56:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:56:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:56:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:56:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:56:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:56:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:56:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:56:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:56:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:56:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:56:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:56:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:56:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 23:56:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:56:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 23:56:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:56:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 23:56:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 23:56:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 23:56:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 23:56:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 23:56:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 23:56:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 23:56:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 23:56:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-12 23:56:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 23:56:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-12 23:56:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 23:56:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 23:56:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 23:56:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 23:56:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-12 23:56:35,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:56:35,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960634160] [2024-10-12 23:56:35,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960634160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:56:35,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:56:35,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:56:35,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318248092] [2024-10-12 23:56:35,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:56:35,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:56:35,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:56:35,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:56:35,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:56:35,996 INFO L87 Difference]: Start difference. First operand has 80 states, 48 states have (on average 1.4375) internal successors, (69), 49 states have internal predecessors, (69), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-12 23:56:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:56:36,040 INFO L93 Difference]: Finished difference Result 157 states and 281 transitions. [2024-10-12 23:56:36,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:56:36,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 177 [2024-10-12 23:56:36,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:56:36,051 INFO L225 Difference]: With dead ends: 157 [2024-10-12 23:56:36,051 INFO L226 Difference]: Without dead ends: 78 [2024-10-12 23:56:36,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:56:36,059 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:56:36,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:56:36,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-12 23:56:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-12 23:56:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 23:56:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2024-10-12 23:56:36,099 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 177 [2024-10-12 23:56:36,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:56:36,100 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2024-10-12 23:56:36,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-12 23:56:36,101 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2024-10-12 23:56:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-12 23:56:36,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:56:36,104 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:56:36,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:56:36,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:56:36,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:56:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1946067956, now seen corresponding path program 1 times [2024-10-12 23:56:36,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:56:36,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444342848] [2024-10-12 23:56:36,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:56:36,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:56:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:56:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:56:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:56:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:56:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:56:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:56:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:56:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:56:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:56:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:56:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 23:56:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:56:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 23:56:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:36,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:56:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 23:56:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 23:56:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 23:56:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 23:56:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 23:56:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 23:56:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 23:56:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 23:56:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-12 23:56:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 23:56:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-12 23:56:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 23:56:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 23:56:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 23:56:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 23:56:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 141 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2024-10-12 23:56:37,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:56:37,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444342848] [2024-10-12 23:56:37,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444342848] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:56:37,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293753782] [2024-10-12 23:56:37,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:56:37,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:56:37,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:56:37,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:56:37,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 23:56:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:37,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 23:56:37,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:56:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 455 proven. 141 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2024-10-12 23:56:37,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:56:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 144 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-10-12 23:56:38,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293753782] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:56:38,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:56:38,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-10-12 23:56:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792624334] [2024-10-12 23:56:38,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:56:38,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 23:56:38,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:56:38,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 23:56:38,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-12 23:56:38,329 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2024-10-12 23:56:39,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:56:39,297 INFO L93 Difference]: Finished difference Result 345 states and 506 transitions. [2024-10-12 23:56:39,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-12 23:56:39,298 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 177 [2024-10-12 23:56:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:56:39,301 INFO L225 Difference]: With dead ends: 345 [2024-10-12 23:56:39,301 INFO L226 Difference]: Without dead ends: 268 [2024-10-12 23:56:39,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-10-12 23:56:39,303 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 194 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 23:56:39,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 619 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 23:56:39,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-12 23:56:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 88. [2024-10-12 23:56:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 23:56:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-12 23:56:39,335 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 177 [2024-10-12 23:56:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:56:39,336 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-12 23:56:39,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2024-10-12 23:56:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-12 23:56:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-12 23:56:39,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:56:39,338 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:56:39,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 23:56:39,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:56:39,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:56:39,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:56:39,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1245003378, now seen corresponding path program 1 times [2024-10-12 23:56:39,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:56:39,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37345875] [2024-10-12 23:56:39,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:56:39,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:56:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 23:56:39,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2054475995] [2024-10-12 23:56:39,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:56:39,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:56:39,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:56:39,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:56:39,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 23:56:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:56:39,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:56:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:56:39,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:56:39,796 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:56:39,797 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:56:39,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 23:56:40,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-12 23:56:40,007 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-12 23:56:40,096 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:56:40,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:56:40 BoogieIcfgContainer [2024-10-12 23:56:40,098 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:56:40,099 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:56:40,099 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:56:40,099 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:56:40,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:56:35" (3/4) ... [2024-10-12 23:56:40,104 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:56:40,105 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:56:40,105 INFO L158 Benchmark]: Toolchain (without parser) took 5481.61ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 100.8MB in the beginning and 84.9MB in the end (delta: 15.8MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2024-10-12 23:56:40,106 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:56:40,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.60ms. Allocated memory is still 155.2MB. Free memory was 100.2MB in the beginning and 84.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 23:56:40,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.23ms. Allocated memory is still 155.2MB. Free memory was 84.2MB in the beginning and 80.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:56:40,106 INFO L158 Benchmark]: Boogie Preprocessor took 68.17ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 74.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 23:56:40,106 INFO L158 Benchmark]: RCFGBuilder took 478.89ms. Allocated memory is still 155.2MB. Free memory was 74.3MB in the beginning and 47.9MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 23:56:40,107 INFO L158 Benchmark]: TraceAbstraction took 4621.33ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 47.1MB in the beginning and 86.0MB in the end (delta: -38.9MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-10-12 23:56:40,107 INFO L158 Benchmark]: Witness Printer took 6.31ms. Allocated memory is still 211.8MB. Free memory was 86.0MB in the beginning and 84.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:56:40,108 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.60ms. Allocated memory is still 155.2MB. Free memory was 100.2MB in the beginning and 84.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.23ms. Allocated memory is still 155.2MB. Free memory was 84.2MB in the beginning and 80.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.17ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 74.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 478.89ms. Allocated memory is still 155.2MB. Free memory was 74.3MB in the beginning and 47.9MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4621.33ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 47.1MB in the beginning and 86.0MB in the end (delta: -38.9MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Witness Printer took 6.31ms. Allocated memory is still 211.8MB. Free memory was 86.0MB in the beginning and 84.9MB in the end (delta: 1.0MB). 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 someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryArithmeticDOUBLEoperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] signed long int var_1_6 = 25; [L28] double var_1_10 = 99999999999.25; [L29] double var_1_11 = 255.25; [L30] double var_1_12 = 1.125; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 5; [L33] unsigned char var_1_15 = 32; [L34] unsigned char var_1_16 = 4; [L35] unsigned char var_1_17 = 2; [L36] signed char var_1_18 = 4; [L37] signed char var_1_19 = 16; [L38] signed char var_1_20 = 32; [L39] signed char var_1_21 = 25; [L40] signed char var_1_22 = 1; [L41] signed char var_1_23 = 100; [L42] double var_1_24 = 3.125; [L43] double var_1_25 = 0.0; [L44] unsigned short int var_1_26 = 32; [L45] unsigned short int var_1_27 = 36217; [L46] unsigned char var_1_28 = 2; [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L89] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L89] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L90] var_1_3 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L91] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L92] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L92] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L95] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L95] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L96] var_1_5 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L97] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L98] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L98] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L99] var_1_11 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L100] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L101] var_1_12 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L102] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L103] var_1_14 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L104] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L105] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L105] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L106] var_1_16 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L108] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L108] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L109] var_1_17 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L110] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L111] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L111] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L112] var_1_19 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L113] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L114] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L114] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L115] var_1_20 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L116] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L117] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L117] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L118] var_1_21 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_21 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L119] RET assume_abort_if_not(var_1_21 >= -63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L120] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L120] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L121] var_1_22 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_22 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L122] RET assume_abort_if_not(var_1_22 >= -1) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L123] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L123] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L124] var_1_23 = __VERIFIER_nondet_char() [L125] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L125] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L126] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L126] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L127] var_1_25 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_25 >= 4611686.018427382800e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L128] RET assume_abort_if_not((var_1_25 >= 4611686.018427382800e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L129] var_1_27 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_27 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L130] RET assume_abort_if_not(var_1_27 >= 32767) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L131] CALL assume_abort_if_not(var_1_27 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L131] RET assume_abort_if_not(var_1_27 <= 65534) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L144] RET updateVariables() [L145] CALL step() [L50] COND TRUE \read(var_1_2) [L51] var_1_1 = (var_1_3 || var_1_4) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L55] COND TRUE ! var_1_5 [L56] var_1_15 = (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L58] var_1_18 = ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23)))) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L59] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L62] var_1_28 = var_1_16 [L63] var_1_6 = ((var_1_28 - var_1_26) + var_1_26) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L64] COND FALSE !(var_1_26 < (var_1_6 * var_1_28)) [L71] var_1_10 = var_1_12 VAL [isInitial=1, var_1_10=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L73] COND TRUE var_1_12 != var_1_10 [L74] var_1_13 = var_1_14 VAL [isInitial=1, var_1_10=2, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L82] EXPR var_1_20 ^ var_1_28 VAL [isInitial=1, var_1_10=2, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L82] COND TRUE var_1_23 >= (var_1_20 ^ var_1_28) [L83] var_1_24 = ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 || (var_1_4 || var_1_5))))) && (var_1_6 == ((signed long int) ((var_1_28 - var_1_26) + var_1_26)))) && ((var_1_26 < (var_1_6 * var_1_28)) ? (var_1_3 ? ((var_1_26 <= var_1_6) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1) : 1) : (var_1_10 == ((double) var_1_12)))) && ((var_1_12 != var_1_10) ? (var_1_13 == ((unsigned char) var_1_14)) : (((- var_1_26) > var_1_14) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) 25))))) && ((! var_1_5) ? (var_1_15 == ((unsigned char) (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))))) : 1)) && (var_1_18 == ((signed char) ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23))))))) && ((var_1_23 >= (var_1_20 ^ var_1_28)) ? (var_1_24 == ((double) ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))))) : 1) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L136-L137] return ((((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 || (var_1_4 || var_1_5))))) && (var_1_6 == ((signed long int) ((var_1_28 - var_1_26) + var_1_26)))) && ((var_1_26 < (var_1_6 * var_1_28)) ? (var_1_3 ? ((var_1_26 <= var_1_6) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1) : 1) : (var_1_10 == ((double) var_1_12)))) && ((var_1_12 != var_1_10) ? (var_1_13 == ((unsigned char) var_1_14)) : (((- var_1_26) > var_1_14) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) 25))))) && ((! var_1_5) ? (var_1_15 == ((unsigned char) (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))))) : 1)) && (var_1_18 == ((signed char) ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23))))))) && ((var_1_23 >= (var_1_20 ^ var_1_28)) ? (var_1_24 == ((double) ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))))) : 1)) && (var_1_1 ? (var_1_26 == ((unsigned short int) ((((((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) < ((var_1_27 - var_1_17))) ? (((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) : ((var_1_27 - var_1_17)))))) : 1)) && (var_1_28 == ((unsigned char) var_1_16)) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 3, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 223 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 737 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 494 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 791 IncrementalHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 243 mSDtfsCounter, 791 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 543 GetRequests, 496 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=2, InterpolantAutomatonStates: 43, 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, 180 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 885 NumberOfCodeBlocks, 885 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 3005 SizeOfPredicates, 4 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6070/6496 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 23:56:40,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.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 1f9a5c686ad01cfcc91f09109693d5ac5bccd775344ac75524882bf1ef1e7afb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:56:41,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:56:41,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 23:56:41,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:56:41,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:56:41,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:56:41,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:56:41,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:56:41,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:56:41,989 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:56:41,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:56:41,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:56:41,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:56:41,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:56:41,990 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:56:41,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:56:41,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:56:41,993 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:56:41,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:56:41,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:56:41,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:56:41,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:56:41,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:56:41,994 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:56:41,994 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:56:41,994 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:56:41,995 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:56:41,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:56:41,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:56:41,995 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:56:41,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:56:41,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:56:41,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:56:41,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:56:41,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:56:41,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:56:41,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:56:41,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:56:41,997 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:56:41,997 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:56:41,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:56:41,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:56:41,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:56:41,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:56:41,998 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:56:41,998 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 -> 1f9a5c686ad01cfcc91f09109693d5ac5bccd775344ac75524882bf1ef1e7afb [2024-10-12 23:56:42,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:56:42,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:56:42,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:56:42,271 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:56:42,272 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:56:42,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i [2024-10-12 23:56:43,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:56:43,670 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:56:43,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i [2024-10-12 23:56:43,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70aaea5c2/16cab9dd8f7b43518b041506cbe52054/FLAGcdc9fa8e6 [2024-10-12 23:56:43,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70aaea5c2/16cab9dd8f7b43518b041506cbe52054 [2024-10-12 23:56:43,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:56:43,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:56:43,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:56:43,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:56:43,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:56:43,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:56:43" (1/1) ... [2024-10-12 23:56:43,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d931047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:43, skipping insertion in model container [2024-10-12 23:56:43,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:56:43" (1/1) ... [2024-10-12 23:56:43,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:56:43,865 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i[919,932] [2024-10-12 23:56:43,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:56:43,941 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:56:43,965 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i[919,932] [2024-10-12 23:56:44,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:56:44,024 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:56:44,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44 WrapperNode [2024-10-12 23:56:44,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:56:44,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:56:44,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:56:44,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:56:44,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44" (1/1) ... [2024-10-12 23:56:44,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44" (1/1) ... [2024-10-12 23:56:44,075 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-10-12 23:56:44,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:56:44,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:56:44,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:56:44,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:56:44,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44" (1/1) ... [2024-10-12 23:56:44,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44" (1/1) ... [2024-10-12 23:56:44,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44" (1/1) ... [2024-10-12 23:56:44,106 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:56:44,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44" (1/1) ... [2024-10-12 23:56:44,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44" (1/1) ... [2024-10-12 23:56:44,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44" (1/1) ... [2024-10-12 23:56:44,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44" (1/1) ... [2024-10-12 23:56:44,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44" (1/1) ... [2024-10-12 23:56:44,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44" (1/1) ... [2024-10-12 23:56:44,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:56:44,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:56:44,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:56:44,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:56:44,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44" (1/1) ... [2024-10-12 23:56:44,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:56:44,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:56:44,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:56:44,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:56:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:56:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:56:44,199 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:56:44,199 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:56:44,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:56:44,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:56:44,269 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:56:44,270 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:56:45,844 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 23:56:45,844 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:56:45,894 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:56:45,894 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:56:45,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:56:45 BoogieIcfgContainer [2024-10-12 23:56:45,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:56:45,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:56:45,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:56:45,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:56:45,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:56:43" (1/3) ... [2024-10-12 23:56:45,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6050c6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:56:45, skipping insertion in model container [2024-10-12 23:56:45,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:56:44" (2/3) ... [2024-10-12 23:56:45,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6050c6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:56:45, skipping insertion in model container [2024-10-12 23:56:45,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:56:45" (3/3) ... [2024-10-12 23:56:45,900 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-99.i [2024-10-12 23:56:45,913 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:56:45,913 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:56:45,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:56:45,979 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;@55683eb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:56:45,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:56:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 23:56:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-12 23:56:45,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:56:45,995 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:56:45,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:56:45,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:56:46,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1098920045, now seen corresponding path program 1 times [2024-10-12 23:56:46,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:56:46,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638857868] [2024-10-12 23:56:46,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:56:46,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:56:46,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:56:46,017 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:56:46,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 23:56:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:46,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 23:56:46,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:56:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-12 23:56:46,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:56:46,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:56:46,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638857868] [2024-10-12 23:56:46,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638857868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:56:46,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:56:46,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:56:46,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195661381] [2024-10-12 23:56:46,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:56:46,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:56:46,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:56:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:56:46,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:56:46,391 INFO L87 Difference]: Start difference. First operand has 69 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-12 23:56:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:56:46,998 INFO L93 Difference]: Finished difference Result 135 states and 245 transitions. [2024-10-12 23:56:47,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:56:47,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 174 [2024-10-12 23:56:47,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:56:47,023 INFO L225 Difference]: With dead ends: 135 [2024-10-12 23:56:47,023 INFO L226 Difference]: Without dead ends: 67 [2024-10-12 23:56:47,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:56:47,029 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 23:56:47,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 23:56:47,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-12 23:56:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-12 23:56:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 23:56:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-10-12 23:56:47,065 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 174 [2024-10-12 23:56:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:56:47,065 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-10-12 23:56:47,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-12 23:56:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-10-12 23:56:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-12 23:56:47,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:56:47,069 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:56:47,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-12 23:56:47,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:56:47,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:56:47,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:56:47,271 INFO L85 PathProgramCache]: Analyzing trace with hash 189836519, now seen corresponding path program 1 times [2024-10-12 23:56:47,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:56:47,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38570511] [2024-10-12 23:56:47,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:56:47,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:56:47,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:56:47,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:56:47,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 23:56:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:47,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 23:56:47,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:56:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 455 proven. 141 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2024-10-12 23:56:48,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:56:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 144 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-10-12 23:56:49,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:56:49,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38570511] [2024-10-12 23:56:49,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38570511] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:56:49,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:56:49,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-12 23:56:49,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174611175] [2024-10-12 23:56:49,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:56:49,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 23:56:49,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:56:49,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 23:56:49,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-12 23:56:49,193 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-12 23:56:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:56:51,820 INFO L93 Difference]: Finished difference Result 225 states and 327 transitions. [2024-10-12 23:56:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-12 23:56:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 174 [2024-10-12 23:56:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:56:51,824 INFO L225 Difference]: With dead ends: 225 [2024-10-12 23:56:51,824 INFO L226 Difference]: Without dead ends: 159 [2024-10-12 23:56:51,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-10-12 23:56:51,826 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 93 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:56:51,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 315 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 23:56:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-12 23:56:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 77. [2024-10-12 23:56:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 23:56:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 110 transitions. [2024-10-12 23:56:51,841 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 110 transitions. Word has length 174 [2024-10-12 23:56:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:56:51,842 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 110 transitions. [2024-10-12 23:56:51,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-12 23:56:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 110 transitions. [2024-10-12 23:56:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-12 23:56:51,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:56:51,844 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:56:51,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-12 23:56:52,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:56:52,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:56:52,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:56:52,046 INFO L85 PathProgramCache]: Analyzing trace with hash -619510107, now seen corresponding path program 1 times [2024-10-12 23:56:52,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:56:52,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159212799] [2024-10-12 23:56:52,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:56:52,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:56:52,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:56:52,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:56:52,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 23:56:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:52,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 23:56:52,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:56:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 27 proven. 760 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2024-10-12 23:56:53,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:56:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 27 proven. 57 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-12 23:56:53,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:56:53,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159212799] [2024-10-12 23:56:53,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159212799] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:56:53,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:56:53,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-12 23:56:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954054311] [2024-10-12 23:56:53,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:56:53,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 23:56:53,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:56:53,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 23:56:53,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:56:53,726 INFO L87 Difference]: Start difference. First operand 77 states and 110 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2024-10-12 23:56:55,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:56:56,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:56:56,301 INFO L93 Difference]: Finished difference Result 203 states and 276 transitions. [2024-10-12 23:56:56,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 23:56:56,302 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) Word has length 174 [2024-10-12 23:56:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:56:56,304 INFO L225 Difference]: With dead ends: 203 [2024-10-12 23:56:56,304 INFO L226 Difference]: Without dead ends: 127 [2024-10-12 23:56:56,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2024-10-12 23:56:56,305 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 96 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:56:56,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 215 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 23:56:56,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-12 23:56:56,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2024-10-12 23:56:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-12 23:56:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 152 transitions. [2024-10-12 23:56:56,325 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 152 transitions. Word has length 174 [2024-10-12 23:56:56,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:56:56,326 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 152 transitions. [2024-10-12 23:56:56,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2024-10-12 23:56:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 152 transitions. [2024-10-12 23:56:56,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-12 23:56:56,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:56:56,328 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:56:56,337 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 (4)] Ended with exit code 0 [2024-10-12 23:56:56,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:56:56,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:56:56,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:56:56,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1974127352, now seen corresponding path program 1 times [2024-10-12 23:56:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:56:56,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846799479] [2024-10-12 23:56:56,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:56:56,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:56:56,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:56:56,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:56:56,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-12 23:56:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:56,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-12 23:56:56,977 INFO L278 TraceCheckSpWp]: Computing forward predicates...