./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.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 431f2117f5c677d2ffce2fa99499007e44687a7dec4f669e88843242de06006b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:01:17,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:01:17,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 02:01:17,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:01:17,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:01:18,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:01:18,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:01:18,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:01:18,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:01:18,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:01:18,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:01:18,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:01:18,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:01:18,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:01:18,030 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:01:18,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:01:18,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:01:18,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:01:18,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 02:01:18,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:01:18,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:01:18,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:01:18,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:01:18,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:01:18,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:01:18,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:01:18,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:01:18,036 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:01:18,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:01:18,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:01:18,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:01:18,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:01:18,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:01:18,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:01:18,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:01:18,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:01:18,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 02:01:18,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 02:01:18,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:01:18,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:01:18,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:01:18,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:01:18,040 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 -> 431f2117f5c677d2ffce2fa99499007e44687a7dec4f669e88843242de06006b [2024-11-12 02:01:18,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:01:18,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:01:18,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:01:18,345 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:01:18,345 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:01:18,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2024-11-12 02:01:19,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:01:19,873 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:01:19,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2024-11-12 02:01:19,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9571d4f83/b018a2e30bfa42ddb15c00ad55a35a1a/FLAG1e3a231fe [2024-11-12 02:01:19,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9571d4f83/b018a2e30bfa42ddb15c00ad55a35a1a [2024-11-12 02:01:19,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:01:19,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:01:19,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:01:19,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:01:19,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:01:19,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:01:19" (1/1) ... [2024-11-12 02:01:19,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ba2d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:19, skipping insertion in model container [2024-11-12 02:01:19,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:01:19" (1/1) ... [2024-11-12 02:01:19,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:01:20,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i[915,928] [2024-11-12 02:01:20,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:01:20,173 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:01:20,182 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i[915,928] [2024-11-12 02:01:20,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:01:20,260 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:01:20,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20 WrapperNode [2024-11-12 02:01:20,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:01:20,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:01:20,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:01:20,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:01:20,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20" (1/1) ... [2024-11-12 02:01:20,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20" (1/1) ... [2024-11-12 02:01:20,348 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2024-11-12 02:01:20,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:01:20,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:01:20,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:01:20,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:01:20,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20" (1/1) ... [2024-11-12 02:01:20,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20" (1/1) ... [2024-11-12 02:01:20,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20" (1/1) ... [2024-11-12 02:01:20,395 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 02:01:20,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20" (1/1) ... [2024-11-12 02:01:20,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20" (1/1) ... [2024-11-12 02:01:20,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20" (1/1) ... [2024-11-12 02:01:20,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20" (1/1) ... [2024-11-12 02:01:20,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20" (1/1) ... [2024-11-12 02:01:20,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20" (1/1) ... [2024-11-12 02:01:20,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:01:20,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:01:20,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:01:20,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:01:20,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20" (1/1) ... [2024-11-12 02:01:20,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:01:20,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:01:20,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 02:01:20,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 02:01:20,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:01:20,498 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:01:20,499 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:01:20,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 02:01:20,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:01:20,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:01:20,579 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:01:20,581 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:01:20,859 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 02:01:20,859 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:01:20,873 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:01:20,873 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:01:20,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:01:20 BoogieIcfgContainer [2024-11-12 02:01:20,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:01:20,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:01:20,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:01:20,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:01:20,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:01:19" (1/3) ... [2024-11-12 02:01:20,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763bb3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:01:20, skipping insertion in model container [2024-11-12 02:01:20,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:20" (2/3) ... [2024-11-12 02:01:20,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763bb3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:01:20, skipping insertion in model container [2024-11-12 02:01:20,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:01:20" (3/3) ... [2024-11-12 02:01:20,880 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2024-11-12 02:01:20,892 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:01:20,893 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:01:20,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:01:20,948 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;@4c910297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:01:20,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:01:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 68 states have internal predecessors, (97), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 02:01:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 02:01:20,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:20,970 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:01:20,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:20,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1706772870, now seen corresponding path program 1 times [2024-11-12 02:01:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:01:20,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864504077] [2024-11-12 02:01:20,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:20,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:01:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:01:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:01:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:01:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:01:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:01:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:01:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:01:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:01:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:01:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:01:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:01:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:01:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:01:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:01:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:01:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:01:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:01:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:01:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:01:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:01:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:01:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:01:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:01:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:01:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:01:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 02:01:21,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:01:21,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864504077] [2024-11-12 02:01:21,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864504077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:01:21,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:01:21,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:01:21,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830488586] [2024-11-12 02:01:21,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:01:21,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:01:21,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:01:21,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:01:21,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:01:21,418 INFO L87 Difference]: Start difference. First operand has 95 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 68 states have internal predecessors, (97), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 02:01:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:01:21,483 INFO L93 Difference]: Finished difference Result 181 states and 311 transitions. [2024-11-12 02:01:21,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:01:21,487 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2024-11-12 02:01:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:01:21,495 INFO L225 Difference]: With dead ends: 181 [2024-11-12 02:01:21,495 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 02:01:21,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:01:21,502 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:01:21,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:01:21,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 02:01:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-12 02:01:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 02:01:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 135 transitions. [2024-11-12 02:01:21,556 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 135 transitions. Word has length 164 [2024-11-12 02:01:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:01:21,556 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 135 transitions. [2024-11-12 02:01:21,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 02:01:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 135 transitions. [2024-11-12 02:01:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 02:01:21,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:21,560 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:01:21,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 02:01:21,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:21,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1353843724, now seen corresponding path program 1 times [2024-11-12 02:01:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:01:21,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544480723] [2024-11-12 02:01:21,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:01:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:01:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:01:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:01:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:01:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:01:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:01:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:01:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:01:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:01:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:01:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:01:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:01:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:01:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:01:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:01:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:01:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:01:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:01:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:01:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:01:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:01:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:01:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:01:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:01:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:01:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 02:01:21,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:01:21,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544480723] [2024-11-12 02:01:21,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544480723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:01:21,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:01:21,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:01:21,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985633268] [2024-11-12 02:01:21,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:01:21,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:01:21,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:01:21,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:01:21,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:01:21,997 INFO L87 Difference]: Start difference. First operand 89 states and 135 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:01:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:01:22,139 INFO L93 Difference]: Finished difference Result 261 states and 399 transitions. [2024-11-12 02:01:22,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:01:22,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2024-11-12 02:01:22,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:01:22,147 INFO L225 Difference]: With dead ends: 261 [2024-11-12 02:01:22,153 INFO L226 Difference]: Without dead ends: 175 [2024-11-12 02:01:22,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:01:22,155 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 119 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:01:22,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 356 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:01:22,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-12 02:01:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 106. [2024-11-12 02:01:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 02:01:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 159 transitions. [2024-11-12 02:01:22,192 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 159 transitions. Word has length 164 [2024-11-12 02:01:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:01:22,199 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 159 transitions. [2024-11-12 02:01:22,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:01:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 159 transitions. [2024-11-12 02:01:22,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 02:01:22,207 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:22,207 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:01:22,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 02:01:22,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:22,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:22,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1891970121, now seen corresponding path program 1 times [2024-11-12 02:01:22,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:01:22,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459514523] [2024-11-12 02:01:22,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:22,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:01:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:01:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:01:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:01:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:01:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:01:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:01:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:01:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:01:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:01:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:01:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:01:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:01:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:01:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:01:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:01:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:01:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:01:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:01:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:01:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:01:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:01:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:01:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:01:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:01:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:01:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 02:01:22,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:01:22,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459514523] [2024-11-12 02:01:22,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459514523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:01:22,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:01:22,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:01:22,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551489712] [2024-11-12 02:01:22,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:01:22,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:01:22,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:01:22,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:01:22,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:01:22,483 INFO L87 Difference]: Start difference. First operand 106 states and 159 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:01:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:01:22,501 INFO L93 Difference]: Finished difference Result 190 states and 283 transitions. [2024-11-12 02:01:22,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:01:22,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2024-11-12 02:01:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:01:22,503 INFO L225 Difference]: With dead ends: 190 [2024-11-12 02:01:22,503 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 02:01:22,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:01:22,504 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:01:22,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:01:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 02:01:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-12 02:01:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 02:01:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 126 transitions. [2024-11-12 02:01:22,516 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 126 transitions. Word has length 165 [2024-11-12 02:01:22,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:01:22,517 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 126 transitions. [2024-11-12 02:01:22,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:01:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 126 transitions. [2024-11-12 02:01:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-12 02:01:22,518 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:22,519 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:01:22,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 02:01:22,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:22,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1148602457, now seen corresponding path program 1 times [2024-11-12 02:01:22,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:01:22,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21939473] [2024-11-12 02:01:22,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:22,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:01:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:01:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:01:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:01:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:01:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:01:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:01:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:01:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:01:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:01:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:01:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:01:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:01:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:01:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:01:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:01:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:01:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:01:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:01:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:01:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:01:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:01:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:01:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:01:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:01:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:01:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 02:01:23,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:01:23,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21939473] [2024-11-12 02:01:23,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21939473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:01:23,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:01:23,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 02:01:23,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92182513] [2024-11-12 02:01:23,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:01:23,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 02:01:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:01:23,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 02:01:23,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 02:01:23,349 INFO L87 Difference]: Start difference. First operand 87 states and 126 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:01:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:01:23,602 INFO L93 Difference]: Finished difference Result 295 states and 435 transitions. [2024-11-12 02:01:23,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 02:01:23,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2024-11-12 02:01:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:01:23,605 INFO L225 Difference]: With dead ends: 295 [2024-11-12 02:01:23,605 INFO L226 Difference]: Without dead ends: 211 [2024-11-12 02:01:23,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:01:23,606 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 219 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:01:23,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 797 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:01:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-12 02:01:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 89. [2024-11-12 02:01:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 62 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 02:01:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-11-12 02:01:23,616 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 166 [2024-11-12 02:01:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:01:23,617 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-11-12 02:01:23,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:01:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-11-12 02:01:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 02:01:23,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:23,619 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:01:23,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 02:01:23,619 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:23,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:23,620 INFO L85 PathProgramCache]: Analyzing trace with hash -455789911, now seen corresponding path program 1 times [2024-11-12 02:01:23,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:01:23,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295330436] [2024-11-12 02:01:23,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:01:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:01:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:01:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:01:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:01:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:01:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:01:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:01:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:01:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:01:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:01:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:01:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:01:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:01:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:01:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:01:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:01:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:01:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:01:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:01:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:01:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:01:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:01:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:01:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:01:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:01:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 02:01:24,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:01:24,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295330436] [2024-11-12 02:01:24,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295330436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:01:24,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:01:24,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 02:01:24,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242473979] [2024-11-12 02:01:24,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:01:24,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 02:01:24,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:01:24,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 02:01:24,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:01:24,322 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:01:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:01:24,794 INFO L93 Difference]: Finished difference Result 368 states and 540 transitions. [2024-11-12 02:01:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 02:01:24,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-12 02:01:24,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:01:24,797 INFO L225 Difference]: With dead ends: 368 [2024-11-12 02:01:24,797 INFO L226 Difference]: Without dead ends: 282 [2024-11-12 02:01:24,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-12 02:01:24,798 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 312 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 02:01:24,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 923 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 02:01:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-12 02:01:24,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 89. [2024-11-12 02:01:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 62 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 02:01:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-11-12 02:01:24,809 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 167 [2024-11-12 02:01:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:01:24,809 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-11-12 02:01:24,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:01:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-11-12 02:01:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 02:01:24,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:24,811 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:01:24,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 02:01:24,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:24,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:24,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1135848281, now seen corresponding path program 1 times [2024-11-12 02:01:24,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:01:24,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607758537] [2024-11-12 02:01:24,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:01:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:01:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:01:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:01:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:01:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:01:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:01:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:01:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:01:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:01:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:01:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:01:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:01:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:01:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:01:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:01:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:01:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:01:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:01:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:01:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:01:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:01:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:01:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:01:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:01:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:01:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 02:01:25,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:01:25,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607758537] [2024-11-12 02:01:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607758537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:01:25,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:01:25,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 02:01:25,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847444628] [2024-11-12 02:01:25,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:01:25,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 02:01:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:01:25,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 02:01:25,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:01:25,453 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-12 02:01:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:01:25,848 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2024-11-12 02:01:25,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 02:01:25,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 167 [2024-11-12 02:01:25,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:01:25,850 INFO L225 Difference]: With dead ends: 202 [2024-11-12 02:01:25,850 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 02:01:25,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-12 02:01:25,851 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 258 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 02:01:25,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 252 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 02:01:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 02:01:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-12 02:01:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 75 states have internal predecessors, (88), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-12 02:01:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 162 transitions. [2024-11-12 02:01:25,868 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 162 transitions. Word has length 167 [2024-11-12 02:01:25,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:01:25,869 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 162 transitions. [2024-11-12 02:01:25,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-12 02:01:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 162 transitions. [2024-11-12 02:01:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-12 02:01:25,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:25,870 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:01:25,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 02:01:25,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:25,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1953788081, now seen corresponding path program 1 times [2024-11-12 02:01:25,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:01:25,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959824574] [2024-11-12 02:01:25,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:25,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:01:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:01:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:01:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:01:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:01:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:01:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:01:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:01:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:01:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:01:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:01:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:01:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:01:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:01:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:01:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:01:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:01:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:01:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:01:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:01:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:01:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:01:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:01:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:01:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:01:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:01:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-12 02:01:26,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:01:26,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959824574] [2024-11-12 02:01:26,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959824574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:01:26,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306571040] [2024-11-12 02:01:26,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:26,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:01:26,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:01:26,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 02:01:26,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 02:01:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:26,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 02:01:26,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:01:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 468 proven. 54 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-12 02:01:26,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:01:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-12 02:01:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306571040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:01:26,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 02:01:26,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-12 02:01:26,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577012430] [2024-11-12 02:01:26,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 02:01:26,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 02:01:26,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:01:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 02:01:26,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 02:01:26,728 INFO L87 Difference]: Start difference. First operand 115 states and 162 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-12 02:01:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:01:26,918 INFO L93 Difference]: Finished difference Result 221 states and 301 transitions. [2024-11-12 02:01:26,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 02:01:26,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 170 [2024-11-12 02:01:26,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:01:26,921 INFO L225 Difference]: With dead ends: 221 [2024-11-12 02:01:26,921 INFO L226 Difference]: Without dead ends: 129 [2024-11-12 02:01:26,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 385 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-12 02:01:26,922 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 196 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:01:26,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 257 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:01:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-12 02:01:26,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2024-11-12 02:01:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 80 states have (on average 1.1625) internal successors, (93), 81 states have internal predecessors, (93), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-12 02:01:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 167 transitions. [2024-11-12 02:01:26,932 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 167 transitions. Word has length 170 [2024-11-12 02:01:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:01:26,932 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 167 transitions. [2024-11-12 02:01:26,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-12 02:01:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 167 transitions. [2024-11-12 02:01:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-12 02:01:26,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:26,934 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:01:26,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 02:01:27,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:01:27,139 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:27,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1295199841, now seen corresponding path program 1 times [2024-11-12 02:01:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:01:27,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306764930] [2024-11-12 02:01:27,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:27,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:01:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:01:27,218 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 02:01:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:01:27,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 02:01:27,338 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 02:01:27,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 02:01:27,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 02:01:27,352 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:01:27,517 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 02:01:27,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:01:27 BoogieIcfgContainer [2024-11-12 02:01:27,524 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 02:01:27,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 02:01:27,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 02:01:27,528 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 02:01:27,529 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:01:20" (3/4) ... [2024-11-12 02:01:27,531 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 02:01:27,532 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 02:01:27,537 INFO L158 Benchmark]: Toolchain (without parser) took 7639.14ms. Allocated memory was 172.0MB in the beginning and 297.8MB in the end (delta: 125.8MB). Free memory was 104.3MB in the beginning and 213.5MB in the end (delta: -109.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-12 02:01:27,537 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:01:27,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.28ms. Allocated memory is still 172.0MB. Free memory was 104.1MB in the beginning and 143.4MB in the end (delta: -39.3MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2024-11-12 02:01:27,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.88ms. Allocated memory is still 172.0MB. Free memory was 143.4MB in the beginning and 139.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 02:01:27,537 INFO L158 Benchmark]: Boogie Preprocessor took 61.16ms. Allocated memory is still 172.0MB. Free memory was 139.4MB in the beginning and 135.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 02:01:27,537 INFO L158 Benchmark]: RCFGBuilder took 462.45ms. Allocated memory is still 172.0MB. Free memory was 135.2MB in the beginning and 109.4MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-12 02:01:27,537 INFO L158 Benchmark]: TraceAbstraction took 6648.19ms. Allocated memory was 172.0MB in the beginning and 297.8MB in the end (delta: 125.8MB). Free memory was 108.7MB in the beginning and 214.6MB in the end (delta: -105.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-11-12 02:01:27,538 INFO L158 Benchmark]: Witness Printer took 11.96ms. Allocated memory is still 297.8MB. Free memory was 214.6MB in the beginning and 213.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:01:27,539 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.14ms. Allocated memory is still 113.2MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.28ms. Allocated memory is still 172.0MB. Free memory was 104.1MB in the beginning and 143.4MB in the end (delta: -39.3MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.88ms. Allocated memory is still 172.0MB. Free memory was 143.4MB in the beginning and 139.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.16ms. Allocated memory is still 172.0MB. Free memory was 139.4MB in the beginning and 135.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 462.45ms. Allocated memory is still 172.0MB. Free memory was 135.2MB in the beginning and 109.4MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6648.19ms. Allocated memory was 172.0MB in the beginning and 297.8MB in the end (delta: 125.8MB). Free memory was 108.7MB in the beginning and 214.6MB in the end (delta: -105.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Witness Printer took 11.96ms. Allocated memory is still 297.8MB. Free memory was 214.6MB in the beginning and 213.5MB 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 160, overapproximation of someBinaryFLOATComparisonOperation at line 149, overapproximation of someBinaryArithmeticDOUBLEoperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed long int var_1_29 = 50; [L41] signed long int var_1_30 = 16; [L42] signed char var_1_31 = 4; [L43] signed char var_1_32 = 64; [L44] unsigned short int var_1_33 = 16; [L45] unsigned short int var_1_34 = 100; [L46] signed short int var_1_35 = -32; [L47] float var_1_36 = 99.05; [L48] float var_1_37 = 10.75; [L49] signed short int last_1_var_1_1 = 4; [L50] unsigned char last_1_var_1_14 = 1; [L51] signed char last_1_var_1_16 = 50; [L52] signed long int last_1_var_1_23 = -16; [L53] unsigned char last_1_var_1_24 = 1; [L54] double last_1_var_1_28 = 5.5; VAL [isInitial=0, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L164] isInitial = 1 [L165] FCALL initially() [L166] COND TRUE 1 [L167] CALL updateLastVariables() [L152] last_1_var_1_1 = var_1_1 [L153] last_1_var_1_14 = var_1_14 [L154] last_1_var_1_16 = var_1_16 [L155] last_1_var_1_23 = var_1_23 [L156] last_1_var_1_24 = var_1_24 [L157] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L167] RET updateLastVariables() [L168] CALL updateVariables() [L111] var_1_11 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L112] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L113] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L113] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L114] var_1_12 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L115] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L116] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L116] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L117] var_1_13 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L118] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L119] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L119] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L120] var_1_15 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L121] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L122] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L122] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L123] var_1_19 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L124] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L125] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L125] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L126] var_1_21 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L127] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L128] var_1_22 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L129] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L130] var_1_25 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L131] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L132] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L132] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L133] var_1_26 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L134] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L135] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L135] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L136] var_1_27 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L137] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L138] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L138] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L139] var_1_30 = __VERIFIER_nondet_long() [L140] CALL assume_abort_if_not(var_1_30 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L140] RET assume_abort_if_not(var_1_30 >= -2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L141] CALL assume_abort_if_not(var_1_30 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L141] RET assume_abort_if_not(var_1_30 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L142] var_1_32 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_32 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L143] RET assume_abort_if_not(var_1_32 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L144] CALL assume_abort_if_not(var_1_32 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L144] RET assume_abort_if_not(var_1_32 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L145] var_1_34 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L146] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L147] CALL assume_abort_if_not(var_1_34 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=0, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=0, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L147] RET assume_abort_if_not(var_1_34 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=0, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L148] var_1_37 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=0, var_1_35=-32, var_1_36=1981/20, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=0, var_1_35=-32, var_1_36=1981/20, var_1_8=64] [L149] RET assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=0, var_1_35=-32, var_1_36=1981/20, var_1_8=64] [L168] RET updateVariables() [L169] CALL step() [L58] var_1_29 = var_1_30 [L59] var_1_31 = var_1_32 [L60] var_1_33 = var_1_34 [L61] var_1_35 = var_1_32 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=1981/20, var_1_8=64] [L62] EXPR var_1_29 ^ var_1_34 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=1981/20, var_1_8=64] [L62] COND FALSE !(((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) < (var_1_29 ^ var_1_34)) [L69] var_1_36 = var_1_37 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L71] signed long int stepLocal_3 = last_1_var_1_23; [L72] unsigned char stepLocal_2 = ! (last_1_var_1_14 || last_1_var_1_14); VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L73] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L84] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L86] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L86] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L87] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-32762, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L91] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L92] var_1_28 = var_1_21 [L93] unsigned char stepLocal_0 = var_1_23 > 4; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_21=100000005, var_1_23=-32762, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L94] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L95] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L99] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L100] signed char stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L101] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L101] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L102] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L104] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L105] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L169] RET step() [L170] CALL, EXPR property() [L160] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L160] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L160] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L160] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L160-L161] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L170] RET, EXPR property() [L170] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=0, var_1_34=0, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1134 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1104 mSDsluCounter, 2962 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1634 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 748 IncrementalHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 1328 mSDtfsCounter, 748 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 768 GetRequests, 730 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=7, InterpolantAutomatonStates: 38, 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, 7 MinimizatonAttempts, 391 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1504 NumberOfCodeBlocks, 1504 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1494 ConstructedInterpolants, 0 QuantifiedInterpolants, 3772 SizeOfPredicates, 2 NumberOfNonLiveVariables, 417 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 10638/10800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 02:01:27,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.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 431f2117f5c677d2ffce2fa99499007e44687a7dec4f669e88843242de06006b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:01:29,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:01:29,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 02:01:29,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:01:29,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:01:29,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:01:29,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:01:29,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:01:29,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:01:29,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:01:29,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:01:29,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:01:29,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:01:29,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:01:29,792 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:01:29,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:01:29,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:01:29,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:01:29,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:01:29,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:01:29,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:01:29,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:01:29,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:01:29,798 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 02:01:29,799 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 02:01:29,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:01:29,799 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 02:01:29,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:01:29,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:01:29,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:01:29,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:01:29,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:01:29,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:01:29,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:01:29,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:01:29,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:01:29,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:01:29,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:01:29,801 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 02:01:29,802 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 02:01:29,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:01:29,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:01:29,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:01:29,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:01:29,803 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 -> 431f2117f5c677d2ffce2fa99499007e44687a7dec4f669e88843242de06006b [2024-11-12 02:01:30,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:01:30,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:01:30,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:01:30,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:01:30,187 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:01:30,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2024-11-12 02:01:31,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:01:31,797 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:01:31,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2024-11-12 02:01:31,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93e6c4a4/0a548a07afa948749d1566f726f311c6/FLAGd838fcf51 [2024-11-12 02:01:32,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93e6c4a4/0a548a07afa948749d1566f726f311c6 [2024-11-12 02:01:32,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:01:32,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:01:32,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:01:32,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:01:32,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:01:32,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7efaaff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32, skipping insertion in model container [2024-11-12 02:01:32,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:01:32,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i[915,928] [2024-11-12 02:01:32,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:01:32,464 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:01:32,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i[915,928] [2024-11-12 02:01:32,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:01:32,526 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:01:32,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32 WrapperNode [2024-11-12 02:01:32,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:01:32,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:01:32,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:01:32,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:01:32,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,577 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-12 02:01:32,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:01:32,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:01:32,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:01:32,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:01:32,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,618 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 02:01:32,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:01:32,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:01:32,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:01:32,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:01:32,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32" (1/1) ... [2024-11-12 02:01:32,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:01:32,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:01:32,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 02:01:32,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 02:01:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:01:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 02:01:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:01:32,717 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:01:32,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:01:32,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:01:32,800 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:01:32,803 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:01:34,231 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-12 02:01:34,231 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:01:34,248 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:01:34,249 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:01:34,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:01:34 BoogieIcfgContainer [2024-11-12 02:01:34,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:01:34,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:01:34,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:01:34,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:01:34,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:01:32" (1/3) ... [2024-11-12 02:01:34,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab46899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:01:34, skipping insertion in model container [2024-11-12 02:01:34,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:32" (2/3) ... [2024-11-12 02:01:34,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab46899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:01:34, skipping insertion in model container [2024-11-12 02:01:34,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:01:34" (3/3) ... [2024-11-12 02:01:34,255 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2024-11-12 02:01:34,270 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:01:34,270 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:01:34,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:01:34,339 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;@432457a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:01:34,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:01:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 02:01:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-12 02:01:34,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:34,358 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:01:34,358 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:34,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:34,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1437937569, now seen corresponding path program 1 times [2024-11-12 02:01:34,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:01:34,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097207604] [2024-11-12 02:01:34,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:34,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:01:34,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:01:34,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:01:34,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 02:01:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:34,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 02:01:34,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:01:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 468 proven. 54 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-12 02:01:35,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:01:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-12 02:01:35,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:01:35,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097207604] [2024-11-12 02:01:35,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097207604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:01:35,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 02:01:35,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-12 02:01:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027331410] [2024-11-12 02:01:35,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 02:01:35,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 02:01:35,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:01:35,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 02:01:35,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 02:01:35,477 INFO L87 Difference]: Start difference. First operand has 71 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-12 02:01:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:01:36,580 INFO L93 Difference]: Finished difference Result 154 states and 270 transitions. [2024-11-12 02:01:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 02:01:36,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 157 [2024-11-12 02:01:36,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:01:36,589 INFO L225 Difference]: With dead ends: 154 [2024-11-12 02:01:36,589 INFO L226 Difference]: Without dead ends: 86 [2024-11-12 02:01:36,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-12 02:01:36,596 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 106 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:01:36,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 172 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 02:01:36,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-12 02:01:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2024-11-12 02:01:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 02:01:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2024-11-12 02:01:36,644 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 157 [2024-11-12 02:01:36,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:01:36,645 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2024-11-12 02:01:36,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-12 02:01:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2024-11-12 02:01:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 02:01:36,651 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:36,652 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:01:36,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 02:01:36,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:01:36,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:36,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:36,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1861951935, now seen corresponding path program 1 times [2024-11-12 02:01:36,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:01:36,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992196950] [2024-11-12 02:01:36,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:36,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:01:36,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:01:36,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:01:36,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 02:01:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:37,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 02:01:37,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:01:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 534 proven. 21 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2024-11-12 02:01:37,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:01:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-12 02:01:37,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:01:37,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992196950] [2024-11-12 02:01:37,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992196950] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:01:37,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 02:01:37,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-12 02:01:37,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422109228] [2024-11-12 02:01:37,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 02:01:37,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 02:01:37,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:01:37,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 02:01:37,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 02:01:37,591 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 02:01:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:01:39,043 INFO L93 Difference]: Finished difference Result 216 states and 305 transitions. [2024-11-12 02:01:39,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 02:01:39,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 158 [2024-11-12 02:01:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:01:39,050 INFO L225 Difference]: With dead ends: 216 [2024-11-12 02:01:39,050 INFO L226 Difference]: Without dead ends: 148 [2024-11-12 02:01:39,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-12 02:01:39,055 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 134 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 02:01:39,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 325 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 02:01:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-12 02:01:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2024-11-12 02:01:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 71 states have internal predecessors, (78), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 02:01:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 178 transitions. [2024-11-12 02:01:39,097 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 178 transitions. Word has length 158 [2024-11-12 02:01:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:01:39,099 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 178 transitions. [2024-11-12 02:01:39,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 02:01:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 178 transitions. [2024-11-12 02:01:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 02:01:39,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:39,101 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:01:39,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 02:01:39,301 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-11-12 02:01:39,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:39,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:39,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1860104893, now seen corresponding path program 1 times [2024-11-12 02:01:39,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:01:39,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686537359] [2024-11-12 02:01:39,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:39,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:01:39,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:01:39,307 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-11-12 02:01:39,309 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-11-12 02:01:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:39,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 02:01:39,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:02:13,223 WARN L286 SmtUtils]: Spent 11.79s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 02:02:41,179 WARN L286 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)