./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.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 b3ab8989cae4393a8cbf1c0c6e0a27c5ce2ad38815cddf562090bcf36daabdd7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:40:51,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:40:51,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:40:51,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:40:51,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:40:51,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:40:51,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:40:51,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:40:51,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:40:51,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:40:51,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:40:51,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:40:51,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:40:51,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:40:51,660 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:40:51,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:40:51,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:40:51,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:40:51,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:40:51,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:40:51,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:40:51,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:40:51,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:40:51,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:40:51,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:40:51,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:40:51,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:40:51,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:40:51,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:40:51,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:40:51,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:40:51,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:40:51,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:40:51,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:40:51,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:40:51,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:40:51,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:40:51,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:40:51,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:40:51,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:40:51,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:40:51,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:40:51,672 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 -> b3ab8989cae4393a8cbf1c0c6e0a27c5ce2ad38815cddf562090bcf36daabdd7 [2024-10-13 01:40:51,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:40:51,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:40:51,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:40:51,929 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:40:51,929 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:40:51,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i [2024-10-13 01:40:53,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:40:53,657 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:40:53,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i [2024-10-13 01:40:53,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac77ecf7/9373d94df9f54a5bb0224dd2a5753002/FLAG2ddd76896 [2024-10-13 01:40:53,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac77ecf7/9373d94df9f54a5bb0224dd2a5753002 [2024-10-13 01:40:53,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:40:53,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:40:53,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:40:53,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:40:53,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:40:53,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc9ed21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53, skipping insertion in model container [2024-10-13 01:40:53,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:40:53,915 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i[919,932] [2024-10-13 01:40:54,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:40:54,015 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:40:54,025 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i[919,932] [2024-10-13 01:40:54,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:40:54,084 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:40:54,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54 WrapperNode [2024-10-13 01:40:54,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:40:54,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:40:54,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:40:54,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:40:54,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54" (1/1) ... [2024-10-13 01:40:54,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54" (1/1) ... [2024-10-13 01:40:54,154 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 234 [2024-10-13 01:40:54,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:40:54,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:40:54,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:40:54,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:40:54,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54" (1/1) ... [2024-10-13 01:40:54,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54" (1/1) ... [2024-10-13 01:40:54,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54" (1/1) ... [2024-10-13 01:40:54,188 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-13 01:40:54,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54" (1/1) ... [2024-10-13 01:40:54,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54" (1/1) ... [2024-10-13 01:40:54,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54" (1/1) ... [2024-10-13 01:40:54,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54" (1/1) ... [2024-10-13 01:40:54,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54" (1/1) ... [2024-10-13 01:40:54,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54" (1/1) ... [2024-10-13 01:40:54,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:40:54,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:40:54,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:40:54,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:40:54,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54" (1/1) ... [2024-10-13 01:40:54,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:40:54,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:40:54,262 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-13 01:40:54,265 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-13 01:40:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:40:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:40:54,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:40:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:40:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:40:54,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:40:54,417 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:40:54,419 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:40:54,839 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 01:40:54,839 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:40:54,891 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:40:54,892 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:40:54,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:40:54 BoogieIcfgContainer [2024-10-13 01:40:54,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:40:54,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:40:54,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:40:54,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:40:54,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:40:53" (1/3) ... [2024-10-13 01:40:54,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3dd3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:40:54, skipping insertion in model container [2024-10-13 01:40:54,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:54" (2/3) ... [2024-10-13 01:40:54,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3dd3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:40:54, skipping insertion in model container [2024-10-13 01:40:54,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:40:54" (3/3) ... [2024-10-13 01:40:54,903 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i [2024-10-13 01:40:54,918 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:40:54,918 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:40:54,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:40:54,996 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;@36d2729, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:40:54,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:40:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 61 states have internal predecessors, (92), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:40:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 01:40:55,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:55,020 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:55,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:55,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1219815357, now seen corresponding path program 1 times [2024-10-13 01:40:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:55,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467299090] [2024-10-13 01:40:55,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:55,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:40:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:40:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:40:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:40:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:40:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:40:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:40:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:40:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:40:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:40:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:40:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:40:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:40:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:40:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:40:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:40:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:40:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:40:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:40:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:40:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:40:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:40:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:40:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:40:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:40:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:40:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 01:40:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:40:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 01:40:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:40:55,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:55,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467299090] [2024-10-13 01:40:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467299090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:55,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:55,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:40:55,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544008173] [2024-10-13 01:40:55,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:55,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:40:55,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:55,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:40:55,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:40:55,687 INFO L87 Difference]: Start difference. First operand has 95 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 61 states have internal predecessors, (92), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:40:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:55,731 INFO L93 Difference]: Finished difference Result 187 states and 342 transitions. [2024-10-13 01:40:55,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:40:55,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-10-13 01:40:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:55,743 INFO L225 Difference]: With dead ends: 187 [2024-10-13 01:40:55,743 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 01:40:55,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 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-13 01:40:55,749 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:55,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:40:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 01:40:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 01:40:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 59 states have internal predecessors, (86), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:40:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 150 transitions. [2024-10-13 01:40:55,795 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 150 transitions. Word has length 198 [2024-10-13 01:40:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:55,798 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 150 transitions. [2024-10-13 01:40:55,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:40:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 150 transitions. [2024-10-13 01:40:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 01:40:55,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:55,804 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:55,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:40:55,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:55,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:55,805 INFO L85 PathProgramCache]: Analyzing trace with hash -518750779, now seen corresponding path program 1 times [2024-10-13 01:40:55,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:55,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920965044] [2024-10-13 01:40:55,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:55,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:40:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:40:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:40:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:40:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:40:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:40:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:40:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:40:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:40:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:40:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:40:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:40:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:40:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:40:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:40:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:40:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:40:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:40:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:40:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:40:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:40:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:40:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:40:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:40:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:40:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:40:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 01:40:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:40:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 01:40:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:40:56,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:56,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920965044] [2024-10-13 01:40:56,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920965044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:56,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:56,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 01:40:56,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40394667] [2024-10-13 01:40:56,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:56,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 01:40:56,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:56,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 01:40:56,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:40:56,477 INFO L87 Difference]: Start difference. First operand 93 states and 150 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:40:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:56,909 INFO L93 Difference]: Finished difference Result 304 states and 491 transitions. [2024-10-13 01:40:56,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 01:40:56,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 198 [2024-10-13 01:40:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:56,918 INFO L225 Difference]: With dead ends: 304 [2024-10-13 01:40:56,920 INFO L226 Difference]: Without dead ends: 212 [2024-10-13 01:40:56,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 01:40:56,922 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 453 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:56,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 538 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 01:40:56,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-13 01:40:56,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 182. [2024-10-13 01:40:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 115 states have (on average 1.4521739130434783) internal successors, (167), 115 states have internal predecessors, (167), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 01:40:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 295 transitions. [2024-10-13 01:40:56,973 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 295 transitions. Word has length 198 [2024-10-13 01:40:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:56,974 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 295 transitions. [2024-10-13 01:40:56,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:40:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 295 transitions. [2024-10-13 01:40:56,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 01:40:56,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:56,978 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:56,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:40:56,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:56,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:56,979 INFO L85 PathProgramCache]: Analyzing trace with hash -260585341, now seen corresponding path program 1 times [2024-10-13 01:40:56,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:56,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259161383] [2024-10-13 01:40:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:40:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:40:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:40:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:40:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:40:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:40:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:40:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:40:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:40:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:40:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:40:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:40:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:40:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:40:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:40:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:40:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:40:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:40:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:40:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:40:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:40:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:40:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:40:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:40:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:40:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:40:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 01:40:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:40:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 01:40:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:40:57,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259161383] [2024-10-13 01:40:57,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259161383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:57,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:57,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:40:57,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369444293] [2024-10-13 01:40:57,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:57,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:40:57,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:57,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:40:57,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:40:57,218 INFO L87 Difference]: Start difference. First operand 182 states and 295 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:40:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:57,268 INFO L93 Difference]: Finished difference Result 337 states and 545 transitions. [2024-10-13 01:40:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:40:57,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-10-13 01:40:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:57,272 INFO L225 Difference]: With dead ends: 337 [2024-10-13 01:40:57,272 INFO L226 Difference]: Without dead ends: 156 [2024-10-13 01:40:57,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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-13 01:40:57,277 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:57,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:40:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-13 01:40:57,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 92. [2024-10-13 01:40:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:40:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 147 transitions. [2024-10-13 01:40:57,298 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 147 transitions. Word has length 198 [2024-10-13 01:40:57,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:57,299 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 147 transitions. [2024-10-13 01:40:57,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:40:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 147 transitions. [2024-10-13 01:40:57,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 01:40:57,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:57,302 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:57,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:40:57,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:57,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1833313083, now seen corresponding path program 1 times [2024-10-13 01:40:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:57,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522158486] [2024-10-13 01:40:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:40:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:40:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:40:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:40:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:40:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:40:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:40:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:40:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:40:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:40:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:40:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:40:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:40:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:40:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:40:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:40:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:40:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:40:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:40:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:40:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:40:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:40:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:40:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:40:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:40:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:40:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 01:40:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:40:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 01:40:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:40:57,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:57,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522158486] [2024-10-13 01:40:57,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522158486] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:40:57,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440576293] [2024-10-13 01:40:57,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:57,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:40:57,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:40:57,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:40:57,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 01:40:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:57,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 01:40:57,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:40:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2024-10-13 01:40:58,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:40:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:40:58,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440576293] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:40:58,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:40:58,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 01:40:58,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924085648] [2024-10-13 01:40:58,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:40:58,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 01:40:58,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:58,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 01:40:58,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:40:58,541 INFO L87 Difference]: Start difference. First operand 92 states and 147 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-13 01:40:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:58,818 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2024-10-13 01:40:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 01:40:58,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 198 [2024-10-13 01:40:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:58,820 INFO L225 Difference]: With dead ends: 191 [2024-10-13 01:40:58,820 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 01:40:58,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 456 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 01:40:58,822 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 179 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:58,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 233 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:40:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 01:40:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-10-13 01:40:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:40:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-10-13 01:40:58,833 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 198 [2024-10-13 01:40:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:58,834 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-10-13 01:40:58,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-13 01:40:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-10-13 01:40:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-13 01:40:58,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:58,837 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:58,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 01:40:59,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:40:59,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:59,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash -960358445, now seen corresponding path program 1 times [2024-10-13 01:40:59,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:59,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109134251] [2024-10-13 01:40:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:40:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:40:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:40:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:40:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:40:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:40:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:40:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:40:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:40:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:40:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:40:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:40:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:40:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:40:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:40:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:40:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:40:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:40:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:40:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:40:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:40:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:40:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:40:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:40:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:40:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:40:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 01:40:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:40:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 01:40:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:40:59,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:59,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109134251] [2024-10-13 01:40:59,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109134251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:59,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:59,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:40:59,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318825477] [2024-10-13 01:40:59,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:59,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:40:59,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:59,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:40:59,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:40:59,378 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:40:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:59,409 INFO L93 Difference]: Finished difference Result 191 states and 291 transitions. [2024-10-13 01:40:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:40:59,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2024-10-13 01:40:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:59,413 INFO L225 Difference]: With dead ends: 191 [2024-10-13 01:40:59,413 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 01:40:59,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:40:59,415 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 128 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:59,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 163 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:40:59,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 01:40:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-13 01:40:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 61 states have internal predecessors, (81), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:40:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 145 transitions. [2024-10-13 01:40:59,433 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 145 transitions. Word has length 199 [2024-10-13 01:40:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:59,434 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 145 transitions. [2024-10-13 01:40:59,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:40:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 145 transitions. [2024-10-13 01:40:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 01:40:59,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:59,438 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:59,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 01:40:59,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:59,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:59,439 INFO L85 PathProgramCache]: Analyzing trace with hash 40522442, now seen corresponding path program 1 times [2024-10-13 01:40:59,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:59,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679009588] [2024-10-13 01:40:59,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:59,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:40:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:40:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:40:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:40:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:40:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:40:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:40:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:40:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:40:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:40:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:40:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:40:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:40:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:40:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:40:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:40:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:40:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:40:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:40:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:40:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:40:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:40:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:40:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:40:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:40:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:40:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 01:40:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:40:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 01:40:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 114 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2024-10-13 01:40:59,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679009588] [2024-10-13 01:40:59,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679009588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:40:59,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134713880] [2024-10-13 01:40:59,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:59,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:40:59,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:40:59,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:40:59,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 01:41:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:00,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 01:41:00,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-10-13 01:41:00,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:41:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 117 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-10-13 01:41:01,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134713880] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:41:01,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:41:01,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2024-10-13 01:41:01,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439297605] [2024-10-13 01:41:01,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:41:01,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 01:41:01,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:41:01,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 01:41:01,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:41:01,232 INFO L87 Difference]: Start difference. First operand 96 states and 145 transitions. Second operand has 15 states, 15 states have (on average 7.266666666666667) internal successors, (109), 15 states have internal predecessors, (109), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2024-10-13 01:41:01,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:01,618 INFO L93 Difference]: Finished difference Result 207 states and 303 transitions. [2024-10-13 01:41:01,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 01:41:01,619 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.266666666666667) internal successors, (109), 15 states have internal predecessors, (109), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) Word has length 200 [2024-10-13 01:41:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:01,621 INFO L225 Difference]: With dead ends: 207 [2024-10-13 01:41:01,621 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 01:41:01,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=269, Unknown=0, NotChecked=0, Total=420 [2024-10-13 01:41:01,623 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 110 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:01,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 296 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 01:41:01,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 01:41:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2024-10-13 01:41:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 67 states have internal predecessors, (86), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:41:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2024-10-13 01:41:01,640 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 200 [2024-10-13 01:41:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:01,641 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2024-10-13 01:41:01,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.266666666666667) internal successors, (109), 15 states have internal predecessors, (109), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2024-10-13 01:41:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2024-10-13 01:41:01,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 01:41:01,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:01,644 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:41:01,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 01:41:01,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 01:41:01,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:01,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:01,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1553003564, now seen corresponding path program 1 times [2024-10-13 01:41:01,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:41:01,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311453625] [2024-10-13 01:41:01,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:01,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:41:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:41:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:41:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:41:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:41:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:41:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:41:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:41:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:41:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:41:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:41:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:41:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:41:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:41:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:41:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:41:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:41:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:41:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:41:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:41:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:41:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:41:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:41:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:41:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:41:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:41:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:41:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:41:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:41:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:41:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 01:41:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:41:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 01:41:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 177 refuted. 0 times theorem prover too weak. 1723 trivial. 0 not checked. [2024-10-13 01:41:02,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:41:02,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311453625] [2024-10-13 01:41:02,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311453625] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:41:02,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267237481] [2024-10-13 01:41:02,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:02,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:41:02,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:41:02,652 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:41:02,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 01:41:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:02,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 01:41:02,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1321 proven. 177 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-10-13 01:41:04,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:41:07,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267237481] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:41:07,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:41:07,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 16 [2024-10-13 01:41:07,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594334335] [2024-10-13 01:41:07,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:41:07,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 01:41:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:41:07,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 01:41:07,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=343, Unknown=1, NotChecked=0, Total=420 [2024-10-13 01:41:07,832 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 16 states, 16 states have (on average 5.6875) internal successors, (91), 15 states have internal predecessors, (91), 7 states have call successors, (54), 5 states have call predecessors, (54), 7 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54) [2024-10-13 01:41:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:09,084 INFO L93 Difference]: Finished difference Result 316 states and 438 transitions. [2024-10-13 01:41:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-13 01:41:09,084 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 15 states have internal predecessors, (91), 7 states have call successors, (54), 5 states have call predecessors, (54), 7 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54) Word has length 201 [2024-10-13 01:41:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:09,088 INFO L225 Difference]: With dead ends: 316 [2024-10-13 01:41:09,088 INFO L226 Difference]: Without dead ends: 213 [2024-10-13 01:41:09,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=391, Invalid=1248, Unknown=1, NotChecked=0, Total=1640 [2024-10-13 01:41:09,090 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 256 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:09,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 632 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 01:41:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-13 01:41:09,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 189. [2024-10-13 01:41:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 111 states have (on average 1.162162162162162) internal successors, (129), 112 states have internal predecessors, (129), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 01:41:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 257 transitions. [2024-10-13 01:41:09,123 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 257 transitions. Word has length 201 [2024-10-13 01:41:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:09,124 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 257 transitions. [2024-10-13 01:41:09,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 15 states have internal predecessors, (91), 7 states have call successors, (54), 5 states have call predecessors, (54), 7 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54) [2024-10-13 01:41:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 257 transitions. [2024-10-13 01:41:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-13 01:41:09,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:09,129 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:41:09,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 01:41:09,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:41:09,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:09,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:09,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1580023093, now seen corresponding path program 1 times [2024-10-13 01:41:09,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:41:09,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125402292] [2024-10-13 01:41:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:41:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:41:09,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222249333] [2024-10-13 01:41:09,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:09,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:41:09,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:41:09,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:41:09,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 01:41:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:41:09,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:41:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:41:09,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:41:09,829 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:41:09,830 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:41:09,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 01:41:10,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:41:10,036 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:41:10,180 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:41:10,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:41:10 BoogieIcfgContainer [2024-10-13 01:41:10,184 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:41:10,184 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:41:10,184 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:41:10,185 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:41:10,185 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:40:54" (3/4) ... [2024-10-13 01:41:10,187 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:41:10,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:41:10,189 INFO L158 Benchmark]: Toolchain (without parser) took 16498.19ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 103.3MB in the beginning and 91.4MB in the end (delta: 11.9MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2024-10-13 01:41:10,189 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:41:10,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.72ms. Allocated memory is still 172.0MB. Free memory was 103.1MB in the beginning and 136.5MB in the end (delta: -33.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 01:41:10,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.43ms. Allocated memory is still 172.0MB. Free memory was 136.5MB in the beginning and 131.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 01:41:10,190 INFO L158 Benchmark]: Boogie Preprocessor took 63.04ms. Allocated memory is still 172.0MB. Free memory was 131.3MB in the beginning and 125.4MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 01:41:10,190 INFO L158 Benchmark]: RCFGBuilder took 672.23ms. Allocated memory is still 172.0MB. Free memory was 125.4MB in the beginning and 90.5MB in the end (delta: 34.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-13 01:41:10,191 INFO L158 Benchmark]: TraceAbstraction took 15288.97ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 90.1MB in the beginning and 92.4MB in the end (delta: -2.4MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2024-10-13 01:41:10,191 INFO L158 Benchmark]: Witness Printer took 4.01ms. Allocated memory is still 255.9MB. Free memory was 92.4MB in the beginning and 91.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 01:41:10,192 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.19ms. Allocated memory is still 104.9MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.72ms. Allocated memory is still 172.0MB. Free memory was 103.1MB in the beginning and 136.5MB in the end (delta: -33.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.43ms. Allocated memory is still 172.0MB. Free memory was 136.5MB in the beginning and 131.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.04ms. Allocated memory is still 172.0MB. Free memory was 131.3MB in the beginning and 125.4MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 672.23ms. Allocated memory is still 172.0MB. Free memory was 125.4MB in the beginning and 90.5MB in the end (delta: 34.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15288.97ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 90.1MB in the beginning and 92.4MB in the end (delta: -2.4MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. * Witness Printer took 4.01ms. Allocated memory is still 255.9MB. Free memory was 92.4MB in the beginning and 91.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 someBinaryFLOATComparisonOperation at line 198. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] float var_1_2 = 255.5; [L24] float var_1_3 = 99.8; [L25] signed char var_1_4 = -25; [L26] float var_1_6 = 255.25; [L27] unsigned short int var_1_7 = 16; [L28] signed char var_1_8 = -10; [L29] signed char var_1_9 = -8; [L30] unsigned short int var_1_10 = 8; [L31] unsigned short int var_1_11 = 10000; [L32] unsigned short int var_1_12 = 5; [L33] signed short int var_1_13 = 200; [L34] unsigned char var_1_15 = 0; [L35] unsigned short int var_1_16 = 35895; [L36] unsigned short int var_1_17 = 18336; [L37] unsigned char var_1_18 = 0; [L38] signed long int var_1_19 = -50; [L39] unsigned char var_1_20 = 10; [L40] unsigned char var_1_22 = 100; [L41] unsigned char var_1_23 = 16; [L42] signed long int var_1_24 = -256; [L43] unsigned char var_1_25 = 1; [L44] unsigned char var_1_30 = 25; [L45] signed char var_1_32 = 1; [L46] unsigned char var_1_33 = 200; [L47] unsigned char var_1_34 = 64; [L48] unsigned char var_1_35 = 64; [L49] unsigned char var_1_36 = 8; [L50] unsigned short int var_1_37 = 500; [L51] unsigned char var_1_38 = 32; [L52] unsigned short int var_1_39 = 25; [L53] signed char last_1_var_1_8 = -10; [L54] unsigned char last_1_var_1_15 = 0; [L55] signed long int last_1_var_1_19 = -50; [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L193] last_1_var_1_8 = var_1_8 [L194] last_1_var_1_15 = var_1_15 [L195] last_1_var_1_19 = var_1_19 [L205] RET updateLastVariables() [L206] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L143] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L144] var_1_3 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L145] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L146] var_1_4 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L147] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L149] var_1_6 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L150] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L151] var_1_7 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_8=-10, var_1_9=-8] [L152] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_8=-10, var_1_9=-8] [L153] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L153] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L154] var_1_9 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L155] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L156] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L156] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L157] var_1_11 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_11 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L158] RET assume_abort_if_not(var_1_11 >= 8191) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L159] CALL assume_abort_if_not(var_1_11 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L159] RET assume_abort_if_not(var_1_11 <= 16384) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L160] var_1_12 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L161] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L162] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L162] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L163] var_1_16 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L164] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L165] CALL assume_abort_if_not(var_1_16 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L165] RET assume_abort_if_not(var_1_16 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L166] var_1_17 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_17 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L167] RET assume_abort_if_not(var_1_17 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L168] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L168] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L169] var_1_18 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L170] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L171] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L171] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L172] var_1_22 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L173] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L174] CALL assume_abort_if_not(var_1_22 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L174] RET assume_abort_if_not(var_1_22 <= 254) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L175] var_1_32 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_32 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L176] RET assume_abort_if_not(var_1_32 >= -128) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L177] CALL assume_abort_if_not(var_1_32 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L177] RET assume_abort_if_not(var_1_32 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L178] CALL assume_abort_if_not(var_1_32 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L178] RET assume_abort_if_not(var_1_32 != 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L179] var_1_33 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_33 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L180] RET assume_abort_if_not(var_1_33 >= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L181] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L181] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L182] var_1_34 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L183] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L184] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L184] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L185] var_1_35 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_35 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L186] RET assume_abort_if_not(var_1_35 >= 63) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L187] CALL assume_abort_if_not(var_1_35 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L187] RET assume_abort_if_not(var_1_35 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L188] var_1_36 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L189] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L190] CALL assume_abort_if_not(var_1_36 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L190] RET assume_abort_if_not(var_1_36 <= 63) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L206] RET updateVariables() [L207] CALL step() [L59] signed long int stepLocal_0 = (((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_0=1, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L60] COND FALSE !(stepLocal_0 <= last_1_var_1_8) [L67] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L69] COND TRUE (- var_1_7) < (var_1_1 * var_1_4) [L70] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L72] COND FALSE !((var_1_6 * var_1_2) <= var_1_3) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L79] signed long int stepLocal_1 = var_1_16 - (var_1_17 - 256); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L80] COND FALSE !(var_1_3 != var_1_6) [L87] var_1_15 = var_1_18 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, var_1_10=8, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L89] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) [L90] unsigned short int stepLocal_4 = var_1_1; [L91] signed long int stepLocal_3 = var_1_7 + (128 + var_1_1); [L92] signed long int stepLocal_2 = - var_1_10; VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_2=-18232, stepLocal_3=130, stepLocal_4=-65535, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L93] COND FALSE !(var_1_1 < stepLocal_2) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, stepLocal_4=-65535, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L98] COND TRUE stepLocal_4 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11) [L99] var_1_19 = ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L104] COND FALSE !(var_1_7 <= -1) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L107] var_1_23 = var_1_22 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L108] EXPR var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L108] EXPR var_1_8 & (var_1_22 >> var_1_4) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L108] COND TRUE var_1_13 >= (var_1_8 & (var_1_22 >> var_1_4)) [L109] var_1_24 = (var_1_22 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L115] COND TRUE var_1_16 >= (-128 & var_1_11) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L116] COND FALSE !((((((var_1_3) > (var_1_3)) ? (var_1_3) : (var_1_3))) <= var_1_3) && var_1_18) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L122] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L125] COND TRUE ! var_1_15 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L126] COND TRUE (var_1_9 % var_1_32) <= var_1_11 [L127] var_1_30 = (var_1_33 - ((((var_1_34) > ((var_1_35 - var_1_36))) ? (var_1_34) : ((var_1_35 - var_1_36))))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L131] COND TRUE ((((var_1_1) > (var_1_10)) ? (var_1_1) : (var_1_10))) > var_1_32 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L132] COND TRUE ! var_1_18 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L133] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16639, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L138] var_1_38 = var_1_34 [L139] var_1_39 = var_1_11 [L207] RET step() [L208] CALL, EXPR property() [L198-L199] return ((((((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) <= last_1_var_1_8) ? (((- var_1_3) > ((((var_1_2) > (var_1_6)) ? (var_1_2) : (var_1_6)))) ? (var_1_1 == ((unsigned short int) var_1_7)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) && (((- var_1_7) < (var_1_1 * var_1_4)) ? (var_1_8 == ((signed char) var_1_9)) : 1)) && (var_1_10 == ((unsigned short int) (50 + ((var_1_11 + 10000) - var_1_12))))) && (((var_1_6 * var_1_2) <= var_1_3) ? (last_1_var_1_15 ? (var_1_13 == ((signed short int) (-10 + var_1_12))) : (var_1_13 == ((signed short int) var_1_4))) : 1)) && ((var_1_3 != var_1_6) ? ((var_1_13 >= (var_1_16 - (var_1_17 - 256))) ? (var_1_15 == ((unsigned char) var_1_18)) : (var_1_15 == ((unsigned char) var_1_18))) : (var_1_15 == ((unsigned char) var_1_18)))) && ((var_1_1 < (- var_1_10)) ? (((var_1_7 + (128 + var_1_1)) <= last_1_var_1_19) ? (var_1_19 == ((signed long int) var_1_4)) : 1) : ((var_1_1 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11)) ? (var_1_19 == ((signed long int) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : (var_1_19 == ((signed long int) var_1_16)))) ; [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=73728, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18232, var_1_11=73728, var_1_12=10, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=16384, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=-129, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=73728, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 8, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1164 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1126 mSDsluCounter, 2286 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1318 mSDsCounter, 492 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1472 IncrementalHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 492 mSolverCounterUnsat, 968 mSDtfsCounter, 1472 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1644 GetRequests, 1565 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=7, InterpolantAutomatonStates: 73, 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, 7 MinimizatonAttempts, 130 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2397 NumberOfCodeBlocks, 2397 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2377 ConstructedInterpolants, 0 QuantifiedInterpolants, 8960 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1387 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 22992/23808 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-13 01:41:10,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.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 b3ab8989cae4393a8cbf1c0c6e0a27c5ce2ad38815cddf562090bcf36daabdd7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:41:12,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:41:12,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:41:12,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:41:12,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:41:12,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:41:12,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:41:12,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:41:12,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:41:12,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:41:12,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:41:12,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:41:12,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:41:12,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:41:12,571 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:41:12,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:41:12,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:41:12,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:41:12,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:41:12,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:41:12,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:41:12,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:41:12,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:41:12,581 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:41:12,581 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:41:12,581 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:41:12,582 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:41:12,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:41:12,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:41:12,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:41:12,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:41:12,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:41:12,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:41:12,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:41:12,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:41:12,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:41:12,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:41:12,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:41:12,585 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:41:12,586 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:41:12,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:41:12,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:41:12,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:41:12,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:41:12,588 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:41:12,588 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 -> b3ab8989cae4393a8cbf1c0c6e0a27c5ce2ad38815cddf562090bcf36daabdd7 [2024-10-13 01:41:12,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:41:12,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:41:12,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:41:12,954 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:41:12,955 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:41:12,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i [2024-10-13 01:41:14,540 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:41:14,768 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:41:14,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i [2024-10-13 01:41:14,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a46057b2e/2807226401e340868fa2bd8cf8a33560/FLAG97a46fd83 [2024-10-13 01:41:15,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a46057b2e/2807226401e340868fa2bd8cf8a33560 [2024-10-13 01:41:15,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:41:15,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:41:15,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:41:15,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:41:15,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:41:15,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6385f3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15, skipping insertion in model container [2024-10-13 01:41:15,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:41:15,377 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i[919,932] [2024-10-13 01:41:15,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:41:15,461 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:41:15,473 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i[919,932] [2024-10-13 01:41:15,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:41:15,525 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:41:15,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15 WrapperNode [2024-10-13 01:41:15,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:41:15,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:41:15,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:41:15,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:41:15,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,584 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-10-13 01:41:15,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:41:15,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:41:15,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:41:15,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:41:15,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,625 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-13 01:41:15,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:41:15,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:41:15,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:41:15,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:41:15,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:41:15,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:41:15,710 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-13 01:41:15,712 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-13 01:41:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:41:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:41:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:41:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:41:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:41:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:41:15,836 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:41:15,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:41:16,903 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 01:41:16,904 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:41:16,964 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:41:16,968 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:41:16,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:41:16 BoogieIcfgContainer [2024-10-13 01:41:16,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:41:16,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:41:16,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:41:16,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:41:16,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:41:15" (1/3) ... [2024-10-13 01:41:16,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11763cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:41:16, skipping insertion in model container [2024-10-13 01:41:16,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (2/3) ... [2024-10-13 01:41:16,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11763cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:41:16, skipping insertion in model container [2024-10-13 01:41:16,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:41:16" (3/3) ... [2024-10-13 01:41:16,978 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i [2024-10-13 01:41:16,995 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:41:16,996 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:41:17,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:41:17,073 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;@a0ba94f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:41:17,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:41:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:41:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-13 01:41:17,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:17,091 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:41:17,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:17,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:17,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1685958618, now seen corresponding path program 1 times [2024-10-13 01:41:17,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:41:17,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119360943] [2024-10-13 01:41:17,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:17,108 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-13 01:41:17,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:41:17,112 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-13 01:41:17,129 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-13 01:41:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:17,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 01:41:17,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2024-10-13 01:41:17,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:41:17,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:41:17,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119360943] [2024-10-13 01:41:17,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119360943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:41:17,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:41:17,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:41:17,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165413773] [2024-10-13 01:41:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:41:17,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:41:17,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:41:17,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:41:17,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:41:17,533 INFO L87 Difference]: Start difference. First operand has 86 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:41:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:17,785 INFO L93 Difference]: Finished difference Result 169 states and 312 transitions. [2024-10-13 01:41:17,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:41:17,798 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2024-10-13 01:41:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:17,805 INFO L225 Difference]: With dead ends: 169 [2024-10-13 01:41:17,805 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 01:41:17,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 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-13 01:41:17,812 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:17,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:41:17,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 01:41:17,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 01:41:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:41:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 135 transitions. [2024-10-13 01:41:17,860 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 135 transitions. Word has length 196 [2024-10-13 01:41:17,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:17,860 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 135 transitions. [2024-10-13 01:41:17,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:41:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 135 transitions. [2024-10-13 01:41:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-13 01:41:17,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:17,872 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:41:17,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 01:41:18,072 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-13 01:41:18,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:18,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1920396836, now seen corresponding path program 1 times [2024-10-13 01:41:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:41:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197244934] [2024-10-13 01:41:18,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:18,076 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-13 01:41:18,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:41:18,078 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-13 01:41:18,080 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-13 01:41:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:18,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 01:41:18,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:41:18,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:41:18,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:41:18,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197244934] [2024-10-13 01:41:18,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197244934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:41:18,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:41:18,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:41:18,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866271209] [2024-10-13 01:41:18,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:41:18,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:41:18,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:41:18,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:41:18,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:41:18,443 INFO L87 Difference]: Start difference. First operand 84 states and 135 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:41:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:18,644 INFO L93 Difference]: Finished difference Result 166 states and 267 transitions. [2024-10-13 01:41:18,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:41:18,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2024-10-13 01:41:18,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:18,657 INFO L225 Difference]: With dead ends: 166 [2024-10-13 01:41:18,658 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 01:41:18,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 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-13 01:41:18,660 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:18,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:41:18,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 01:41:18,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 01:41:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:41:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 132 transitions. [2024-10-13 01:41:18,678 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 132 transitions. Word has length 196 [2024-10-13 01:41:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:18,680 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 132 transitions. [2024-10-13 01:41:18,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:41:18,681 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 132 transitions. [2024-10-13 01:41:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-13 01:41:18,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:18,684 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:41:18,695 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-13 01:41:18,885 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-13 01:41:18,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:18,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:18,887 INFO L85 PathProgramCache]: Analyzing trace with hash -688246564, now seen corresponding path program 1 times [2024-10-13 01:41:18,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:41:18,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401718947] [2024-10-13 01:41:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:18,888 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-13 01:41:18,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:41:18,892 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-13 01:41:18,893 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-13 01:41:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:19,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 01:41:19,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2024-10-13 01:41:19,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:41:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:41:19,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:41:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401718947] [2024-10-13 01:41:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401718947] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:41:19,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:41:19,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-13 01:41:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042958341] [2024-10-13 01:41:19,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:41:19,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 01:41:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:41:19,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 01:41:19,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:41:19,843 INFO L87 Difference]: Start difference. First operand 83 states and 132 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-13 01:41:20,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:20,534 INFO L93 Difference]: Finished difference Result 173 states and 270 transitions. [2024-10-13 01:41:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 01:41:20,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 196 [2024-10-13 01:41:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:20,539 INFO L225 Difference]: With dead ends: 173 [2024-10-13 01:41:20,539 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 01:41:20,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 01:41:20,541 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 59 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:20,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 189 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 01:41:20,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 01:41:20,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-10-13 01:41:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:41:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 131 transitions. [2024-10-13 01:41:20,556 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 131 transitions. Word has length 196 [2024-10-13 01:41:20,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:20,557 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 131 transitions. [2024-10-13 01:41:20,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-13 01:41:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 131 transitions. [2024-10-13 01:41:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-13 01:41:20,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:20,573 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:41:20,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 01:41:20,776 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-13 01:41:20,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:20,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash 176849920, now seen corresponding path program 1 times [2024-10-13 01:41:20,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:41:20,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128927293] [2024-10-13 01:41:20,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:20,779 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-13 01:41:20,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:41:20,782 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-13 01:41:20,783 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-13 01:41:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:20,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 01:41:20,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2024-10-13 01:41:21,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:41:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:41:21,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:41:21,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128927293] [2024-10-13 01:41:21,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128927293] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:41:21,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:41:21,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-13 01:41:21,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704644179] [2024-10-13 01:41:21,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:41:21,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 01:41:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:41:21,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 01:41:21,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:41:21,489 INFO L87 Difference]: Start difference. First operand 87 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-13 01:41:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:22,232 INFO L93 Difference]: Finished difference Result 177 states and 265 transitions. [2024-10-13 01:41:22,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 01:41:22,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 197 [2024-10-13 01:41:22,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:22,235 INFO L225 Difference]: With dead ends: 177 [2024-10-13 01:41:22,235 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 01:41:22,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 386 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:41:22,240 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 202 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:22,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 181 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 01:41:22,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 01:41:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-10-13 01:41:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:41:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2024-10-13 01:41:22,261 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 197 [2024-10-13 01:41:22,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:22,264 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2024-10-13 01:41:22,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-13 01:41:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2024-10-13 01:41:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 01:41:22,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:22,267 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:41:22,280 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 (5)] Forceful destruction successful, exit code 0 [2024-10-13 01:41:22,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:41:22,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:22,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:22,469 INFO L85 PathProgramCache]: Analyzing trace with hash 934128033, now seen corresponding path program 1 times [2024-10-13 01:41:22,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:41:22,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449796362] [2024-10-13 01:41:22,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:22,470 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-13 01:41:22,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:41:22,473 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:41:22,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 01:41:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:22,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 01:41:22,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-10-13 01:41:23,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:41:23,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:41:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449796362] [2024-10-13 01:41:23,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449796362] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:41:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [946369000] [2024-10-13 01:41:23,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:23,612 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 01:41:23,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 01:41:23,617 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 01:41:23,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-13 01:41:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:24,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 01:41:24,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-10-13 01:41:24,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:41:24,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [946369000] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:41:24,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:41:24,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-13 01:41:24,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218453420] [2024-10-13 01:41:24,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:41:24,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 01:41:24,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:41:24,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 01:41:24,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-13 01:41:24,964 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-13 01:41:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:25,787 INFO L93 Difference]: Finished difference Result 187 states and 271 transitions. [2024-10-13 01:41:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 01:41:25,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 198 [2024-10-13 01:41:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:25,802 INFO L225 Difference]: With dead ends: 187 [2024-10-13 01:41:25,802 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 01:41:25,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-10-13 01:41:25,804 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 48 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:25,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 238 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 01:41:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 01:41:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2024-10-13 01:41:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:41:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-10-13 01:41:25,816 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 198 [2024-10-13 01:41:25,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:25,817 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-10-13 01:41:25,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-13 01:41:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-10-13 01:41:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-13 01:41:25,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:25,820 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:41:25,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-10-13 01:41:26,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 01:41:26,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:41:26,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:26,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:26,221 INFO L85 PathProgramCache]: Analyzing trace with hash -810109543, now seen corresponding path program 1 times [2024-10-13 01:41:26,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:41:26,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616828399] [2024-10-13 01:41:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:26,222 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-13 01:41:26,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:41:26,225 INFO L229 MonitoredProcess]: Starting monitored process 8 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-13 01:41:26,226 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 (8)] Waiting until timeout for monitored process [2024-10-13 01:41:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:26,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 01:41:26,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 969 proven. 177 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2024-10-13 01:41:27,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:41:28,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:41:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616828399] [2024-10-13 01:41:28,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616828399] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:41:28,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1665851613] [2024-10-13 01:41:28,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:28,280 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 01:41:28,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 01:41:28,282 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 01:41:28,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-13 01:41:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:29,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 01:41:29,079 INFO L278 TraceCheckSpWp]: Computing forward predicates...