./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-63.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 f1a09ba425945cf4f9921928f658b88dc5effcb9f7f5fceaede4a8dcd3ed2b53 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:22:47,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:22:47,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:22:47,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:22:47,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:22:47,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:22:47,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:22:47,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:22:47,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:22:47,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:22:47,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:22:47,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:22:47,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:22:47,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:22:47,627 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:22:47,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:22:47,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:22:47,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:22:47,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:22:47,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:22:47,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:22:47,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:22:47,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:22:47,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:22:47,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:22:47,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:22:47,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:22:47,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:22:47,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:22:47,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:22:47,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:22:47,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:22:47,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:22:47,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:22:47,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:22:47,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:22:47,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:22:47,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:22:47,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:22:47,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:22:47,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:22:47,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:22:47,637 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1a09ba425945cf4f9921928f658b88dc5effcb9f7f5fceaede4a8dcd3ed2b53 [2024-10-24 05:22:47,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:22:47,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:22:47,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:22:47,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:22:47,914 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:22:47,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-63.i [2024-10-24 05:22:49,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:22:49,592 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:22:49,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-63.i [2024-10-24 05:22:49,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8670bc8/993637d592ff46bbabce5347d9c453b3/FLAG06e1776ac [2024-10-24 05:22:49,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8670bc8/993637d592ff46bbabce5347d9c453b3 [2024-10-24 05:22:49,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:22:49,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:22:49,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:22:49,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:22:49,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:22:49,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:22:49" (1/1) ... [2024-10-24 05:22:49,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d8b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:49, skipping insertion in model container [2024-10-24 05:22:49,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:22:49" (1/1) ... [2024-10-24 05:22:49,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:22:49,827 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-63.i[913,926] [2024-10-24 05:22:49,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:22:49,940 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:22:49,954 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-63.i[913,926] [2024-10-24 05:22:50,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:22:50,026 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:22:50,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50 WrapperNode [2024-10-24 05:22:50,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:22:50,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:22:50,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:22:50,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:22:50,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50" (1/1) ... [2024-10-24 05:22:50,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50" (1/1) ... [2024-10-24 05:22:50,094 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 234 [2024-10-24 05:22:50,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:22:50,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:22:50,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:22:50,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:22:50,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50" (1/1) ... [2024-10-24 05:22:50,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50" (1/1) ... [2024-10-24 05:22:50,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50" (1/1) ... [2024-10-24 05:22:50,137 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:22:50,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50" (1/1) ... [2024-10-24 05:22:50,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50" (1/1) ... [2024-10-24 05:22:50,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50" (1/1) ... [2024-10-24 05:22:50,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50" (1/1) ... [2024-10-24 05:22:50,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50" (1/1) ... [2024-10-24 05:22:50,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50" (1/1) ... [2024-10-24 05:22:50,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:22:50,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:22:50,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:22:50,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:22:50,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50" (1/1) ... [2024-10-24 05:22:50,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:22:50,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:22:50,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:22:50,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:22:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:22:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:22:50,265 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:22:50,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:22:50,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:22:50,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:22:50,362 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:22:50,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:22:50,726 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-24 05:22:50,726 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:22:50,774 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:22:50,774 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:22:50,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:22:50 BoogieIcfgContainer [2024-10-24 05:22:50,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:22:50,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:22:50,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:22:50,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:22:50,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:22:49" (1/3) ... [2024-10-24 05:22:50,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2c0a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:22:50, skipping insertion in model container [2024-10-24 05:22:50,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:50" (2/3) ... [2024-10-24 05:22:50,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2c0a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:22:50, skipping insertion in model container [2024-10-24 05:22:50,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:22:50" (3/3) ... [2024-10-24 05:22:50,784 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-63.i [2024-10-24 05:22:50,802 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:22:50,802 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:22:50,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:22:50,895 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;@d9dbda3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:22:50,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:22:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 05:22:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 05:22:50,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:22:50,921 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:22:50,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:22:50,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:22:50,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1633108993, now seen corresponding path program 1 times [2024-10-24 05:22:50,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:22:50,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861428999] [2024-10-24 05:22:50,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:22:50,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:22:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:22:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:22:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:22:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:22:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:22:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:22:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:22:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:22:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:22:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:22:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:22:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:22:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:22:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:22:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:22:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:22:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:22:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:22:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:22:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:22:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:22:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:22:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:22:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:22:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:22:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:22:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:22:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 05:22:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 05:22:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-24 05:22:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 05:22:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 05:22:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 05:22:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 05:22:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-24 05:22:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-24 05:22:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-24 05:22:51,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:22:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861428999] [2024-10-24 05:22:51,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861428999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:22:51,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:22:51,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:22:51,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504508989] [2024-10-24 05:22:51,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:22:51,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:22:51,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:22:51,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:22:51,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:22:51,542 INFO L87 Difference]: Start difference. First operand has 93 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-24 05:22:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:22:51,593 INFO L93 Difference]: Finished difference Result 183 states and 328 transitions. [2024-10-24 05:22:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:22:51,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 219 [2024-10-24 05:22:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:22:51,605 INFO L225 Difference]: With dead ends: 183 [2024-10-24 05:22:51,605 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 05:22:51,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:22:51,612 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:22:51,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:22:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 05:22:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-24 05:22:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 05:22:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2024-10-24 05:22:51,670 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 219 [2024-10-24 05:22:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:22:51,671 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2024-10-24 05:22:51,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-24 05:22:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2024-10-24 05:22:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 05:22:51,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:22:51,680 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:22:51,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:22:51,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:22:51,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:22:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash 926289483, now seen corresponding path program 1 times [2024-10-24 05:22:51,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:22:51,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470712422] [2024-10-24 05:22:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:22:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:22:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:22:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:22:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:22:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:22:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:22:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:22:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:22:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:22:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:22:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:22:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:22:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:22:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:22:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:22:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:22:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:22:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:22:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:22:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:22:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:22:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:22:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:22:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:22:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:22:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:22:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:22:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:22:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 05:22:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 05:22:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-24 05:22:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 05:22:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 05:22:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 05:22:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 05:22:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-24 05:22:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-24 05:22:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-24 05:22:52,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:22:52,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470712422] [2024-10-24 05:22:52,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470712422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:22:52,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:22:52,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:22:52,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390892579] [2024-10-24 05:22:52,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:22:52,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:22:52,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:22:52,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:22:52,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:22:52,116 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:22:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:22:52,192 INFO L93 Difference]: Finished difference Result 223 states and 345 transitions. [2024-10-24 05:22:52,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:22:52,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 219 [2024-10-24 05:22:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:22:52,202 INFO L225 Difference]: With dead ends: 223 [2024-10-24 05:22:52,202 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 05:22:52,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:22:52,204 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 58 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:22:52,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 298 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:22:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 05:22:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-10-24 05:22:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 05:22:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 199 transitions. [2024-10-24 05:22:52,240 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 199 transitions. Word has length 219 [2024-10-24 05:22:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:22:52,241 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 199 transitions. [2024-10-24 05:22:52,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:22:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 199 transitions. [2024-10-24 05:22:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 05:22:52,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:22:52,247 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:22:52,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:22:52,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:22:52,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:22:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1627354061, now seen corresponding path program 1 times [2024-10-24 05:22:52,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:22:52,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333255677] [2024-10-24 05:22:52,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:22:52,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:22:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:22:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:22:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:22:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:22:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:22:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:22:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:22:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:22:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:22:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:22:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:22:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:22:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:22:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:22:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:22:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:22:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:22:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:22:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:22:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:22:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:22:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:22:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:22:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:22:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:22:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:22:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:22:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 05:22:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 05:22:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-24 05:22:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 05:22:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 05:22:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 05:22:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 05:22:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-24 05:22:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-24 05:22:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-24 05:22:52,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:22:52,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333255677] [2024-10-24 05:22:52,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333255677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:22:52,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:22:52,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:22:52,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591026123] [2024-10-24 05:22:52,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:22:52,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:22:52,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:22:52,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:22:52,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:22:52,506 INFO L87 Difference]: Start difference. First operand 130 states and 199 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:22:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:22:52,613 INFO L93 Difference]: Finished difference Result 271 states and 411 transitions. [2024-10-24 05:22:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:22:52,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 219 [2024-10-24 05:22:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:22:52,618 INFO L225 Difference]: With dead ends: 271 [2024-10-24 05:22:52,620 INFO L226 Difference]: Without dead ends: 142 [2024-10-24 05:22:52,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:22:52,622 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 55 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:22:52,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 269 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:22:52,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-24 05:22:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 108. [2024-10-24 05:22:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 05:22:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 163 transitions. [2024-10-24 05:22:52,644 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 163 transitions. Word has length 219 [2024-10-24 05:22:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:22:52,646 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 163 transitions. [2024-10-24 05:22:52,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:22:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 163 transitions. [2024-10-24 05:22:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 05:22:52,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:22:52,650 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:22:52,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:22:52,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:22:52,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:22:52,651 INFO L85 PathProgramCache]: Analyzing trace with hash 818007435, now seen corresponding path program 1 times [2024-10-24 05:22:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:22:52,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184720670] [2024-10-24 05:22:52,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:22:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:22:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:22:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:22:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:22:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:22:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:22:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:22:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:22:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:22:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:22:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:22:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:22:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:22:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:22:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:22:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:22:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:22:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:22:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:22:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:22:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:22:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:22:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:22:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:22:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:22:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:22:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:22:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:22:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 05:22:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 05:22:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-24 05:22:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 05:22:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 05:22:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 05:22:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 05:22:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-24 05:22:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-24 05:22:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-24 05:22:53,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:22:53,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184720670] [2024-10-24 05:22:53,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184720670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:22:53,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:22:53,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:22:53,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980170862] [2024-10-24 05:22:53,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:22:53,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:22:53,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:22:53,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:22:53,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:22:53,277 INFO L87 Difference]: Start difference. First operand 108 states and 163 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:22:53,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:22:53,493 INFO L93 Difference]: Finished difference Result 250 states and 373 transitions. [2024-10-24 05:22:53,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:22:53,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 219 [2024-10-24 05:22:53,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:22:53,497 INFO L225 Difference]: With dead ends: 250 [2024-10-24 05:22:53,497 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 05:22:53,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:22:53,501 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 33 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:22:53,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 606 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:22:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 05:22:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2024-10-24 05:22:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 98 states have (on average 1.336734693877551) internal successors, (131), 99 states have internal predecessors, (131), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 05:22:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2024-10-24 05:22:53,523 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 219 [2024-10-24 05:22:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:22:53,523 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2024-10-24 05:22:53,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:22:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2024-10-24 05:22:53,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-24 05:22:53,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:22:53,528 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:22:53,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:22:53,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:22:53,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:22:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1281002536, now seen corresponding path program 1 times [2024-10-24 05:22:53,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:22:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145985884] [2024-10-24 05:22:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:22:53,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:22:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:22:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:22:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:22:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:22:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:22:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:22:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:22:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:22:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:22:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:22:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:22:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:22:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:22:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:22:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:22:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:22:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:22:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:22:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:22:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:22:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:22:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:22:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:22:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:22:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:22:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:22:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:22:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 05:22:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 05:22:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-24 05:22:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 05:22:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 05:22:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 05:22:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 05:22:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-24 05:22:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-24 05:22:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-24 05:22:54,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:22:54,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145985884] [2024-10-24 05:22:54,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145985884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:22:54,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:22:54,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 05:22:54,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551646532] [2024-10-24 05:22:54,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:22:54,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 05:22:54,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:22:54,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 05:22:54,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:22:54,178 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:22:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:22:54,561 INFO L93 Difference]: Finished difference Result 352 states and 513 transitions. [2024-10-24 05:22:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 05:22:54,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 220 [2024-10-24 05:22:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:22:54,568 INFO L225 Difference]: With dead ends: 352 [2024-10-24 05:22:54,569 INFO L226 Difference]: Without dead ends: 213 [2024-10-24 05:22:54,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:22:54,571 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 78 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:22:54,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 774 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:22:54,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-24 05:22:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 175. [2024-10-24 05:22:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 133 states have (on average 1.3984962406015038) internal successors, (186), 134 states have internal predecessors, (186), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 05:22:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 262 transitions. [2024-10-24 05:22:54,602 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 262 transitions. Word has length 220 [2024-10-24 05:22:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:22:54,603 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 262 transitions. [2024-10-24 05:22:54,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:22:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 262 transitions. [2024-10-24 05:22:54,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-24 05:22:54,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:22:54,608 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:22:54,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 05:22:54,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:22:54,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:22:54,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1044670478, now seen corresponding path program 1 times [2024-10-24 05:22:54,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:22:54,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898363021] [2024-10-24 05:22:54,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:22:54,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:22:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:22:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:22:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:22:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:22:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:22:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:22:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:22:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:22:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:22:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:22:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:22:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:22:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:22:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:22:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:22:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:22:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:22:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:22:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:22:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:22:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:22:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:22:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:22:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:22:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:22:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:22:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:22:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 05:22:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 05:22:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-24 05:22:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 05:22:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 05:22:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 05:22:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 05:22:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-24 05:22:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-24 05:22:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:22:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-24 05:22:54,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:22:54,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898363021] [2024-10-24 05:22:54,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898363021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:22:54,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:22:54,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:22:54,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407940946] [2024-10-24 05:22:54,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:22:54,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:22:54,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:22:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:22:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:22:54,818 INFO L87 Difference]: Start difference. First operand 175 states and 262 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:22:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:22:54,870 INFO L93 Difference]: Finished difference Result 384 states and 572 transitions. [2024-10-24 05:22:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:22:54,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 220 [2024-10-24 05:22:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:22:54,873 INFO L225 Difference]: With dead ends: 384 [2024-10-24 05:22:54,874 INFO L226 Difference]: Without dead ends: 210 [2024-10-24 05:22:54,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:22:54,875 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 30 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:22:54,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 286 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:22:54,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-24 05:22:54,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 192. [2024-10-24 05:22:54,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 150 states have (on average 1.4066666666666667) internal successors, (211), 151 states have internal predecessors, (211), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 05:22:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 287 transitions. [2024-10-24 05:22:54,904 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 287 transitions. Word has length 220 [2024-10-24 05:22:54,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:22:54,905 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 287 transitions. [2024-10-24 05:22:54,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:22:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 287 transitions. [2024-10-24 05:22:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-24 05:22:54,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:22:54,909 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:22:54,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 05:22:54,910 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:22:54,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:22:54,910 INFO L85 PathProgramCache]: Analyzing trace with hash -267456336, now seen corresponding path program 1 times [2024-10-24 05:22:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:22:54,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852778954] [2024-10-24 05:22:54,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:22:54,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:22:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:22:55,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:22:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:22:55,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:22:55,187 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:22:55,188 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:22:55,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 05:22:55,192 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:22:55,319 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:22:55,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:22:55 BoogieIcfgContainer [2024-10-24 05:22:55,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:22:55,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:22:55,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:22:55,323 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:22:55,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:22:50" (3/4) ... [2024-10-24 05:22:55,325 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:22:55,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:22:55,327 INFO L158 Benchmark]: Toolchain (without parser) took 5701.40ms. Allocated memory was 184.5MB in the beginning and 308.3MB in the end (delta: 123.7MB). Free memory was 126.6MB in the beginning and 194.5MB in the end (delta: -67.8MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2024-10-24 05:22:55,327 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory was 149.9MB in the beginning and 149.6MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:22:55,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.35ms. Allocated memory is still 184.5MB. Free memory was 126.6MB in the beginning and 110.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 05:22:55,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.73ms. Allocated memory is still 184.5MB. Free memory was 110.4MB in the beginning and 107.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:22:55,328 INFO L158 Benchmark]: Boogie Preprocessor took 70.11ms. Allocated memory is still 184.5MB. Free memory was 107.0MB in the beginning and 102.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:22:55,328 INFO L158 Benchmark]: RCFGBuilder took 609.17ms. Allocated memory is still 184.5MB. Free memory was 102.4MB in the beginning and 75.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 05:22:55,328 INFO L158 Benchmark]: TraceAbstraction took 4545.40ms. Allocated memory was 184.5MB in the beginning and 308.3MB in the end (delta: 123.7MB). Free memory was 74.3MB in the beginning and 195.4MB in the end (delta: -121.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-10-24 05:22:55,328 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 308.3MB. Free memory was 195.4MB in the beginning and 194.5MB in the end (delta: 974.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:22:55,330 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.17ms. Allocated memory is still 184.5MB. Free memory was 149.9MB in the beginning and 149.6MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.35ms. Allocated memory is still 184.5MB. Free memory was 126.6MB in the beginning and 110.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.73ms. Allocated memory is still 184.5MB. Free memory was 110.4MB in the beginning and 107.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.11ms. Allocated memory is still 184.5MB. Free memory was 107.0MB in the beginning and 102.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 609.17ms. Allocated memory is still 184.5MB. Free memory was 102.4MB in the beginning and 75.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4545.40ms. Allocated memory was 184.5MB in the beginning and 308.3MB in the end (delta: 123.7MB). Free memory was 74.3MB in the beginning and 195.4MB in the end (delta: -121.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 308.3MB. Free memory was 195.4MB in the beginning and 194.5MB in the end (delta: 974.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryFLOATComparisonOperation at line 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned long int var_1_2 = 50; [L24] unsigned long int var_1_3 = 8; [L25] signed long int var_1_4 = 25; [L26] signed long int var_1_5 = -100; [L27] signed long int var_1_6 = 8; [L28] unsigned char var_1_7 = 0; [L29] signed long int var_1_8 = 128; [L30] signed long int var_1_9 = 2; [L31] signed long int var_1_10 = 128; [L32] unsigned short int var_1_11 = 500; [L33] unsigned short int var_1_12 = 128; [L34] unsigned char var_1_13 = 64; [L35] unsigned char var_1_15 = 1; [L36] unsigned char var_1_16 = 8; [L37] double var_1_17 = 7.5; [L38] double var_1_18 = 31.125; [L39] double var_1_19 = 10.5; [L40] double var_1_20 = 0.0; [L41] double var_1_21 = 16.75; [L42] double var_1_22 = 2.5; [L43] double var_1_23 = 64.5; [L44] signed long int var_1_24 = 10; [L45] signed long int var_1_25 = -64; [L46] signed char var_1_26 = 16; [L47] signed char var_1_27 = 4; [L48] signed char var_1_28 = -10; [L49] float var_1_29 = 63.794; [L50] unsigned short int var_1_30 = 1; [L51] signed long int var_1_31 = -2; [L52] unsigned char var_1_32 = 64; [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] FCALL updateLastVariables() [L165] CALL updateVariables() [L96] var_1_2 = __VERIFIER_nondet_ulong() [L97] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L97] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L98] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L98] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L99] var_1_3 = __VERIFIER_nondet_ulong() [L100] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L100] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L101] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L101] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L102] var_1_4 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L103] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L104] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L104] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L105] var_1_5 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_5 >= -536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L106] RET assume_abort_if_not(var_1_5 >= -536870911) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L107] CALL assume_abort_if_not(var_1_5 <= 536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L107] RET assume_abort_if_not(var_1_5 <= 536870912) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L108] var_1_6 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_6 >= -536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=128, var_1_9=2] [L109] RET assume_abort_if_not(var_1_6 >= -536870911) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=128, var_1_9=2] [L110] CALL assume_abort_if_not(var_1_6 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=128, var_1_9=2] [L110] RET assume_abort_if_not(var_1_6 <= 536870911) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=128, var_1_9=2] [L111] var_1_7 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_8=128, var_1_9=2] [L112] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_8=128, var_1_9=2] [L113] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=128, var_1_9=2] [L113] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=128, var_1_9=2] [L114] var_1_8 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=2] [L115] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=2] [L116] CALL assume_abort_if_not(var_1_8 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=2] [L116] RET assume_abort_if_not(var_1_8 <= 2147483646) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=2] [L117] var_1_9 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L118] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L119] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L120] var_1_10 = __VERIFIER_nondet_long() [L121] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L121] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L122] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L123] var_1_12 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L124] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L125] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L126] var_1_15 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L127] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L128] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L129] var_1_16 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L130] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L131] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L131] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L132] var_1_18 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L133] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L134] var_1_19 = __VERIFIER_nondet_double() [L135] 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=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L135] 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=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L136] var_1_20 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L137] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L138] var_1_21 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L139] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L140] var_1_22 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L141] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L142] var_1_23 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L143] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L144] var_1_25 = __VERIFIER_nondet_long() [L145] CALL assume_abort_if_not(var_1_25 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L145] RET assume_abort_if_not(var_1_25 >= -2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L146] CALL assume_abort_if_not(var_1_25 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L146] RET assume_abort_if_not(var_1_25 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L147] var_1_27 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L148] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L149] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L149] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L150] var_1_28 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L151] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L152] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L165] RET updateVariables() [L166] CALL step() [L56] EXPR (var_1_2 + 4u) | var_1_3 VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L56] COND TRUE 32u < ((var_1_2 + 4u) | var_1_3) [L57] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=2, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L65] EXPR var_1_9 >> var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=2, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L65] COND TRUE (var_1_9 >> var_1_4) < var_1_1 [L66] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=506, var_1_12=506, var_1_13=64, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=2, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L68] COND TRUE var_1_2 != var_1_11 [L69] var_1_13 = ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))) VAL [isInitial=1, var_1_10=0, var_1_11=506, var_1_12=506, var_1_13=253, var_1_15=254, var_1_16=-3, var_1_17=15/2, var_1_1=2, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L71] COND FALSE !(\read(var_1_7)) [L74] var_1_17 = var_1_22 VAL [isInitial=1, var_1_10=0, var_1_11=506, var_1_12=506, var_1_13=253, var_1_15=254, var_1_16=-3, var_1_17=2147483651, var_1_1=2, var_1_22=2147483651, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L76] COND TRUE ! var_1_7 [L77] var_1_24 = (var_1_11 - ((((((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) < ((var_1_13 + var_1_15))) ? (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) : ((var_1_13 + var_1_15))))) VAL [isInitial=1, var_1_10=0, var_1_11=506, var_1_12=506, var_1_13=253, var_1_15=254, var_1_16=-3, var_1_17=2147483651, var_1_1=2, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L85] COND TRUE var_1_8 >= var_1_1 [L86] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, var_1_10=0, var_1_11=506, var_1_12=506, var_1_13=253, var_1_15=254, var_1_16=-3, var_1_17=2147483651, var_1_1=2, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L88] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, var_1_10=0, var_1_11=506, var_1_12=506, var_1_13=253, var_1_15=254, var_1_16=-3, var_1_17=2147483651, var_1_1=2, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L91] var_1_30 = var_1_12 [L92] var_1_31 = var_1_25 [L93] var_1_32 = var_1_16 [L166] RET step() [L167] CALL, EXPR property() [L157] EXPR (var_1_2 + 4u) | var_1_3 VAL [isInitial=1, var_1_10=0, var_1_11=506, var_1_12=506, var_1_13=253, var_1_15=254, var_1_16=-3, var_1_17=2147483651, var_1_1=2, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=506, var_1_31=2147483646, var_1_32=-3, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L157] EXPR ((32u < ((var_1_2 + 4u) | var_1_3)) ? (var_1_1 == ((signed long int) (var_1_4 + (var_1_5 + var_1_6)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_4) < ((var_1_8 - var_1_9))) ? (var_1_4) : ((var_1_8 - var_1_9)))))) : (var_1_1 == ((signed long int) (var_1_9 - var_1_10))))) && (((var_1_9 >> var_1_4) < var_1_1) ? (var_1_11 == ((unsigned short int) var_1_12)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=506, var_1_12=506, var_1_13=253, var_1_15=254, var_1_16=-3, var_1_17=2147483651, var_1_1=2, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=506, var_1_31=2147483646, var_1_32=-3, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L157] EXPR var_1_9 >> var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=506, var_1_12=506, var_1_13=253, var_1_15=254, var_1_16=-3, var_1_17=2147483651, var_1_1=2, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=506, var_1_31=2147483646, var_1_32=-3, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L157] EXPR ((32u < ((var_1_2 + 4u) | var_1_3)) ? (var_1_1 == ((signed long int) (var_1_4 + (var_1_5 + var_1_6)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_4) < ((var_1_8 - var_1_9))) ? (var_1_4) : ((var_1_8 - var_1_9)))))) : (var_1_1 == ((signed long int) (var_1_9 - var_1_10))))) && (((var_1_9 >> var_1_4) < var_1_1) ? (var_1_11 == ((unsigned short int) var_1_12)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=506, var_1_12=506, var_1_13=253, var_1_15=254, var_1_16=-3, var_1_17=2147483651, var_1_1=2, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=506, var_1_31=2147483646, var_1_32=-3, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L157-L158] return ((((((((((32u < ((var_1_2 + 4u) | var_1_3)) ? (var_1_1 == ((signed long int) (var_1_4 + (var_1_5 + var_1_6)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_4) < ((var_1_8 - var_1_9))) ? (var_1_4) : ((var_1_8 - var_1_9)))))) : (var_1_1 == ((signed long int) (var_1_9 - var_1_10))))) && (((var_1_9 >> var_1_4) < var_1_1) ? (var_1_11 == ((unsigned short int) var_1_12)) : 1)) && ((var_1_2 != var_1_11) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) < ((var_1_13 + var_1_15))) ? (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) : ((var_1_13 + var_1_15))))))) : ((var_1_10 < var_1_9) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_25))))) && ((var_1_8 >= var_1_1) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_12))) && (var_1_31 == ((signed long int) var_1_25))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=506, var_1_12=506, var_1_13=253, var_1_15=254, var_1_16=-3, var_1_17=2147483651, var_1_1=2, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=506, var_1_31=2147483646, var_1_32=-3, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=506, var_1_12=506, var_1_13=253, var_1_15=254, var_1_16=-3, var_1_17=2147483651, var_1_1=2, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_2=29, var_1_30=506, var_1_31=2147483646, var_1_32=-3, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870910, var_1_7=0, var_1_8=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 7, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 254 mSDsluCounter, 2371 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1467 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 513 IncrementalHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 904 mSDtfsCounter, 513 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=6, InterpolantAutomatonStates: 24, 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, 6 MinimizatonAttempts, 96 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1537 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1310 ConstructedInterpolants, 0 QuantifiedInterpolants, 1989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 15120/15120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 05:22:55,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-63.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 f1a09ba425945cf4f9921928f658b88dc5effcb9f7f5fceaede4a8dcd3ed2b53 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:22:57,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:22:57,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:22:57,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:22:57,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:22:57,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:22:57,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:22:57,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:22:57,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:22:57,696 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:22:57,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:22:57,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:22:57,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:22:57,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:22:57,699 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:22:57,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:22:57,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:22:57,700 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:22:57,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:22:57,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:22:57,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:22:57,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:22:57,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:22:57,704 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:22:57,705 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:22:57,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:22:57,705 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:22:57,705 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:22:57,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:22:57,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:22:57,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:22:57,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:22:57,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:22:57,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:22:57,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:22:57,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:22:57,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:22:57,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:22:57,711 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:22:57,711 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:22:57,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:22:57,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:22:57,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:22:57,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:22:57,714 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:22:57,714 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1a09ba425945cf4f9921928f658b88dc5effcb9f7f5fceaede4a8dcd3ed2b53 [2024-10-24 05:22:58,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:22:58,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:22:58,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:22:58,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:22:58,063 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:22:58,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-63.i [2024-10-24 05:22:59,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:22:59,854 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:22:59,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-63.i [2024-10-24 05:22:59,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d04bf6a8/773ea538368f4e41978c77d889bc6637/FLAG16208474a [2024-10-24 05:22:59,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d04bf6a8/773ea538368f4e41978c77d889bc6637 [2024-10-24 05:22:59,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:22:59,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:22:59,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:22:59,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:22:59,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:22:59,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:22:59" (1/1) ... [2024-10-24 05:22:59,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f71a41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:22:59, skipping insertion in model container [2024-10-24 05:22:59,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:22:59" (1/1) ... [2024-10-24 05:22:59,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:23:00,085 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-63.i[913,926] [2024-10-24 05:23:00,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:23:00,184 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:23:00,198 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-63.i[913,926] [2024-10-24 05:23:00,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:23:00,299 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:23:00,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00 WrapperNode [2024-10-24 05:23:00,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:23:00,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:23:00,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:23:00,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:23:00,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00" (1/1) ... [2024-10-24 05:23:00,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00" (1/1) ... [2024-10-24 05:23:00,362 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-10-24 05:23:00,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:23:00,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:23:00,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:23:00,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:23:00,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00" (1/1) ... [2024-10-24 05:23:00,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00" (1/1) ... [2024-10-24 05:23:00,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00" (1/1) ... [2024-10-24 05:23:00,403 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:23:00,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00" (1/1) ... [2024-10-24 05:23:00,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00" (1/1) ... [2024-10-24 05:23:00,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00" (1/1) ... [2024-10-24 05:23:00,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00" (1/1) ... [2024-10-24 05:23:00,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00" (1/1) ... [2024-10-24 05:23:00,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00" (1/1) ... [2024-10-24 05:23:00,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:23:00,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:23:00,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:23:00,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:23:00,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00" (1/1) ... [2024-10-24 05:23:00,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:23:00,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:23:00,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:23:00,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:23:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:23:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:23:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:23:00,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:23:00,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:23:00,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:23:00,589 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:23:00,591 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:23:07,645 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:23:07,646 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:23:07,711 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:23:07,713 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:23:07,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:23:07 BoogieIcfgContainer [2024-10-24 05:23:07,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:23:07,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:23:07,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:23:07,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:23:07,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:22:59" (1/3) ... [2024-10-24 05:23:07,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286502e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:23:07, skipping insertion in model container [2024-10-24 05:23:07,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:00" (2/3) ... [2024-10-24 05:23:07,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286502e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:23:07, skipping insertion in model container [2024-10-24 05:23:07,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:23:07" (3/3) ... [2024-10-24 05:23:07,723 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-63.i [2024-10-24 05:23:07,738 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:23:07,738 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:23:07,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:23:07,822 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;@89f5602, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:23:07,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:23:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 05:23:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 05:23:07,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:23:07,839 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:23:07,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:23:07,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:23:07,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1504902004, now seen corresponding path program 1 times [2024-10-24 05:23:07,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:23:07,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727819013] [2024-10-24 05:23:07,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:23:07,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:23:07,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:23:07,860 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:23:07,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 05:23:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:08,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:23:08,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:23:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2024-10-24 05:23:08,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:23:08,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:23:08,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727819013] [2024-10-24 05:23:08,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727819013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:23:08,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:23:08,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:23:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834594197] [2024-10-24 05:23:08,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:23:08,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:23:08,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:23:08,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:23:08,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:23:08,424 INFO L87 Difference]: Start difference. First operand has 79 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-24 05:23:11,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:23:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:23:11,288 INFO L93 Difference]: Finished difference Result 155 states and 286 transitions. [2024-10-24 05:23:11,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:23:11,331 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 213 [2024-10-24 05:23:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:23:11,342 INFO L225 Difference]: With dead ends: 155 [2024-10-24 05:23:11,342 INFO L226 Difference]: Without dead ends: 77 [2024-10-24 05:23:11,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:23:11,349 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 05:23:11,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 05:23:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-24 05:23:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-24 05:23:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 05:23:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 121 transitions. [2024-10-24 05:23:11,393 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 121 transitions. Word has length 213 [2024-10-24 05:23:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:23:11,393 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 121 transitions. [2024-10-24 05:23:11,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-24 05:23:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 121 transitions. [2024-10-24 05:23:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 05:23:11,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:23:11,398 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:23:11,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 05:23:11,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:23:11,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:23:11,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:23:11,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1096220712, now seen corresponding path program 1 times [2024-10-24 05:23:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:23:11,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376392784] [2024-10-24 05:23:11,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:23:11,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:23:11,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:23:11,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:23:11,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 05:23:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:12,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 05:23:12,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:23:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-24 05:23:12,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:23:12,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:23:12,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376392784] [2024-10-24 05:23:12,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376392784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:23:12,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:23:12,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:23:12,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122511917] [2024-10-24 05:23:12,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:23:12,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:23:12,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:23:12,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:23:12,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:23:12,093 INFO L87 Difference]: Start difference. First operand 77 states and 121 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:13,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:23:16,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:23:19,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:23:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:23:19,481 INFO L93 Difference]: Finished difference Result 184 states and 287 transitions. [2024-10-24 05:23:19,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:23:19,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 213 [2024-10-24 05:23:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:23:19,487 INFO L225 Difference]: With dead ends: 184 [2024-10-24 05:23:19,487 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 05:23:19,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:23:19,489 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 39 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:23:19,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 228 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-10-24 05:23:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 05:23:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-10-24 05:23:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 05:23:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 162 transitions. [2024-10-24 05:23:19,522 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 162 transitions. Word has length 213 [2024-10-24 05:23:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:23:19,524 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 162 transitions. [2024-10-24 05:23:19,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 162 transitions. [2024-10-24 05:23:19,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 05:23:19,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:23:19,533 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:23:19,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 05:23:19,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:23:19,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:23:19,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:23:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1096161130, now seen corresponding path program 1 times [2024-10-24 05:23:19,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:23:19,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326214727] [2024-10-24 05:23:19,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:23:19,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:23:19,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:23:19,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:23:19,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 05:23:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:20,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 05:23:20,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:23:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-24 05:23:20,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:23:20,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:23:20,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326214727] [2024-10-24 05:23:20,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326214727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:23:20,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:23:20,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:23:20,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474661194] [2024-10-24 05:23:20,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:23:20,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:23:20,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:23:20,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:23:20,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:23:20,162 INFO L87 Difference]: Start difference. First operand 105 states and 162 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:22,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:23:25,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:23:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:23:25,240 INFO L93 Difference]: Finished difference Result 219 states and 334 transitions. [2024-10-24 05:23:25,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:23:25,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 213 [2024-10-24 05:23:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:23:25,244 INFO L225 Difference]: With dead ends: 219 [2024-10-24 05:23:25,244 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 05:23:25,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:23:25,248 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 43 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:23:25,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 259 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-24 05:23:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 05:23:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2024-10-24 05:23:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 05:23:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 136 transitions. [2024-10-24 05:23:25,270 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 136 transitions. Word has length 213 [2024-10-24 05:23:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:23:25,272 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 136 transitions. [2024-10-24 05:23:25,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2024-10-24 05:23:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 05:23:25,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:23:25,276 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:23:25,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 05:23:25,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:23:25,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:23:25,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:23:25,480 INFO L85 PathProgramCache]: Analyzing trace with hash 678846232, now seen corresponding path program 1 times [2024-10-24 05:23:25,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:23:25,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682004598] [2024-10-24 05:23:25,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:23:25,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:23:25,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:23:25,484 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:23:25,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 05:23:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 05:23:26,026 INFO L278 TraceCheckSpWp]: Computing forward predicates...