./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-44.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 b3f491be311d516ac29ae462a7a199efc119d94755d350a220914a37d6ecf4d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:06:42,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:06:42,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:06:42,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:06:42,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:06:42,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:06:42,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:06:42,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:06:42,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:06:42,872 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:06:42,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:06:42,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:06:42,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:06:42,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:06:42,872 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:06:42,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:06:42,873 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:06:42,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:06:42,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:06:42,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:06:42,874 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:06:42,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:06:42,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:06:42,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:06:42,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:06:42,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:06:42,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:06:42,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:06:42,875 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> b3f491be311d516ac29ae462a7a199efc119d94755d350a220914a37d6ecf4d9 [2025-03-08 15:06:43,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:06:43,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:06:43,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:06:43,078 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:06:43,078 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:06:43,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-44.i [2025-03-08 15:06:44,206 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/640f4e72a/e3faee4ade36446a81e0a19d543db697/FLAG61a8df769 [2025-03-08 15:06:44,458 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:06:44,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-44.i [2025-03-08 15:06:44,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/640f4e72a/e3faee4ade36446a81e0a19d543db697/FLAG61a8df769 [2025-03-08 15:06:44,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/640f4e72a/e3faee4ade36446a81e0a19d543db697 [2025-03-08 15:06:44,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:06:44,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:06:44,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:06:44,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:06:44,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:06:44,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18290ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44, skipping insertion in model container [2025-03-08 15:06:44,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:06:44,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-44.i[916,929] [2025-03-08 15:06:44,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:06:44,708 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:06:44,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-44.i[916,929] [2025-03-08 15:06:44,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:06:44,774 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:06:44,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44 WrapperNode [2025-03-08 15:06:44,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:06:44,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:06:44,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:06:44,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:06:44,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,833 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 338 [2025-03-08 15:06:44,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:06:44,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:06:44,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:06:44,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:06:44,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,871 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]. [2025-03-08 15:06:44,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:06:44,903 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:06:44,904 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:06:44,907 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:06:44,909 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44" (1/1) ... [2025-03-08 15:06:44,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:06:44,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:06:44,934 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) [2025-03-08 15:06:44,936 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 [2025-03-08 15:06:44,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:06:44,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:06:44,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:06:44,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:06:44,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:06:44,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:06:45,014 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:06:45,015 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:06:45,361 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L190: havoc property_#t~ite34#1;havoc property_#t~bitwise30#1;havoc property_#t~ite33#1;havoc property_#t~ite32#1;havoc property_#t~bitwise31#1;havoc property_#t~short35#1;havoc property_#t~ite42#1;havoc property_#t~ite37#1;havoc property_#t~bitwise36#1;havoc property_#t~bitwise38#1;havoc property_#t~ite41#1;havoc property_#t~ite40#1;havoc property_#t~bitwise39#1;havoc property_#t~short43#1; [2025-03-08 15:06:45,397 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-03-08 15:06:45,398 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:06:45,419 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:06:45,421 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:06:45,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:06:45 BoogieIcfgContainer [2025-03-08 15:06:45,422 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:06:45,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:06:45,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:06:45,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:06:45,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:06:44" (1/3) ... [2025-03-08 15:06:45,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2d0229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:06:45, skipping insertion in model container [2025-03-08 15:06:45,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:44" (2/3) ... [2025-03-08 15:06:45,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2d0229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:06:45, skipping insertion in model container [2025-03-08 15:06:45,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:06:45" (3/3) ... [2025-03-08 15:06:45,429 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-44.i [2025-03-08 15:06:45,439 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:06:45,440 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-44.i that has 2 procedures, 144 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:06:45,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:06:45,492 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;@57d99fdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:06:45,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:06:45,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 109 states have internal predecessors, (153), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 15:06:45,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-08 15:06:45,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:06:45,509 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:06:45,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:06:45,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:06:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash 673703252, now seen corresponding path program 1 times [2025-03-08 15:06:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:06:45,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182776230] [2025-03-08 15:06:45,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:06:45,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:06:45,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-08 15:06:45,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-08 15:06:45,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:45,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:06:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 15:06:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:06:45,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182776230] [2025-03-08 15:06:45,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182776230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:06:45,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687415903] [2025-03-08 15:06:45,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:06:45,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:06:45,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:06:45,864 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) [2025-03-08 15:06:45,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:06:45,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-08 15:06:46,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-08 15:06:46,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:46,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:06:46,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:06:46,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:06:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 15:06:46,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:06:46,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687415903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:06:46,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:06:46,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:06:46,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085748166] [2025-03-08 15:06:46,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:06:46,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:06:46,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:06:46,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:06:46,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:06:46,072 INFO L87 Difference]: Start difference. First operand has 144 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 109 states have internal predecessors, (153), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 15:06:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:06:46,117 INFO L93 Difference]: Finished difference Result 277 states and 458 transitions. [2025-03-08 15:06:46,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:06:46,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 219 [2025-03-08 15:06:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:06:46,126 INFO L225 Difference]: With dead ends: 277 [2025-03-08 15:06:46,126 INFO L226 Difference]: Without dead ends: 136 [2025-03-08 15:06:46,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:06:46,133 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:06:46,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:06:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-08 15:06:46,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-08 15:06:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 15:06:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 204 transitions. [2025-03-08 15:06:46,167 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 204 transitions. Word has length 219 [2025-03-08 15:06:46,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:06:46,167 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 204 transitions. [2025-03-08 15:06:46,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 15:06:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 204 transitions. [2025-03-08 15:06:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-08 15:06:46,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:06:46,170 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:06:46,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:06:46,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:06:46,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:06:46,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:06:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash 457998515, now seen corresponding path program 1 times [2025-03-08 15:06:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:06:46,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477559091] [2025-03-08 15:06:46,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:06:46,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:06:46,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-08 15:06:46,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-08 15:06:46,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:46,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:06:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 15:06:47,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:06:47,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477559091] [2025-03-08 15:06:47,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477559091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:06:47,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:06:47,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:06:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870083470] [2025-03-08 15:06:47,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:06:47,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:06:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:06:47,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:06:47,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:06:47,272 INFO L87 Difference]: Start difference. First operand 136 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 15:06:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:06:47,506 INFO L93 Difference]: Finished difference Result 281 states and 420 transitions. [2025-03-08 15:06:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:06:47,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 219 [2025-03-08 15:06:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:06:47,510 INFO L225 Difference]: With dead ends: 281 [2025-03-08 15:06:47,511 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 15:06:47,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:06:47,512 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 262 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:06:47,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 206 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:06:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 15:06:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2025-03-08 15:06:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 15:06:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 215 transitions. [2025-03-08 15:06:47,528 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 215 transitions. Word has length 219 [2025-03-08 15:06:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:06:47,528 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 215 transitions. [2025-03-08 15:06:47,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 15:06:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 215 transitions. [2025-03-08 15:06:47,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-08 15:06:47,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:06:47,531 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:06:47,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:06:47,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:06:47,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:06:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash 489018322, now seen corresponding path program 1 times [2025-03-08 15:06:47,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:06:47,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793686766] [2025-03-08 15:06:47,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:06:47,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:06:47,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-08 15:06:47,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-08 15:06:47,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:47,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:06:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 15:06:47,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:06:47,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793686766] [2025-03-08 15:06:47,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793686766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:06:47,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:06:47,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:06:47,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141467909] [2025-03-08 15:06:47,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:06:47,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:06:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:06:47,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:06:47,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:06:47,745 INFO L87 Difference]: Start difference. First operand 147 states and 215 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:06:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:06:47,778 INFO L93 Difference]: Finished difference Result 284 states and 416 transitions. [2025-03-08 15:06:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:06:47,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 219 [2025-03-08 15:06:47,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:06:47,784 INFO L225 Difference]: With dead ends: 284 [2025-03-08 15:06:47,784 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 15:06:47,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:06:47,785 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:06:47,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 188 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:06:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 15:06:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-08 15:06:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 107 states have (on average 1.308411214953271) internal successors, (140), 108 states have internal predecessors, (140), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 15:06:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 214 transitions. [2025-03-08 15:06:47,806 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 214 transitions. Word has length 219 [2025-03-08 15:06:47,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:06:47,807 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 214 transitions. [2025-03-08 15:06:47,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:06:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 214 transitions. [2025-03-08 15:06:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-08 15:06:47,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:06:47,811 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:06:47,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:06:47,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:06:47,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:06:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1497096870, now seen corresponding path program 1 times [2025-03-08 15:06:47,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:06:47,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322760203] [2025-03-08 15:06:47,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:06:47,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:06:47,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 15:06:47,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 15:06:47,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:47,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:06:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 15:06:48,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:06:48,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322760203] [2025-03-08 15:06:48,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322760203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:06:48,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:06:48,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:06:48,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291260753] [2025-03-08 15:06:48,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:06:48,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:06:48,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:06:48,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:06:48,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:06:48,007 INFO L87 Difference]: Start difference. First operand 147 states and 214 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:06:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:06:48,049 INFO L93 Difference]: Finished difference Result 284 states and 414 transitions. [2025-03-08 15:06:48,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:06:48,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 220 [2025-03-08 15:06:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:06:48,051 INFO L225 Difference]: With dead ends: 284 [2025-03-08 15:06:48,051 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 15:06:48,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:06:48,052 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:06:48,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:06:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 15:06:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-08 15:06:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 108 states have internal predecessors, (139), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 15:06:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 213 transitions. [2025-03-08 15:06:48,066 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 213 transitions. Word has length 220 [2025-03-08 15:06:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:06:48,067 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 213 transitions. [2025-03-08 15:06:48,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:06:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 213 transitions. [2025-03-08 15:06:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-08 15:06:48,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:06:48,069 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:06:48,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:06:48,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:06:48,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:06:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash 759814137, now seen corresponding path program 1 times [2025-03-08 15:06:48,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:06:48,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666258905] [2025-03-08 15:06:48,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:06:48,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:06:48,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 15:06:48,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 15:06:48,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:48,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:06:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 18 proven. 78 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-08 15:06:48,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:06:48,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666258905] [2025-03-08 15:06:48,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666258905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:06:48,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071750485] [2025-03-08 15:06:48,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:06:48,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:06:48,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:06:48,352 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) [2025-03-08 15:06:48,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:06:48,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 15:06:48,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 15:06:48,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:48,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:06:48,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:06:48,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:06:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 668 proven. 78 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2025-03-08 15:06:48,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:06:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 18 proven. 78 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-08 15:06:49,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071750485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:06:49,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:06:49,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 15:06:49,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183122082] [2025-03-08 15:06:49,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:06:49,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:06:49,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:06:49,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:06:49,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:06:49,066 INFO L87 Difference]: Start difference. First operand 147 states and 213 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 15:06:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:06:49,304 INFO L93 Difference]: Finished difference Result 298 states and 427 transitions. [2025-03-08 15:06:49,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:06:49,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 220 [2025-03-08 15:06:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:06:49,308 INFO L225 Difference]: With dead ends: 298 [2025-03-08 15:06:49,308 INFO L226 Difference]: Without dead ends: 161 [2025-03-08 15:06:49,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 437 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:06:49,309 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 103 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:06:49,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 419 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:06:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-08 15:06:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2025-03-08 15:06:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 112 states have internal predecessors, (141), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 15:06:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 219 transitions. [2025-03-08 15:06:49,333 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 219 transitions. Word has length 220 [2025-03-08 15:06:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:06:49,333 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 219 transitions. [2025-03-08 15:06:49,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 15:06:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 219 transitions. [2025-03-08 15:06:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-08 15:06:49,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:06:49,335 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:06:49,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:06:49,535 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 [2025-03-08 15:06:49,536 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:06:49,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:06:49,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1406488283, now seen corresponding path program 1 times [2025-03-08 15:06:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:06:49,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905396735] [2025-03-08 15:06:49,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:06:49,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:06:49,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-08 15:06:49,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-08 15:06:49,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:49,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:06:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 15:06:49,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:06:49,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905396735] [2025-03-08 15:06:49,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905396735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:06:49,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:06:49,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:06:49,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497069859] [2025-03-08 15:06:49,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:06:49,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:06:49,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:06:49,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:06:49,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:06:49,771 INFO L87 Difference]: Start difference. First operand 154 states and 219 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:06:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:06:50,252 INFO L93 Difference]: Finished difference Result 487 states and 694 transitions. [2025-03-08 15:06:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:06:50,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 222 [2025-03-08 15:06:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:06:50,255 INFO L225 Difference]: With dead ends: 487 [2025-03-08 15:06:50,255 INFO L226 Difference]: Without dead ends: 346 [2025-03-08 15:06:50,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:06:50,256 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 493 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:06:50,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 699 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:06:50,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-08 15:06:50,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 243. [2025-03-08 15:06:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 171 states have (on average 1.263157894736842) internal successors, (216), 172 states have internal predecessors, (216), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 15:06:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 348 transitions. [2025-03-08 15:06:50,294 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 348 transitions. Word has length 222 [2025-03-08 15:06:50,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:06:50,294 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 348 transitions. [2025-03-08 15:06:50,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:06:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 348 transitions. [2025-03-08 15:06:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-08 15:06:50,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:06:50,296 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:06:50,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:06:50,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:06:50,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:06:50,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1926864996, now seen corresponding path program 1 times [2025-03-08 15:06:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:06:50,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290946264] [2025-03-08 15:06:50,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:06:50,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:06:50,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-08 15:06:50,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-08 15:06:50,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:50,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:06:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 15:06:50,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:06:50,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290946264] [2025-03-08 15:06:50,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290946264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:06:50,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:06:50,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:06:50,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695656685] [2025-03-08 15:06:50,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:06:50,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:06:50,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:06:50,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:06:50,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:06:50,899 INFO L87 Difference]: Start difference. First operand 243 states and 348 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 15:06:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:06:51,180 INFO L93 Difference]: Finished difference Result 420 states and 599 transitions. [2025-03-08 15:06:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:06:51,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 222 [2025-03-08 15:06:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:06:51,184 INFO L225 Difference]: With dead ends: 420 [2025-03-08 15:06:51,184 INFO L226 Difference]: Without dead ends: 243 [2025-03-08 15:06:51,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:06:51,186 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 240 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:06:51,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 221 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:06:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-08 15:06:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 207. [2025-03-08 15:06:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 135 states have (on average 1.2074074074074075) internal successors, (163), 136 states have internal predecessors, (163), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 15:06:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 295 transitions. [2025-03-08 15:06:51,229 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 295 transitions. Word has length 222 [2025-03-08 15:06:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:06:51,229 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 295 transitions. [2025-03-08 15:06:51,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 15:06:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 295 transitions. [2025-03-08 15:06:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-08 15:06:51,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:06:51,233 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:06:51,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:06:51,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:06:51,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:06:51,234 INFO L85 PathProgramCache]: Analyzing trace with hash 865333360, now seen corresponding path program 1 times [2025-03-08 15:06:51,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:06:51,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521300200] [2025-03-08 15:06:51,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:06:51,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:06:51,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 15:06:51,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 15:06:51,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:51,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:06:51,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324577244] [2025-03-08 15:06:51,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:06:51,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:06:51,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:06:51,346 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:06:51,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:06:51,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 15:06:51,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 15:06:51,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:51,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:06:51,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 15:06:51,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:06:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 15:06:51,579 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:06:51,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:06:51,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521300200] [2025-03-08 15:06:51,579 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 15:06:51,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324577244] [2025-03-08 15:06:51,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324577244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:06:51,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:06:51,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:06:51,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503140536] [2025-03-08 15:06:51,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:06:51,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:06:51,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:06:51,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:06:51,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:06:51,582 INFO L87 Difference]: Start difference. First operand 207 states and 295 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:06:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:06:51,824 INFO L93 Difference]: Finished difference Result 489 states and 691 transitions. [2025-03-08 15:06:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:06:51,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 223 [2025-03-08 15:06:51,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:06:51,829 INFO L225 Difference]: With dead ends: 489 [2025-03-08 15:06:51,830 INFO L226 Difference]: Without dead ends: 348 [2025-03-08 15:06:51,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:06:51,833 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 172 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:06:51,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 915 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:06:51,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-08 15:06:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2025-03-08 15:06:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 238 states have (on average 1.23109243697479) internal successors, (293), 239 states have internal predecessors, (293), 99 states have call successors, (99), 8 states have call predecessors, (99), 8 states have return successors, (99), 98 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 15:06:51,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 491 transitions. [2025-03-08 15:06:51,881 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 491 transitions. Word has length 223 [2025-03-08 15:06:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:06:51,882 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 491 transitions. [2025-03-08 15:06:51,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:06:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 491 transitions. [2025-03-08 15:06:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-08 15:06:51,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:06:51,884 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:06:51,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:06:52,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:06:52,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:06:52,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:06:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash -942121103, now seen corresponding path program 1 times [2025-03-08 15:06:52,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:06:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405592076] [2025-03-08 15:06:52,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:06:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:06:52,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 15:06:52,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 15:06:52,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:52,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:06:52,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730913564] [2025-03-08 15:06:52,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:06:52,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:06:52,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:06:52,207 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:06:52,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:06:52,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 15:06:52,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 15:06:52,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:52,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:06:52,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:06:52,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 15:06:52,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 15:06:52,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:06:52,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:06:52,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:06:52,505 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:06:52,505 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:06:52,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 15:06:52,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:06:52,710 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:06:52,832 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:06:52,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:06:52 BoogieIcfgContainer [2025-03-08 15:06:52,836 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:06:52,837 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:06:52,837 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:06:52,837 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:06:52,838 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:06:45" (3/4) ... [2025-03-08 15:06:52,839 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:06:52,840 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:06:52,840 INFO L158 Benchmark]: Toolchain (without parser) took 8354.24ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 133.7MB in the beginning and 167.4MB in the end (delta: -33.7MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2025-03-08 15:06:52,841 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:06:52,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.48ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 116.7MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:06:52,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.62ms. Allocated memory is still 167.8MB. Free memory was 116.7MB in the beginning and 112.4MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:06:52,841 INFO L158 Benchmark]: Boogie Preprocessor took 68.31ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 106.7MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:06:52,842 INFO L158 Benchmark]: IcfgBuilder took 518.48ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 69.6MB in the end (delta: 37.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 15:06:52,843 INFO L158 Benchmark]: TraceAbstraction took 7413.08ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 69.1MB in the beginning and 167.5MB in the end (delta: -98.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:06:52,843 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 268.4MB. Free memory was 167.5MB in the beginning and 167.4MB in the end (delta: 83.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:06:52,844 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.48ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 116.7MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.62ms. Allocated memory is still 167.8MB. Free memory was 116.7MB in the beginning and 112.4MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.31ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 106.7MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 518.48ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 69.6MB in the end (delta: 37.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7413.08ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 69.1MB in the beginning and 167.5MB in the end (delta: -98.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 268.4MB. Free memory was 167.5MB in the beginning and 167.4MB in the end (delta: 83.1kB). Peak memory consumption was 8.4MB. 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 shiftRight at line 91, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 149, overapproximation of someBinaryFLOATComparisonOperation at line 151, overapproximation of someBinaryFLOATComparisonOperation at line 190, overapproximation of someBinaryDOUBLEComparisonOperation at line 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 178. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 1; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_8 = 0; [L26] signed short int var_1_9 = 256; [L27] signed short int var_1_10 = -25; [L28] unsigned char var_1_11 = 1; [L29] unsigned char var_1_12 = 0; [L30] float var_1_13 = 256.75; [L31] float var_1_15 = 256.25; [L32] float var_1_16 = 8.95; [L33] float var_1_17 = 256.375; [L34] float var_1_18 = 0.0; [L35] float var_1_19 = 3.75; [L36] unsigned short int var_1_20 = 64; [L37] unsigned short int var_1_21 = 0; [L38] float var_1_22 = 100.5; [L39] unsigned short int var_1_23 = 50; [L40] unsigned short int var_1_24 = 64; [L41] double var_1_25 = 32.6; [L42] unsigned char var_1_26 = 1; [L43] unsigned char var_1_28 = 0; [L44] double var_1_29 = 100.4; [L45] signed short int var_1_30 = 2; [L46] signed short int var_1_31 = 16; [L47] signed short int var_1_32 = 8; [L48] signed short int var_1_33 = 2; [L49] double var_1_34 = 0.0; [L50] double var_1_35 = 63.8; [L51] double var_1_36 = 127.75; [L52] double var_1_37 = 0.4; [L53] unsigned long int var_1_38 = 50; [L54] unsigned long int var_1_39 = 3554953517; [L55] unsigned char var_1_40 = 0; [L56] unsigned short int var_1_41 = 4; VAL [isInitial=0, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] FCALL updateLastVariables() [L198] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L133] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L134] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L134] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L135] var_1_8 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_9=256] [L136] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_9=256] [L137] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L137] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L138] var_1_10 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_10 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L139] RET assume_abort_if_not(var_1_10 >= -32767) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L140] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L140] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L141] var_1_12 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L142] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L143] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L143] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L144] var_1_15 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L145] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L146] var_1_16 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L147] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L148] var_1_17 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L149] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L150] var_1_18 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L151] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L152] var_1_19 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L153] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L154] var_1_21 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L155] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L156] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L156] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L157] var_1_24 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L158] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L159] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L159] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L160] var_1_28 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L161] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L162] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L162] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L163] var_1_30 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L164] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L165] CALL assume_abort_if_not(var_1_30 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L165] RET assume_abort_if_not(var_1_30 <= 16384) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L166] var_1_31 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L167] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L168] CALL assume_abort_if_not(var_1_31 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L168] RET assume_abort_if_not(var_1_31 <= 16383) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L169] var_1_32 = __VERIFIER_nondet_short() [L170] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L170] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L171] CALL assume_abort_if_not(var_1_32 <= 9) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L171] RET assume_abort_if_not(var_1_32 <= 9) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L172] var_1_33 = __VERIFIER_nondet_short() [L173] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L173] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L174] CALL assume_abort_if_not(var_1_33 <= 8) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L174] RET assume_abort_if_not(var_1_33 <= 8) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L175] var_1_34 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_34 >= 4611686.018427382800e+12F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L176] RET assume_abort_if_not((var_1_34 >= 4611686.018427382800e+12F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L177] var_1_35 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 2305843.009213691390e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L178] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 2305843.009213691390e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L179] var_1_36 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L180] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L181] var_1_37 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L182] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L183] var_1_39 = __VERIFIER_nondet_ulong() [L184] CALL assume_abort_if_not(var_1_39 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L184] RET assume_abort_if_not(var_1_39 >= 3221225470) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L185] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L185] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L198] RET updateVariables() [L199] CALL step() [L60] var_1_9 = ((((-10) < (var_1_10)) ? (-10) : (var_1_10))) [L61] var_1_11 = ((var_1_8 || var_1_4) && var_1_12) [L62] var_1_20 = (45013 - var_1_21) [L63] var_1_22 = ((((((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) > (var_1_17)) ? (((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) : (var_1_17))) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=50, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-10] [L64] COND TRUE (9999999.6 / var_1_18) > var_1_16 [L65] var_1_23 = ((((var_1_21 + var_1_24) < 0 ) ? -(var_1_21 + var_1_24) : (var_1_21 + var_1_24))) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-10] [L67] var_1_25 = (((((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) > (var_1_16)) ? ((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) : (var_1_16))) [L68] var_1_40 = var_1_28 [L69] var_1_41 = 10 VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-10] [L70] COND FALSE !(var_1_9 >= var_1_23) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-10] [L73] signed long int stepLocal_0 = var_1_20 - var_1_23; VAL [isInitial=1, stepLocal_0=45013, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-10] [L74] COND TRUE var_1_20 <= stepLocal_0 [L75] var_1_5 = (var_1_1 || var_1_4) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L79] unsigned short int stepLocal_1 = var_1_23; VAL [isInitial=1, stepLocal_1=0, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L80] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_1=0, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L81] COND FALSE !(stepLocal_1 > var_1_23) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L87] unsigned short int stepLocal_5 = var_1_41; [L88] signed long int stepLocal_4 = (var_1_30 + var_1_31) - var_1_21; VAL [isInitial=1, stepLocal_4=0, stepLocal_5=10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L89] EXPR var_1_21 >> (var_1_32 + var_1_33) VAL [isInitial=1, stepLocal_4=0, stepLocal_5=10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L89] signed long int stepLocal_3 = var_1_21 >> (var_1_32 + var_1_33); [L90] COND TRUE \read(var_1_12) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_5=10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L91] EXPR var_1_9 >> var_1_41 VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_5=10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L91] COND FALSE !(stepLocal_5 <= (var_1_9 >> var_1_41)) [L101] signed short int stepLocal_9 = var_1_9; VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L102] EXPR var_1_31 & (var_1_20 * var_1_20) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L102] signed long int stepLocal_8 = var_1_31 & (var_1_20 * var_1_20); [L103] EXPR var_1_30 >> var_1_9 VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_8=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L103] signed long int stepLocal_7 = var_1_30 >> var_1_9; [L104] unsigned short int stepLocal_6 = var_1_20; VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L105] COND TRUE var_1_17 >= (- var_1_34) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L106] COND FALSE !(stepLocal_6 <= -1) [L111] var_1_38 = ((var_1_39 - (var_1_20 + 500u)) - 4u) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L126] signed long int stepLocal_2 = var_1_24 * var_1_23; VAL [isInitial=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L127] COND FALSE !(stepLocal_2 > (var_1_41 - var_1_38)) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L199] RET step() [L200] CALL, EXPR property() [L190] EXPR (((((((((((var_1_9 >= var_1_23) ? (var_1_1 == ((unsigned char) (! var_1_4))) : 1) && ((var_1_20 <= (var_1_20 - var_1_23)) ? (var_1_5 == ((unsigned char) (var_1_1 || var_1_4))) : (var_1_5 == ((unsigned char) (! (! var_1_8)))))) && (var_1_9 == ((signed short int) ((((-10) < (var_1_10)) ? (-10) : (var_1_10)))))) && (var_1_11 == ((unsigned char) ((var_1_8 || var_1_4) && var_1_12)))) && (var_1_1 ? ((var_1_23 > var_1_23) ? (var_1_13 == ((float) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1) : (var_1_13 == ((float) ((((var_1_17 - (var_1_18 - var_1_19)) < 0 ) ? -(var_1_17 - (var_1_18 - var_1_19)) : (var_1_17 - (var_1_18 - var_1_19)))))))) && (var_1_20 == ((unsigned short int) (45013 - var_1_21)))) && (var_1_22 == ((float) ((((((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) > (var_1_17)) ? (((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) : (var_1_17)))))) && (((9999999.6 / var_1_18) > var_1_16) ? (var_1_23 == ((unsigned short int) ((((var_1_21 + var_1_24) < 0 ) ? -(var_1_21 + var_1_24) : (var_1_21 + var_1_24))))) : 1)) && (var_1_25 == ((double) (((((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) > (var_1_16)) ? ((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) : (var_1_16)))))) && (((var_1_24 * var_1_23) > (var_1_41 - var_1_38)) ? (var_1_26 == ((unsigned char) (! ((var_1_4 && var_1_12) && var_1_28)))) : 1)) && (var_1_12 ? ((var_1_41 <= (var_1_9 >> var_1_41)) ? ((((var_1_30 + var_1_31) - var_1_21) >= 128) ? (((var_1_24 - var_1_41) <= (var_1_21 >> (var_1_32 + var_1_33))) ? (var_1_29 == ((double) (-0.4 + var_1_19))) : (var_1_29 == ((double) ((((((var_1_18) < (var_1_34)) ? (var_1_18) : (var_1_34))) - var_1_19) - ((var_1_35 + var_1_36) + var_1_37))))) : 1) : 1) : 1) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L190] EXPR ((((((((((((var_1_9 >= var_1_23) ? (var_1_1 == ((unsigned char) (! var_1_4))) : 1) && ((var_1_20 <= (var_1_20 - var_1_23)) ? (var_1_5 == ((unsigned char) (var_1_1 || var_1_4))) : (var_1_5 == ((unsigned char) (! (! var_1_8)))))) && (var_1_9 == ((signed short int) ((((-10) < (var_1_10)) ? (-10) : (var_1_10)))))) && (var_1_11 == ((unsigned char) ((var_1_8 || var_1_4) && var_1_12)))) && (var_1_1 ? ((var_1_23 > var_1_23) ? (var_1_13 == ((float) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1) : (var_1_13 == ((float) ((((var_1_17 - (var_1_18 - var_1_19)) < 0 ) ? -(var_1_17 - (var_1_18 - var_1_19)) : (var_1_17 - (var_1_18 - var_1_19)))))))) && (var_1_20 == ((unsigned short int) (45013 - var_1_21)))) && (var_1_22 == ((float) ((((((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) > (var_1_17)) ? (((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) : (var_1_17)))))) && (((9999999.6 / var_1_18) > var_1_16) ? (var_1_23 == ((unsigned short int) ((((var_1_21 + var_1_24) < 0 ) ? -(var_1_21 + var_1_24) : (var_1_21 + var_1_24))))) : 1)) && (var_1_25 == ((double) (((((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) > (var_1_16)) ? ((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) : (var_1_16)))))) && (((var_1_24 * var_1_23) > (var_1_41 - var_1_38)) ? (var_1_26 == ((unsigned char) (! ((var_1_4 && var_1_12) && var_1_28)))) : 1)) && (var_1_12 ? ((var_1_41 <= (var_1_9 >> var_1_41)) ? ((((var_1_30 + var_1_31) - var_1_21) >= 128) ? (((var_1_24 - var_1_41) <= (var_1_21 >> (var_1_32 + var_1_33))) ? (var_1_29 == ((double) (-0.4 + var_1_19))) : (var_1_29 == ((double) ((((((var_1_18) < (var_1_34)) ? (var_1_18) : (var_1_34))) - var_1_19) - ((var_1_35 + var_1_36) + var_1_37))))) : 1) : 1) : 1)) && ((var_1_17 >= (- var_1_34)) ? ((var_1_20 <= -1) ? (((~ var_1_30) > (var_1_31 & (var_1_20 * var_1_20))) ? (var_1_38 == ((unsigned long int) var_1_24)) : 1) : (var_1_38 == ((unsigned long int) ((var_1_39 - (var_1_20 + 500u)) - 4u)))) : ((var_1_9 <= (var_1_9 ^ var_1_32)) ? ((var_1_15 <= var_1_13) ? (((var_1_24 * var_1_9) <= (var_1_30 >> var_1_9)) ? (var_1_38 == ((unsigned long int) var_1_41)) : (var_1_38 == ((unsigned long int) var_1_39))) : (var_1_38 == ((unsigned long int) var_1_21))) : 1)) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L190-L191] return ((((((((((((((var_1_9 >= var_1_23) ? (var_1_1 == ((unsigned char) (! var_1_4))) : 1) && ((var_1_20 <= (var_1_20 - var_1_23)) ? (var_1_5 == ((unsigned char) (var_1_1 || var_1_4))) : (var_1_5 == ((unsigned char) (! (! var_1_8)))))) && (var_1_9 == ((signed short int) ((((-10) < (var_1_10)) ? (-10) : (var_1_10)))))) && (var_1_11 == ((unsigned char) ((var_1_8 || var_1_4) && var_1_12)))) && (var_1_1 ? ((var_1_23 > var_1_23) ? (var_1_13 == ((float) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1) : (var_1_13 == ((float) ((((var_1_17 - (var_1_18 - var_1_19)) < 0 ) ? -(var_1_17 - (var_1_18 - var_1_19)) : (var_1_17 - (var_1_18 - var_1_19)))))))) && (var_1_20 == ((unsigned short int) (45013 - var_1_21)))) && (var_1_22 == ((float) ((((((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) > (var_1_17)) ? (((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) : (var_1_17)))))) && (((9999999.6 / var_1_18) > var_1_16) ? (var_1_23 == ((unsigned short int) ((((var_1_21 + var_1_24) < 0 ) ? -(var_1_21 + var_1_24) : (var_1_21 + var_1_24))))) : 1)) && (var_1_25 == ((double) (((((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) > (var_1_16)) ? ((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) : (var_1_16)))))) && (((var_1_24 * var_1_23) > (var_1_41 - var_1_38)) ? (var_1_26 == ((unsigned char) (! ((var_1_4 && var_1_12) && var_1_28)))) : 1)) && (var_1_12 ? ((var_1_41 <= (var_1_9 >> var_1_41)) ? ((((var_1_30 + var_1_31) - var_1_21) >= 128) ? (((var_1_24 - var_1_41) <= (var_1_21 >> (var_1_32 + var_1_33))) ? (var_1_29 == ((double) (-0.4 + var_1_19))) : (var_1_29 == ((double) ((((((var_1_18) < (var_1_34)) ? (var_1_18) : (var_1_34))) - var_1_19) - ((var_1_35 + var_1_36) + var_1_37))))) : 1) : 1) : 1)) && ((var_1_17 >= (- var_1_34)) ? ((var_1_20 <= -1) ? (((~ var_1_30) > (var_1_31 & (var_1_20 * var_1_20))) ? (var_1_38 == ((unsigned long int) var_1_24)) : 1) : (var_1_38 == ((unsigned long int) ((var_1_39 - (var_1_20 + 500u)) - 4u)))) : ((var_1_9 <= (var_1_9 ^ var_1_32)) ? ((var_1_15 <= var_1_13) ? (((var_1_24 * var_1_9) <= (var_1_30 >> var_1_9)) ? (var_1_38 == ((unsigned long int) var_1_41)) : (var_1_38 == ((unsigned long int) var_1_39))) : (var_1_38 == ((unsigned long int) var_1_21))) : 1))) && (var_1_40 == ((unsigned char) var_1_28))) && (var_1_41 == ((unsigned short int) 10)) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L19] reach_error() VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=-65536, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 144 locations, 252 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 9, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1411 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1405 mSDsluCounter, 3212 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1471 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1204 IncrementalHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 1741 mSDtfsCounter, 1204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 925 GetRequests, 895 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=8, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 149 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2872 NumberOfCodeBlocks, 2872 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2412 ConstructedInterpolants, 0 QuantifiedInterpolants, 5001 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1498 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 22934/23232 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 15:06:52,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-44.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 b3f491be311d516ac29ae462a7a199efc119d94755d350a220914a37d6ecf4d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:06:54,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:06:54,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:06:54,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:06:54,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:06:54,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:06:54,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:06:54,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:06:54,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:06:54,905 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:06:54,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:06:54,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:06:54,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:06:54,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:06:54,906 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:06:54,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:06:54,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:06:54,907 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:06:54,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:06:54,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:06:54,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:06:54,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:06:54,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:06:54,908 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:06:54,908 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:06:54,908 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:06:54,908 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:06:54,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:06:54,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:06:54,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:06:54,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:06:54,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:06:54,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:06:54,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:06:54,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:06:54,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:06:54,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:06:54,909 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:06:54,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:06:54,909 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:06:54,909 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:06:54,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:06:54,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:06:54,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:06:54,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:06:54,910 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> b3f491be311d516ac29ae462a7a199efc119d94755d350a220914a37d6ecf4d9 [2025-03-08 15:06:55,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:06:55,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:06:55,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:06:55,177 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:06:55,177 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:06:55,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-44.i [2025-03-08 15:06:56,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3acbab1b1/40bb9d33c54f474cb51adb78d011bf5d/FLAG6972f8a32 [2025-03-08 15:06:56,567 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:06:56,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-44.i [2025-03-08 15:06:56,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3acbab1b1/40bb9d33c54f474cb51adb78d011bf5d/FLAG6972f8a32 [2025-03-08 15:06:56,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3acbab1b1/40bb9d33c54f474cb51adb78d011bf5d [2025-03-08 15:06:56,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:06:56,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:06:56,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:06:56,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:06:56,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:06:56,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:56,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3185b697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56, skipping insertion in model container [2025-03-08 15:06:56,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:56,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:06:56,750 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-44.i[916,929] [2025-03-08 15:06:56,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:06:56,829 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:06:56,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-44.i[916,929] [2025-03-08 15:06:56,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:06:56,878 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:06:56,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56 WrapperNode [2025-03-08 15:06:56,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:06:56,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:06:56,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:06:56,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:06:56,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:56,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:56,927 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2025-03-08 15:06:56,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:06:56,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:06:56,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:06:56,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:06:56,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:56,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:56,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:56,961 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]. [2025-03-08 15:06:56,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:56,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:56,978 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:56,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:56,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:56,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:56,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:06:56,997 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:06:56,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:06:56,997 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:06:56,998 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56" (1/1) ... [2025-03-08 15:06:57,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:06:57,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:06:57,024 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) [2025-03-08 15:06:57,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:06:57,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:06:57,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:06:57,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:06:57,048 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:06:57,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:06:57,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:06:57,128 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:06:57,130 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:07:17,311 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-08 15:07:17,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:07:17,318 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:07:17,318 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:07:17,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:07:17 BoogieIcfgContainer [2025-03-08 15:07:17,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:07:17,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:07:17,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:07:17,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:07:17,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:06:56" (1/3) ... [2025-03-08 15:07:17,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609f4208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:07:17, skipping insertion in model container [2025-03-08 15:07:17,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:06:56" (2/3) ... [2025-03-08 15:07:17,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609f4208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:07:17, skipping insertion in model container [2025-03-08 15:07:17,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:07:17" (3/3) ... [2025-03-08 15:07:17,325 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-44.i [2025-03-08 15:07:17,334 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:07:17,335 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-44.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:07:17,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:07:17,389 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;@b8f5b1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:07:17,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:07:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 59 states have internal predecessors, (78), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 15:07:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 15:07:17,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:07:17,407 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:07:17,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:07:17,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:07:17,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1468902896, now seen corresponding path program 1 times [2025-03-08 15:07:17,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:07:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816676359] [2025-03-08 15:07:17,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:07:17,421 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 [2025-03-08 15:07:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:07:17,424 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) [2025-03-08 15:07:17,426 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 [2025-03-08 15:07:17,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 15:07:18,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 15:07:18,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:07:18,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:07:18,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:07:18,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:07:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2025-03-08 15:07:18,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:07:18,593 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:07:18,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816676359] [2025-03-08 15:07:18,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816676359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:07:18,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:07:18,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:07:18,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772828421] [2025-03-08 15:07:18,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:07:18,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:07:18,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:07:18,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:07:18,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:07:18,613 INFO L87 Difference]: Start difference. First operand has 94 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 59 states have internal predecessors, (78), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 15:07:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:07:18,638 INFO L93 Difference]: Finished difference Result 181 states and 314 transitions. [2025-03-08 15:07:18,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:07:18,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 209 [2025-03-08 15:07:18,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:07:18,644 INFO L225 Difference]: With dead ends: 181 [2025-03-08 15:07:18,644 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 15:07:18,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:07:18,649 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:07:18,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:07:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 15:07:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-08 15:07:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 15:07:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 136 transitions. [2025-03-08 15:07:18,688 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 136 transitions. Word has length 209 [2025-03-08 15:07:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:07:18,689 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 136 transitions. [2025-03-08 15:07:18,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 15:07:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2025-03-08 15:07:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 15:07:18,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:07:18,694 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:07:18,730 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 [2025-03-08 15:07:18,895 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 [2025-03-08 15:07:18,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:07:18,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:07:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2097100753, now seen corresponding path program 1 times [2025-03-08 15:07:18,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:07:18,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983908719] [2025-03-08 15:07:18,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:07:18,897 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 [2025-03-08 15:07:18,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:07:18,899 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) [2025-03-08 15:07:18,900 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 [2025-03-08 15:07:18,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 15:07:19,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 15:07:19,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:07:19,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:07:20,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 15:07:20,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:07:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 15:07:20,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:07:20,534 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:07:20,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983908719] [2025-03-08 15:07:20,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983908719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:07:20,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:07:20,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:07:20,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161650318] [2025-03-08 15:07:20,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:07:20,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:07:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:07:20,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:07:20,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:07:20,538 INFO L87 Difference]: Start difference. First operand 90 states and 136 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:07:25,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 15:07:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:07:25,086 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2025-03-08 15:07:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:07:25,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-03-08 15:07:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:07:25,222 INFO L225 Difference]: With dead ends: 235 [2025-03-08 15:07:25,222 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 15:07:25,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:07:25,224 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 124 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:07:25,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 307 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 15:07:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 15:07:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 88. [2025-03-08 15:07:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 15:07:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2025-03-08 15:07:25,236 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 209 [2025-03-08 15:07:25,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:07:25,237 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2025-03-08 15:07:25,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:07:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2025-03-08 15:07:25,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 15:07:25,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:07:25,241 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:07:25,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:07:25,442 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 [2025-03-08 15:07:25,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:07:25,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:07:25,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1687332366, now seen corresponding path program 1 times [2025-03-08 15:07:25,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:07:25,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569186600] [2025-03-08 15:07:25,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:07:25,443 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 [2025-03-08 15:07:25,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:07:25,445 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) [2025-03-08 15:07:25,446 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 [2025-03-08 15:07:25,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 15:07:26,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 15:07:26,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:07:26,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:07:26,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 15:07:26,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:07:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 15:07:32,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:07:32,818 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:07:32,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569186600] [2025-03-08 15:07:32,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569186600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:07:32,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:07:32,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:07:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176655031] [2025-03-08 15:07:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:07:32,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:07:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:07:32,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:07:32,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:07:32,820 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:07:37,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:07:37,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:07:37,162 INFO L93 Difference]: Finished difference Result 173 states and 257 transitions. [2025-03-08 15:07:37,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:07:37,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-03-08 15:07:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:07:37,290 INFO L225 Difference]: With dead ends: 173 [2025-03-08 15:07:37,290 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 15:07:37,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:07:37,291 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:07:37,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 15:07:37,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 15:07:37,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-08 15:07:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 15:07:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 129 transitions. [2025-03-08 15:07:37,298 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 129 transitions. Word has length 209 [2025-03-08 15:07:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:07:37,299 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 129 transitions. [2025-03-08 15:07:37,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:07:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 129 transitions. [2025-03-08 15:07:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 15:07:37,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:07:37,301 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:07:37,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 15:07:37,501 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 [2025-03-08 15:07:37,501 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:07:37,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:07:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1692709676, now seen corresponding path program 1 times [2025-03-08 15:07:37,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:07:37,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7573265] [2025-03-08 15:07:37,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:07:37,502 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 [2025-03-08 15:07:37,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:07:37,506 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) [2025-03-08 15:07:37,507 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 [2025-03-08 15:07:37,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 15:07:38,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 15:07:38,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:07:38,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:07:38,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 15:07:38,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:07:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 15:07:38,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:07:38,727 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:07:38,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7573265] [2025-03-08 15:07:38,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7573265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:07:38,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:07:38,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:07:38,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219095272] [2025-03-08 15:07:38,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:07:38,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:07:38,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:07:38,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:07:38,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:07:38,730 INFO L87 Difference]: Start difference. First operand 88 states and 129 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:07:42,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:07:47,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:07:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:07:47,461 INFO L93 Difference]: Finished difference Result 173 states and 255 transitions. [2025-03-08 15:07:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:07:47,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2025-03-08 15:07:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:07:47,594 INFO L225 Difference]: With dead ends: 173 [2025-03-08 15:07:47,594 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 15:07:47,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:07:47,595 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:07:47,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2025-03-08 15:07:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 15:07:47,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-08 15:07:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 15:07:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2025-03-08 15:07:47,604 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 210 [2025-03-08 15:07:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:07:47,604 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2025-03-08 15:07:47,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 15:07:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2025-03-08 15:07:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 15:07:47,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:07:47,606 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:07:47,637 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 (5)] Ended with exit code 0 [2025-03-08 15:07:47,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 [2025-03-08 15:07:47,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:07:47,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:07:47,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1821792395, now seen corresponding path program 1 times [2025-03-08 15:07:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:07:47,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775622415] [2025-03-08 15:07:47,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:07:47,808 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 [2025-03-08 15:07:47,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:07:47,809 INFO L229 MonitoredProcess]: Starting monitored process 6 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) [2025-03-08 15:07:47,810 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 (6)] Waiting until timeout for monitored process [2025-03-08 15:07:47,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 15:07:48,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 15:07:48,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:07:48,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:07:48,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 15:07:48,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:07:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 668 proven. 78 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2025-03-08 15:07:53,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:07:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 18 proven. 78 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-08 15:07:58,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:07:58,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775622415] [2025-03-08 15:07:58,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775622415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:07:58,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:07:58,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 15:07:58,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094336775] [2025-03-08 15:07:58,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:07:58,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:07:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:07:58,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:07:58,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:07:58,645 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 15:08:07,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:08:11,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:08:15,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:08:15,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:08:15,842 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2025-03-08 15:08:15,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:08:15,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 210 [2025-03-08 15:08:15,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:08:15,844 INFO L225 Difference]: With dead ends: 192 [2025-03-08 15:08:15,844 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 15:08:15,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:08:15,845 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 34 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:08:15,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 239 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 3 Unknown, 0 Unchecked, 16.7s Time] [2025-03-08 15:08:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 15:08:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2025-03-08 15:08:15,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 61 states have internal predecessors, (68), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 15:08:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2025-03-08 15:08:15,860 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 210 [2025-03-08 15:08:15,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:08:15,862 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2025-03-08 15:08:15,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 15:08:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2025-03-08 15:08:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 15:08:15,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:08:15,865 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:08:15,900 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 (6)] Ended with exit code 0 [2025-03-08 15:08:16,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 [2025-03-08 15:08:16,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:08:16,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:08:16,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1422285999, now seen corresponding path program 1 times [2025-03-08 15:08:16,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:08:16,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942146362] [2025-03-08 15:08:16,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:08:16,067 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 [2025-03-08 15:08:16,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:08:16,069 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2025-03-08 15:08:16,070 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 (7)] Waiting until timeout for monitored process [2025-03-08 15:08:16,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 15:08:18,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 15:08:18,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:08:18,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:08:18,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 15:08:18,702 INFO L279 TraceCheckSpWp]: Computing forward predicates...