./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-94.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 2a608cf192602c8fc9805ca3f1921f73fd52102f794f7be756023df45e8b0a1c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:58:37,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:58:37,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:58:37,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:58:37,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:58:37,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:58:37,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:58:37,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:58:37,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:58:37,907 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:58:37,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:58:37,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:58:37,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:58:37,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:58:37,909 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:58:37,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:58:37,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:58:37,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:58:37,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:58:37,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:58:37,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:58:37,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:58:37,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:58:37,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:58:37,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:58:37,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:58:37,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:58:37,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:58:37,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:58:37,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:58:37,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:58:37,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:58:37,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:58:37,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:58:37,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:58:37,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:58:37,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:58:37,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:58:37,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:58:37,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:58:37,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:58:37,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:58:37,917 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 -> 2a608cf192602c8fc9805ca3f1921f73fd52102f794f7be756023df45e8b0a1c [2024-10-14 07:58:38,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:58:38,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:58:38,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:58:38,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:58:38,214 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:58:38,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-94.i [2024-10-14 07:58:39,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:58:40,015 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:58:40,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-94.i [2024-10-14 07:58:40,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663f47f33/e34a78d66991474493db8f020630fdcb/FLAG779740bf9 [2024-10-14 07:58:40,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663f47f33/e34a78d66991474493db8f020630fdcb [2024-10-14 07:58:40,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:58:40,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:58:40,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:58:40,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:58:40,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:58:40,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2c7f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40, skipping insertion in model container [2024-10-14 07:58:40,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:58:40,274 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-94.i[913,926] [2024-10-14 07:58:40,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:58:40,347 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:58:40,364 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-94.i[913,926] [2024-10-14 07:58:40,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:58:40,442 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:58:40,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40 WrapperNode [2024-10-14 07:58:40,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:58:40,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:58:40,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:58:40,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:58:40,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,522 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-10-14 07:58:40,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:58:40,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:58:40,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:58:40,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:58:40,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,579 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:58:40,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:58:40,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:58:40,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:58:40,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:58:40,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40" (1/1) ... [2024-10-14 07:58:40,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:58:40,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:58:40,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:58:40,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:58:40,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:58:40,693 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:58:40,693 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:58:40,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:58:40,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:58:40,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:58:40,767 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:58:40,769 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:58:41,143 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 07:58:41,143 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:58:41,183 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:58:41,183 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:58:41,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:58:41 BoogieIcfgContainer [2024-10-14 07:58:41,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:58:41,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:58:41,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:58:41,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:58:41,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:58:40" (1/3) ... [2024-10-14 07:58:41,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5792fc6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:58:41, skipping insertion in model container [2024-10-14 07:58:41,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:40" (2/3) ... [2024-10-14 07:58:41,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5792fc6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:58:41, skipping insertion in model container [2024-10-14 07:58:41,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:58:41" (3/3) ... [2024-10-14 07:58:41,194 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-94.i [2024-10-14 07:58:41,211 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:58:41,212 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:58:41,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:58:41,293 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;@1d7a8ca3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:58:41,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:58:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 07:58:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 07:58:41,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:58:41,319 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:58:41,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:58:41,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:58:41,325 INFO L85 PathProgramCache]: Analyzing trace with hash -387117862, now seen corresponding path program 1 times [2024-10-14 07:58:41,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:58:41,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678063968] [2024-10-14 07:58:41,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:58:41,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:58:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:58:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:58:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:58:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:58:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:58:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:58:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:58:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:58:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:58:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:58:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:58:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 07:58:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 07:58:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 07:58:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 07:58:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:58:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 07:58:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:58:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 07:58:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:58:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 07:58:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 07:58:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 07:58:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 07:58:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 07:58:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:58:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 07:58:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 07:58:41,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:58:41,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678063968] [2024-10-14 07:58:41,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678063968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:58:41,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:58:41,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:58:41,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845590938] [2024-10-14 07:58:41,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:58:41,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:58:41,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:58:41,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:58:41,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:58:41,916 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 07:58:41,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:58:41,972 INFO L93 Difference]: Finished difference Result 139 states and 245 transitions. [2024-10-14 07:58:41,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:58:41,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 166 [2024-10-14 07:58:41,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:58:41,986 INFO L225 Difference]: With dead ends: 139 [2024-10-14 07:58:41,986 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 07:58:41,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:58:41,997 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:58:42,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:58:42,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 07:58:42,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-14 07:58:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 07:58:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 105 transitions. [2024-10-14 07:58:42,055 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 105 transitions. Word has length 166 [2024-10-14 07:58:42,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:58:42,056 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 105 transitions. [2024-10-14 07:58:42,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 07:58:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 105 transitions. [2024-10-14 07:58:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 07:58:42,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:58:42,061 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:58:42,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:58:42,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:58:42,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:58:42,063 INFO L85 PathProgramCache]: Analyzing trace with hash 813548556, now seen corresponding path program 1 times [2024-10-14 07:58:42,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:58:42,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474767759] [2024-10-14 07:58:42,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:58:42,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:58:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:58:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:58:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:58:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:58:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:58:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:58:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:58:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:58:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:58:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:58:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:58:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 07:58:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 07:58:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 07:58:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 07:58:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:58:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 07:58:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:58:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 07:58:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:58:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 07:58:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 07:58:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 07:58:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 07:58:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 07:58:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:58:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 07:58:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 07:58:42,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:58:42,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474767759] [2024-10-14 07:58:42,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474767759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:58:42,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:58:42,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:58:42,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687078895] [2024-10-14 07:58:42,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:58:42,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:58:42,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:58:42,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:58:42,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:58:42,660 INFO L87 Difference]: Start difference. First operand 69 states and 105 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 07:58:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:58:42,736 INFO L93 Difference]: Finished difference Result 205 states and 313 transitions. [2024-10-14 07:58:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:58:42,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 166 [2024-10-14 07:58:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:58:42,740 INFO L225 Difference]: With dead ends: 205 [2024-10-14 07:58:42,740 INFO L226 Difference]: Without dead ends: 137 [2024-10-14 07:58:42,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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-10-14 07:58:42,742 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:58:42,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 204 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:58:42,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-14 07:58:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-10-14 07:58:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 77 states have internal predecessors, (96), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 07:58:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 204 transitions. [2024-10-14 07:58:42,780 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 204 transitions. Word has length 166 [2024-10-14 07:58:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:58:42,780 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 204 transitions. [2024-10-14 07:58:42,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 07:58:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 204 transitions. [2024-10-14 07:58:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-14 07:58:42,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:58:42,787 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:58:42,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:58:42,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:58:42,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:58:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2098977014, now seen corresponding path program 1 times [2024-10-14 07:58:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:58:42,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139146156] [2024-10-14 07:58:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:58:42,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:58:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:58:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:58:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:58:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:58:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:58:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:58:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:58:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:58:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:58:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:58:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:58:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 07:58:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 07:58:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 07:58:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 07:58:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:58:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 07:58:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:58:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 07:58:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:58:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 07:58:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 07:58:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 07:58:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 07:58:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 07:58:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:58:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 07:58:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 07:58:43,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:58:43,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139146156] [2024-10-14 07:58:43,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139146156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:58:43,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:58:43,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:58:43,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658415979] [2024-10-14 07:58:43,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:58:43,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:58:43,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:58:43,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:58:43,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:58:43,497 INFO L87 Difference]: Start difference. First operand 134 states and 204 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 07:58:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:58:43,768 INFO L93 Difference]: Finished difference Result 435 states and 661 transitions. [2024-10-14 07:58:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:58:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 167 [2024-10-14 07:58:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:58:43,781 INFO L225 Difference]: With dead ends: 435 [2024-10-14 07:58:43,783 INFO L226 Difference]: Without dead ends: 302 [2024-10-14 07:58:43,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:58:43,786 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 99 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:58:43,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 311 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:58:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-14 07:58:43,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 290. [2024-10-14 07:58:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 177 states have (on average 1.265536723163842) internal successors, (224), 177 states have internal predecessors, (224), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-14 07:58:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 440 transitions. [2024-10-14 07:58:43,863 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 440 transitions. Word has length 167 [2024-10-14 07:58:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:58:43,865 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 440 transitions. [2024-10-14 07:58:43,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 07:58:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 440 transitions. [2024-10-14 07:58:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 07:58:43,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:58:43,870 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:58:43,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:58:43,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:58:43,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:58:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash -38574110, now seen corresponding path program 1 times [2024-10-14 07:58:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:58:43,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213383823] [2024-10-14 07:58:43,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:58:43,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:58:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:58:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:58:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:58:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:58:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:58:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:58:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:58:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:58:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:58:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:58:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:58:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 07:58:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 07:58:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 07:58:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 07:58:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:58:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 07:58:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:58:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 07:58:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:58:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 07:58:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 07:58:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 07:58:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 07:58:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 07:58:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:58:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 07:58:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-14 07:58:44,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:58:44,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213383823] [2024-10-14 07:58:44,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213383823] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:58:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111214943] [2024-10-14 07:58:44,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:58:44,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:58:44,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:58:44,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:58:44,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 07:58:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:44,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 07:58:44,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:58:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-10-14 07:58:45,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:58:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-14 07:58:45,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111214943] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:58:45,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 07:58:45,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-14 07:58:45,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972944000] [2024-10-14 07:58:45,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 07:58:45,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 07:58:45,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:58:45,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 07:58:45,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:58:45,436 INFO L87 Difference]: Start difference. First operand 290 states and 440 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-10-14 07:58:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:58:46,205 INFO L93 Difference]: Finished difference Result 921 states and 1371 transitions. [2024-10-14 07:58:46,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 07:58:46,206 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 169 [2024-10-14 07:58:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:58:46,216 INFO L225 Difference]: With dead ends: 921 [2024-10-14 07:58:46,219 INFO L226 Difference]: Without dead ends: 632 [2024-10-14 07:58:46,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 388 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2024-10-14 07:58:46,223 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 175 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:58:46,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 341 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 07:58:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-10-14 07:58:46,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 306. [2024-10-14 07:58:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 189 states have (on average 1.216931216931217) internal successors, (230), 189 states have internal predecessors, (230), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-14 07:58:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 446 transitions. [2024-10-14 07:58:46,332 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 446 transitions. Word has length 169 [2024-10-14 07:58:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:58:46,333 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 446 transitions. [2024-10-14 07:58:46,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-10-14 07:58:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 446 transitions. [2024-10-14 07:58:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 07:58:46,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:58:46,336 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:58:46,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 07:58:46,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:58:46,538 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:58:46,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:58:46,539 INFO L85 PathProgramCache]: Analyzing trace with hash -625380124, now seen corresponding path program 1 times [2024-10-14 07:58:46,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:58:46,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675413508] [2024-10-14 07:58:46,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:58:46,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:58:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:58:46,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [854151829] [2024-10-14 07:58:46,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:58:46,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:58:46,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:58:46,678 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:58:46,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 07:58:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:58:47,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:58:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:58:47,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:58:47,451 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:58:47,452 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:58:47,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 07:58:47,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:58:47,658 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 07:58:47,765 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:58:47,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:58:47 BoogieIcfgContainer [2024-10-14 07:58:47,770 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:58:47,771 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:58:47,771 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:58:47,771 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:58:47,772 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:58:41" (3/4) ... [2024-10-14 07:58:47,773 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:58:47,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:58:47,776 INFO L158 Benchmark]: Toolchain (without parser) took 7725.27ms. Allocated memory was 153.1MB in the beginning and 262.1MB in the end (delta: 109.1MB). Free memory was 85.9MB in the beginning and 139.5MB in the end (delta: -53.5MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2024-10-14 07:58:47,776 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:58:47,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.01ms. Allocated memory is still 153.1MB. Free memory was 127.9MB in the beginning and 111.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 07:58:47,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.98ms. Allocated memory is still 153.1MB. Free memory was 111.1MB in the beginning and 106.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:58:47,777 INFO L158 Benchmark]: Boogie Preprocessor took 93.19ms. Allocated memory is still 153.1MB. Free memory was 106.9MB in the beginning and 99.1MB in the end (delta: 7.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 07:58:47,777 INFO L158 Benchmark]: RCFGBuilder took 566.21ms. Allocated memory is still 153.1MB. Free memory was 98.6MB in the beginning and 70.7MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-14 07:58:47,777 INFO L158 Benchmark]: TraceAbstraction took 6583.88ms. Allocated memory was 153.1MB in the beginning and 262.1MB in the end (delta: 109.1MB). Free memory was 70.2MB in the beginning and 139.5MB in the end (delta: -69.3MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2024-10-14 07:58:47,777 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 262.1MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:58:47,779 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.11ms. Allocated memory is still 104.9MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.01ms. Allocated memory is still 153.1MB. Free memory was 127.9MB in the beginning and 111.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.98ms. Allocated memory is still 153.1MB. Free memory was 111.1MB in the beginning and 106.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.19ms. Allocated memory is still 153.1MB. Free memory was 106.9MB in the beginning and 99.1MB in the end (delta: 7.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 566.21ms. Allocated memory is still 153.1MB. Free memory was 98.6MB in the beginning and 70.7MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6583.88ms. Allocated memory was 153.1MB in the beginning and 262.1MB in the end (delta: 109.1MB). Free memory was 70.2MB in the beginning and 139.5MB in the end (delta: -69.3MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 262.1MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of shiftLeft at line 138, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 1; [L24] unsigned char var_1_6 = 1; [L25] unsigned char var_1_7 = 0; [L26] signed long int var_1_8 = 50; [L27] double var_1_9 = 32.7; [L28] double var_1_10 = 64.25; [L29] double var_1_11 = 10.3; [L30] double var_1_12 = 3.3; [L31] double var_1_13 = 16.5; [L32] double var_1_14 = 7.125; [L33] unsigned short int var_1_15 = 50; [L34] unsigned short int var_1_16 = 16; [L35] unsigned short int var_1_17 = 8; [L36] unsigned short int var_1_18 = 64; [L37] unsigned long int var_1_19 = 16; [L38] signed short int var_1_20 = 100; [L39] signed short int var_1_21 = 2; [L40] signed short int var_1_22 = 8; [L41] signed long int var_1_23 = -4; [L42] unsigned short int var_1_24 = 128; [L43] signed long int var_1_25 = 2; [L44] unsigned short int var_1_26 = 256; [L45] unsigned char var_1_27 = 0; [L46] signed long int last_1_var_1_8 = 50; [L47] unsigned long int last_1_var_1_19 = 16; [L48] unsigned char last_1_var_1_27 = 0; [L142] isInitial = 1 [L143] FCALL initially() [L144] COND TRUE 1 [L145] CALL updateLastVariables() [L133] last_1_var_1_8 = var_1_8 [L134] last_1_var_1_19 = var_1_19 [L135] last_1_var_1_27 = var_1_27 [L145] RET updateLastVariables() [L146] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L90] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L91] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L91] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L92] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L92] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L93] var_1_6 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L94] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L95] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L95] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L96] var_1_7 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_8=50, var_1_9=327/10] [L97] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_8=50, var_1_9=327/10] [L98] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L98] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L99] var_1_10 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L100] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L101] var_1_11 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L102] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L103] var_1_12 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_12 >= -230584.3009213691390e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L104] RET assume_abort_if_not((var_1_12 >= -230584.3009213691390e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L105] var_1_13 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L106] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L107] var_1_14 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L108] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L109] var_1_16 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L110] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L111] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L111] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L112] var_1_17 = __VERIFIER_nondet_ushort() [L113] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L113] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L114] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L114] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L115] var_1_18 = __VERIFIER_nondet_ushort() [L116] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L116] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L117] CALL assume_abort_if_not(var_1_18 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L117] RET assume_abort_if_not(var_1_18 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L118] var_1_20 = __VERIFIER_nondet_short() [L119] CALL assume_abort_if_not(var_1_20 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L119] RET assume_abort_if_not(var_1_20 >= -1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L120] CALL assume_abort_if_not(var_1_20 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L120] RET assume_abort_if_not(var_1_20 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L121] var_1_21 = __VERIFIER_nondet_short() [L122] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L122] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L123] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L123] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L124] var_1_22 = __VERIFIER_nondet_short() [L125] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L125] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L126] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L126] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L127] var_1_24 = __VERIFIER_nondet_ushort() [L128] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L128] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L129] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L129] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L130] CALL assume_abort_if_not(var_1_24 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=-65534, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=-65534, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L130] RET assume_abort_if_not(var_1_24 != 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=-65534, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L146] RET updateVariables() [L147] CALL step() [L52] EXPR -1 << last_1_var_1_19 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=-65534, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L52] signed long int stepLocal_1 = -1 << last_1_var_1_19; [L53] unsigned long int stepLocal_0 = -1000000000 + last_1_var_1_19; VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, stepLocal_0=-999999984, stepLocal_1=2, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=-65534, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L54] COND TRUE stepLocal_1 < var_1_3 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, stepLocal_0=-999999984, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=-65534, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L55] COND FALSE !((last_1_var_1_19 / var_1_3) > stepLocal_0) [L58] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=-256, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=-65534, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50, var_1_9=327/10] [L61] var_1_9 = (((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))) + (var_1_12 + (var_1_13 - var_1_14))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=-256, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=-65534, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50] [L62] COND TRUE var_1_10 >= var_1_11 [L63] var_1_15 = ((((((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) > (var_1_18)) ? (((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) : (var_1_18))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=-256, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=-65534, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50] [L65] var_1_25 = -256 [L66] var_1_26 = var_1_17 [L67] var_1_27 = var_1_6 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=-256, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=-65534, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50] [L68] COND FALSE !(var_1_7 || var_1_1) [L79] var_1_8 = last_1_var_1_8 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=-256, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=-4, var_1_24=-65534, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50] [L81] COND TRUE var_1_6 || (var_1_16 <= (var_1_22 / var_1_24)) [L82] var_1_23 = (((((var_1_8 + (var_1_21 + var_1_24))) < (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((var_1_8 + (var_1_21 + var_1_24))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=16, var_1_1=-256, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=2, var_1_24=-65534, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50] [L84] COND TRUE (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) - var_1_22) >= var_1_23 [L85] var_1_19 = ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=2, var_1_1=-256, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=2, var_1_24=-65534, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50] [L147] RET step() [L148] CALL, EXPR property() [L138] EXPR -1 << last_1_var_1_19 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=2, var_1_1=-256, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=2, var_1_24=-65534, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50] [L138-L139] return ((((((((((-1 << last_1_var_1_19) < var_1_3) ? (((last_1_var_1_19 / var_1_3) > (-1000000000 + last_1_var_1_19)) ? (var_1_1 == ((unsigned char) (last_1_var_1_27 || var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) : 1) && ((var_1_7 || var_1_1) ? (((var_1_26 >= var_1_3) && var_1_1) ? (var_1_8 == ((signed long int) ((((var_1_3) < (var_1_26)) ? (var_1_3) : (var_1_26))))) : (var_1_1 ? (var_1_8 == ((signed long int) last_1_var_1_8)) : (var_1_8 == ((signed long int) last_1_var_1_8)))) : (var_1_8 == ((signed long int) last_1_var_1_8)))) && (var_1_9 == ((double) (((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))) + (var_1_12 + (var_1_13 - var_1_14)))))) && ((var_1_10 >= var_1_11) ? (var_1_15 == ((unsigned short int) ((((((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) > (var_1_18)) ? (((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) : (var_1_18))))) : 1)) && (((((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) - var_1_22) >= var_1_23) ? (var_1_19 == ((unsigned long int) ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_6 || (var_1_16 <= (var_1_22 / var_1_24))) ? (var_1_23 == ((signed long int) (((((var_1_8 + (var_1_21 + var_1_24))) < (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((var_1_8 + (var_1_21 + var_1_24))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))))) : 1)) && (var_1_25 == ((signed long int) -256))) && (var_1_26 == ((unsigned short int) var_1_17))) && (var_1_27 == ((unsigned char) var_1_6)) ; [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=2, var_1_1=-256, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=2, var_1_24=-65534, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=131072, var_1_17=65537, var_1_18=-65534, var_1_19=2, var_1_1=-256, var_1_20=0, var_1_21=3, var_1_22=1, var_1_23=2, var_1_24=-65534, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=4, var_1_6=-255, var_1_7=-256, var_1_8=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 330 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 325 mSDsluCounter, 958 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 565 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 372 IncrementalHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 393 mSDtfsCounter, 372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 613 GetRequests, 584 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 341 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1175 NumberOfCodeBlocks, 1175 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1000 ConstructedInterpolants, 0 QuantifiedInterpolants, 3303 SizeOfPredicates, 4 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 8217/8424 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 07:58:47,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-94.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 2a608cf192602c8fc9805ca3f1921f73fd52102f794f7be756023df45e8b0a1c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:58:50,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:58:50,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:58:50,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:58:50,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:58:50,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:58:50,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:58:50,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:58:50,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:58:50,189 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:58:50,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:58:50,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:58:50,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:58:50,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:58:50,191 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:58:50,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:58:50,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:58:50,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:58:50,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:58:50,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:58:50,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:58:50,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:58:50,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:58:50,200 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:58:50,200 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:58:50,200 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:58:50,201 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:58:50,201 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:58:50,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:58:50,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:58:50,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:58:50,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:58:50,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:58:50,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:58:50,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:58:50,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:58:50,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:58:50,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:58:50,214 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:58:50,214 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:58:50,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:58:50,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:58:50,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:58:50,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:58:50,218 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:58:50,218 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 -> 2a608cf192602c8fc9805ca3f1921f73fd52102f794f7be756023df45e8b0a1c [2024-10-14 07:58:50,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:58:50,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:58:50,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:58:50,555 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:58:50,556 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:58:50,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-94.i [2024-10-14 07:58:52,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:58:52,418 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:58:52,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-94.i [2024-10-14 07:58:52,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd80e1c4/f000c1d24054424598c7b43a2e7fc94f/FLAG18a7af5bb [2024-10-14 07:58:52,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd80e1c4/f000c1d24054424598c7b43a2e7fc94f [2024-10-14 07:58:52,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:58:52,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:58:52,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:58:52,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:58:52,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:58:52,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:52,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a35b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52, skipping insertion in model container [2024-10-14 07:58:52,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:52,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:58:52,680 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-94.i[913,926] [2024-10-14 07:58:52,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:58:52,789 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:58:52,801 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-94.i[913,926] [2024-10-14 07:58:52,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:58:52,866 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:58:52,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52 WrapperNode [2024-10-14 07:58:52,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:58:52,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:58:52,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:58:52,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:58:52,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:52,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:52,927 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-10-14 07:58:52,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:58:52,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:58:52,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:58:52,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:58:52,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:52,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:52,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:52,966 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:58:52,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:52,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:52,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:52,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:52,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:52,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:52,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:58:52,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:58:52,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:58:52,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:58:52,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52" (1/1) ... [2024-10-14 07:58:53,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:58:53,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:58:53,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:58:53,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:58:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:58:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:58:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:58:53,073 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:58:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:58:53,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:58:53,175 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:58:53,177 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:58:56,225 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 07:58:56,226 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:58:56,311 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:58:56,311 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:58:56,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:58:56 BoogieIcfgContainer [2024-10-14 07:58:56,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:58:56,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:58:56,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:58:56,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:58:56,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:58:52" (1/3) ... [2024-10-14 07:58:56,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422394bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:58:56, skipping insertion in model container [2024-10-14 07:58:56,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:52" (2/3) ... [2024-10-14 07:58:56,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422394bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:58:56, skipping insertion in model container [2024-10-14 07:58:56,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:58:56" (3/3) ... [2024-10-14 07:58:56,323 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-94.i [2024-10-14 07:58:56,341 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:58:56,341 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:58:56,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:58:56,433 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;@50a5204f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:58:56,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:58:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 07:58:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 07:58:56,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:58:56,460 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:58:56,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:58:56,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:58:56,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1209995648, now seen corresponding path program 1 times [2024-10-14 07:58:56,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:58:56,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797680209] [2024-10-14 07:58:56,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:58:56,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:58:56,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:58:56,488 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:58:56,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 07:58:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:56,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:58:56,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:58:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2024-10-14 07:58:57,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:58:57,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:58:57,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797680209] [2024-10-14 07:58:57,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797680209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:58:57,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:58:57,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:58:57,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849261965] [2024-10-14 07:58:57,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:58:57,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:58:57,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:58:57,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:58:57,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:58:57,066 INFO L87 Difference]: Start difference. First operand has 65 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 07:58:59,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:58:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:58:59,102 INFO L93 Difference]: Finished difference Result 127 states and 229 transitions. [2024-10-14 07:58:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:58:59,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 162 [2024-10-14 07:58:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:58:59,138 INFO L225 Difference]: With dead ends: 127 [2024-10-14 07:58:59,139 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 07:58:59,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:58:59,145 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:58:59,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 07:58:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 07:58:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-14 07:58:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 07:58:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-14 07:58:59,198 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 162 [2024-10-14 07:58:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:58:59,200 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-14 07:58:59,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 07:58:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-14 07:58:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 07:58:59,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:58:59,206 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:58:59,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 07:58:59,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:58:59,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:58:59,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:58:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1174457934, now seen corresponding path program 1 times [2024-10-14 07:58:59,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:58:59,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572885799] [2024-10-14 07:58:59,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:58:59,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:58:59,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:58:59,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:58:59,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 07:58:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:58:59,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 07:58:59,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:59:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 07:59:01,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:59:01,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:59:01,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572885799] [2024-10-14 07:59:01,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572885799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:01,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:01,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:59:01,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733484553] [2024-10-14 07:59:01,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:01,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:59:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:59:01,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:59:01,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:59:01,472 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 07:59:05,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:59:08,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:59:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:08,471 INFO L93 Difference]: Finished difference Result 193 states and 295 transitions. [2024-10-14 07:59:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:59:08,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 162 [2024-10-14 07:59:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:08,510 INFO L225 Difference]: With dead ends: 193 [2024-10-14 07:59:08,510 INFO L226 Difference]: Without dead ends: 131 [2024-10-14 07:59:08,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:59:08,512 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 63 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:08,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 371 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-10-14 07:59:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-14 07:59:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2024-10-14 07:59:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 07:59:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 191 transitions. [2024-10-14 07:59:08,551 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 191 transitions. Word has length 162 [2024-10-14 07:59:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:08,552 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 191 transitions. [2024-10-14 07:59:08,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 07:59:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 191 transitions. [2024-10-14 07:59:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-14 07:59:08,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:08,556 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:59:08,574 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-10-14 07:59:08,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:59:08,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:08,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:08,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2126088414, now seen corresponding path program 1 times [2024-10-14 07:59:08,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:59:08,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567641696] [2024-10-14 07:59:08,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:08,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:59:08,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:59:08,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:59:08,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 07:59:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:09,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 07:59:09,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:59:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-10-14 07:59:10,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:59:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-14 07:59:11,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:59:11,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567641696] [2024-10-14 07:59:11,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567641696] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:59:11,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:59:11,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-14 07:59:11,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327766077] [2024-10-14 07:59:11,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:59:11,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:59:11,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:59:11,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:59:11,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:59:11,471 INFO L87 Difference]: Start difference. First operand 123 states and 191 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-10-14 07:59:14,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:59:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:15,958 INFO L93 Difference]: Finished difference Result 519 states and 781 transitions. [2024-10-14 07:59:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 07:59:15,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 163 [2024-10-14 07:59:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:15,966 INFO L225 Difference]: With dead ends: 519 [2024-10-14 07:59:15,967 INFO L226 Difference]: Without dead ends: 397 [2024-10-14 07:59:15,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2024-10-14 07:59:15,972 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 149 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:15,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 270 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-14 07:59:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-14 07:59:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 202. [2024-10-14 07:59:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 114 states have internal predecessors, (137), 81 states have call successors, (81), 6 states have call predecessors, (81), 6 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-14 07:59:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 299 transitions. [2024-10-14 07:59:16,039 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 299 transitions. Word has length 163 [2024-10-14 07:59:16,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:16,040 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 299 transitions. [2024-10-14 07:59:16,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-10-14 07:59:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 299 transitions. [2024-10-14 07:59:16,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-14 07:59:16,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:16,043 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:59:16,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 07:59:16,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:59:16,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:16,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1733061404, now seen corresponding path program 1 times [2024-10-14 07:59:16,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:59:16,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538847359] [2024-10-14 07:59:16,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:16,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:59:16,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:59:16,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:59:16,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 07:59:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:17,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-14 07:59:17,428 INFO L278 TraceCheckSpWp]: Computing forward predicates...