./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-pr-cn_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-4.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2e1352fbec5216d16d120c6803928d1b7fe6ca627ad10dd05f618180ded5608c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:39:28,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:39:28,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:39:28,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:39:28,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:39:28,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:39:28,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:39:28,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:39:28,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:39:28,901 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:39:28,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:39:28,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:39:28,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:39:28,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:39:28,908 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:39:28,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:39:28,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:39:28,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:39:28,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:39:28,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:39:28,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:39:28,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:39:28,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:39:28,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:39:28,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:39:28,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:39:28,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:39:28,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:39:28,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:39:28,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:39:28,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:39:28,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:39:28,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:39:28,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:39:28,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:39:28,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:39:28,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:39:28,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:39:28,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:39:28,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:39:28,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:39:28,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:39:28,919 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-clean/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-clean/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 -> 2e1352fbec5216d16d120c6803928d1b7fe6ca627ad10dd05f618180ded5608c [2024-10-11 09:39:29,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:39:29,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:39:29,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:39:29,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:39:29,205 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:39:29,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-4.i [2024-10-11 09:39:30,668 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:39:30,875 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:39:30,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-4.i [2024-10-11 09:39:30,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c828996cd/d6716a74deac4a2796dcbede7e45a7d0/FLAG6f85d43af [2024-10-11 09:39:30,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c828996cd/d6716a74deac4a2796dcbede7e45a7d0 [2024-10-11 09:39:30,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:39:30,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:39:30,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:39:30,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:39:30,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:39:30,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:39:30" (1/1) ... [2024-10-11 09:39:30,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe4c21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:30, skipping insertion in model container [2024-10-11 09:39:30,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:39:30" (1/1) ... [2024-10-11 09:39:30,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:39:31,117 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-pr-cn_file-4.i[918,931] [2024-10-11 09:39:31,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:39:31,238 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:39:31,255 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-pr-cn_file-4.i[918,931] [2024-10-11 09:39:31,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:39:31,324 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:39:31,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31 WrapperNode [2024-10-11 09:39:31,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:39:31,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:39:31,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:39:31,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:39:31,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31" (1/1) ... [2024-10-11 09:39:31,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31" (1/1) ... [2024-10-11 09:39:31,404 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 255 [2024-10-11 09:39:31,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:39:31,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:39:31,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:39:31,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:39:31,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31" (1/1) ... [2024-10-11 09:39:31,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31" (1/1) ... [2024-10-11 09:39:31,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31" (1/1) ... [2024-10-11 09:39:31,461 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-11 09:39:31,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31" (1/1) ... [2024-10-11 09:39:31,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31" (1/1) ... [2024-10-11 09:39:31,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31" (1/1) ... [2024-10-11 09:39:31,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31" (1/1) ... [2024-10-11 09:39:31,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31" (1/1) ... [2024-10-11 09:39:31,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31" (1/1) ... [2024-10-11 09:39:31,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:39:31,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:39:31,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:39:31,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:39:31,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31" (1/1) ... [2024-10-11 09:39:31,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:39:31,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:39:31,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:39:31,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:39:31,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:39:31,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:39:31,601 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:39:31,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:39:31,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:39:31,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:39:31,716 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:39:31,718 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:39:32,231 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 09:39:32,231 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:39:32,279 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:39:32,279 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:39:32,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:39:32 BoogieIcfgContainer [2024-10-11 09:39:32,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:39:32,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:39:32,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:39:32,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:39:32,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:39:30" (1/3) ... [2024-10-11 09:39:32,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112ea843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:39:32, skipping insertion in model container [2024-10-11 09:39:32,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:39:31" (2/3) ... [2024-10-11 09:39:32,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112ea843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:39:32, skipping insertion in model container [2024-10-11 09:39:32,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:39:32" (3/3) ... [2024-10-11 09:39:32,293 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-4.i [2024-10-11 09:39:32,310 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:39:32,311 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:39:32,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:39:32,384 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;@1c7fb27d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:39:32,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:39:32,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 64 states have (on average 1.46875) internal successors, (94), 65 states have internal predecessors, (94), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 09:39:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 09:39:32,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:39:32,407 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:39:32,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:39:32,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:39:32,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1982338237, now seen corresponding path program 1 times [2024-10-11 09:39:32,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:39:32,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016068239] [2024-10-11 09:39:32,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:32,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:39:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:39:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:39:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:39:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:39:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:39:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:39:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:39:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:39:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:39:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:39:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:39:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:39:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:39:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:39:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:39:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:39:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:39:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:32,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:39:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:39:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:39:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:39:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:39:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:39:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:39:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:39:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:39:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:39:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:39:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:39:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:39:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:39:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:39:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:39:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:39:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:39:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 09:39:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:39:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 09:39:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 09:39:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 09:39:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 09:39:33,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:39:33,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016068239] [2024-10-11 09:39:33,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016068239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:39:33,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:39:33,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:39:33,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524744286] [2024-10-11 09:39:33,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:39:33,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:39:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:39:33,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:39:33,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:39:33,194 INFO L87 Difference]: Start difference. First operand has 107 states, 64 states have (on average 1.46875) internal successors, (94), 65 states have internal predecessors, (94), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 09:39:33,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:39:33,260 INFO L93 Difference]: Finished difference Result 211 states and 386 transitions. [2024-10-11 09:39:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:39:33,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 246 [2024-10-11 09:39:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:39:33,273 INFO L225 Difference]: With dead ends: 211 [2024-10-11 09:39:33,275 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 09:39:33,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-11 09:39:33,288 INFO L432 NwaCegarLoop]: 165 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, 165 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-11 09:39:33,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:39:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 09:39:33,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-11 09:39:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 09:39:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 168 transitions. [2024-10-11 09:39:33,359 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 168 transitions. Word has length 246 [2024-10-11 09:39:33,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:39:33,359 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 168 transitions. [2024-10-11 09:39:33,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 09:39:33,360 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 168 transitions. [2024-10-11 09:39:33,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-11 09:39:33,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:39:33,367 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:39:33,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:39:33,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:39:33,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:39:33,369 INFO L85 PathProgramCache]: Analyzing trace with hash -532664051, now seen corresponding path program 1 times [2024-10-11 09:39:33,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:39:33,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047462424] [2024-10-11 09:39:33,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:33,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:39:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:39:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:39:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:39:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:39:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:39:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:39:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:39:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:39:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:39:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:39:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:39:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:39:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:39:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:39:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:39:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:39:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:39:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:39:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:39:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:39:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:39:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:39:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:39:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:39:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:39:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:39:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:39:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:39:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:39:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:39:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:39:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:39:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:39:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:39:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:39:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 09:39:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:39:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 09:39:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 09:39:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 09:39:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 09:39:34,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:39:34,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047462424] [2024-10-11 09:39:34,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047462424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:39:34,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:39:34,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:39:34,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529430130] [2024-10-11 09:39:34,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:39:34,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:39:34,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:39:34,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:39:34,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:39:34,495 INFO L87 Difference]: Start difference. First operand 105 states and 168 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:39:34,624 INFO L93 Difference]: Finished difference Result 313 states and 502 transitions. [2024-10-11 09:39:34,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:39:34,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 247 [2024-10-11 09:39:34,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:39:34,631 INFO L225 Difference]: With dead ends: 313 [2024-10-11 09:39:34,631 INFO L226 Difference]: Without dead ends: 209 [2024-10-11 09:39:34,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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-11 09:39:34,634 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 91 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:39:34,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 336 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:39:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-11 09:39:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-10-11 09:39:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 124 states have (on average 1.3951612903225807) internal successors, (173), 124 states have internal predecessors, (173), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 09:39:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 333 transitions. [2024-10-11 09:39:34,697 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 333 transitions. Word has length 247 [2024-10-11 09:39:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:39:34,698 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 333 transitions. [2024-10-11 09:39:34,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 333 transitions. [2024-10-11 09:39:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-11 09:39:34,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:39:34,705 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:39:34,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:39:34,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:39:34,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:39:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1055683851, now seen corresponding path program 1 times [2024-10-11 09:39:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:39:34,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940550159] [2024-10-11 09:39:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:34,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:39:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:39:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:39:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:39:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:39:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:39:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:39:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:39:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:39:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:39:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:39:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:39:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:39:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:39:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:39:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:39:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:39:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:39:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:39:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:39:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:39:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:39:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:39:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:39:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:39:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:39:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:39:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:39:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:39:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:39:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:39:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:39:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:39:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:39:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:39:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:39:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 09:39:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:39:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 09:39:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 09:39:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 09:39:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 09:39:35,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:39:35,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940550159] [2024-10-11 09:39:35,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940550159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:39:35,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:39:35,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:39:35,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754728096] [2024-10-11 09:39:35,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:39:35,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:39:35,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:39:35,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:39:35,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:39:35,687 INFO L87 Difference]: Start difference. First operand 207 states and 333 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:39:36,130 INFO L93 Difference]: Finished difference Result 650 states and 1041 transitions. [2024-10-11 09:39:36,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:39:36,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 247 [2024-10-11 09:39:36,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:39:36,140 INFO L225 Difference]: With dead ends: 650 [2024-10-11 09:39:36,142 INFO L226 Difference]: Without dead ends: 444 [2024-10-11 09:39:36,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:39:36,146 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 236 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:39:36,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 704 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:39:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-10-11 09:39:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 415. [2024-10-11 09:39:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 250 states have (on average 1.384) internal successors, (346), 250 states have internal predecessors, (346), 160 states have call successors, (160), 4 states have call predecessors, (160), 4 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-11 09:39:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 666 transitions. [2024-10-11 09:39:36,243 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 666 transitions. Word has length 247 [2024-10-11 09:39:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:39:36,246 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 666 transitions. [2024-10-11 09:39:36,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 666 transitions. [2024-10-11 09:39:36,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-11 09:39:36,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:39:36,252 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:39:36,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:39:36,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:39:36,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:39:36,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1112942153, now seen corresponding path program 1 times [2024-10-11 09:39:36,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:39:36,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048210861] [2024-10-11 09:39:36,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:36,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:39:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:39:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:39:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:39:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:39:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:39:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:39:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:39:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:39:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:39:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:39:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:39:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:39:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:39:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:39:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:39:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:39:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:39:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:39:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:39:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:39:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:39:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:39:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:39:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:39:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:39:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:39:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:39:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:39:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:39:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:39:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:39:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:39:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:39:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:39:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:39:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 09:39:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:39:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 09:39:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 09:39:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 09:39:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 09:39:41,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:39:41,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048210861] [2024-10-11 09:39:41,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048210861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:39:41,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:39:41,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 09:39:41,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110396144] [2024-10-11 09:39:41,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:39:41,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:39:41,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:39:41,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:39:41,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:39:41,704 INFO L87 Difference]: Start difference. First operand 415 states and 666 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:39:42,302 INFO L93 Difference]: Finished difference Result 1074 states and 1703 transitions. [2024-10-11 09:39:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 09:39:42,303 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 247 [2024-10-11 09:39:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:39:42,309 INFO L225 Difference]: With dead ends: 1074 [2024-10-11 09:39:42,310 INFO L226 Difference]: Without dead ends: 660 [2024-10-11 09:39:42,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:39:42,313 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 140 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:39:42,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 674 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:39:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-10-11 09:39:42,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 593. [2024-10-11 09:39:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 416 states have (on average 1.4423076923076923) internal successors, (600), 420 states have internal predecessors, (600), 168 states have call successors, (168), 8 states have call predecessors, (168), 8 states have return successors, (168), 164 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-11 09:39:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 936 transitions. [2024-10-11 09:39:42,398 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 936 transitions. Word has length 247 [2024-10-11 09:39:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:39:42,399 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 936 transitions. [2024-10-11 09:39:42,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 936 transitions. [2024-10-11 09:39:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 09:39:42,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:39:42,403 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:39:42,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:39:42,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:39:42,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:39:42,405 INFO L85 PathProgramCache]: Analyzing trace with hash -247615313, now seen corresponding path program 1 times [2024-10-11 09:39:42,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:39:42,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134943636] [2024-10-11 09:39:42,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:42,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:39:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:39:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:39:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:39:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:39:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:39:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:39:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:39:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:39:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:39:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:39:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:39:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:39:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:39:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:39:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:39:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:39:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:39:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:39:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:39:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:39:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:39:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:39:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:39:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:39:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:39:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:39:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:39:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:39:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:39:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:39:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:39:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:39:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:39:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:39:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:39:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 09:39:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:39:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 09:39:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 09:39:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 09:39:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 09:39:42,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:39:42,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134943636] [2024-10-11 09:39:42,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134943636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:39:42,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:39:42,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:39:42,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141569767] [2024-10-11 09:39:42,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:39:42,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:39:42,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:39:42,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:39:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:39:42,883 INFO L87 Difference]: Start difference. First operand 593 states and 936 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:39:43,181 INFO L93 Difference]: Finished difference Result 1187 states and 1876 transitions. [2024-10-11 09:39:43,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:39:43,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 248 [2024-10-11 09:39:43,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:39:43,191 INFO L225 Difference]: With dead ends: 1187 [2024-10-11 09:39:43,191 INFO L226 Difference]: Without dead ends: 875 [2024-10-11 09:39:43,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:39:43,194 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 136 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:39:43,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 492 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:39:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-11 09:39:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 593. [2024-10-11 09:39:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 416 states have (on average 1.4423076923076923) internal successors, (600), 420 states have internal predecessors, (600), 168 states have call successors, (168), 8 states have call predecessors, (168), 8 states have return successors, (168), 164 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-11 09:39:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 936 transitions. [2024-10-11 09:39:43,301 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 936 transitions. Word has length 248 [2024-10-11 09:39:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:39:43,302 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 936 transitions. [2024-10-11 09:39:43,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 936 transitions. [2024-10-11 09:39:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 09:39:43,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:39:43,306 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:39:43,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:39:43,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:39:43,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:39:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1340732589, now seen corresponding path program 1 times [2024-10-11 09:39:43,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:39:43,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125517934] [2024-10-11 09:39:43,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:39:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:39:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:39:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:39:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:39:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:39:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:39:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:39:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:39:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:39:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:39:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:39:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:39:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:39:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:39:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:39:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:39:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:39:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:39:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:39:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:39:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:39:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:39:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:39:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:39:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:39:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:39:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:39:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:39:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:39:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:39:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:39:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:39:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:39:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:39:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:39:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 09:39:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:39:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 09:39:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 09:39:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 09:39:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 09:39:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:39:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125517934] [2024-10-11 09:39:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125517934] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:39:43,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628841894] [2024-10-11 09:39:43,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:43,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:39:43,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:39:43,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:39:43,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:39:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:44,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:39:44,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:39:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 477 proven. 108 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2024-10-11 09:39:44,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:39:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 09:39:44,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628841894] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:39:44,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:39:44,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 09:39:44,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388974493] [2024-10-11 09:39:44,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:39:44,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 09:39:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:39:44,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 09:39:44,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:39:44,817 INFO L87 Difference]: Start difference. First operand 593 states and 936 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2024-10-11 09:39:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:39:45,153 INFO L93 Difference]: Finished difference Result 1073 states and 1655 transitions. [2024-10-11 09:39:45,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 09:39:45,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) Word has length 248 [2024-10-11 09:39:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:39:45,159 INFO L225 Difference]: With dead ends: 1073 [2024-10-11 09:39:45,160 INFO L226 Difference]: Without dead ends: 481 [2024-10-11 09:39:45,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 571 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:39:45,163 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 60 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:39:45,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 263 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:39:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-10-11 09:39:45,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 457. [2024-10-11 09:39:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 284 states have (on average 1.3098591549295775) internal successors, (372), 284 states have internal predecessors, (372), 160 states have call successors, (160), 12 states have call predecessors, (160), 12 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-11 09:39:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 692 transitions. [2024-10-11 09:39:45,257 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 692 transitions. Word has length 248 [2024-10-11 09:39:45,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:39:45,258 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 692 transitions. [2024-10-11 09:39:45,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2024-10-11 09:39:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 692 transitions. [2024-10-11 09:39:45,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 09:39:45,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:39:45,263 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:39:45,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 09:39:45,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:39:45,465 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:39:45,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:39:45,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1742233192, now seen corresponding path program 1 times [2024-10-11 09:39:45,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:39:45,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80736175] [2024-10-11 09:39:45,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:45,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:39:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:39:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:39:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:39:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:39:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:39:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:39:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:39:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:39:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:39:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:39:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:39:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:39:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:39:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:39:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:39:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:39:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:39:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:39:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:39:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:45,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:39:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:39:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:39:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:39:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:39:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:39:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:39:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:39:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:39:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:39:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:39:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:39:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:39:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:39:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:39:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:39:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 09:39:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:39:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 09:39:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 09:39:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 09:39:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 09:39:46,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:39:46,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80736175] [2024-10-11 09:39:46,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80736175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:39:46,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:39:46,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 09:39:46,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740018689] [2024-10-11 09:39:46,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:39:46,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 09:39:46,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:39:46,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 09:39:46,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:39:46,105 INFO L87 Difference]: Start difference. First operand 457 states and 692 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:39:46,511 INFO L93 Difference]: Finished difference Result 828 states and 1253 transitions. [2024-10-11 09:39:46,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:39:46,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 248 [2024-10-11 09:39:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:39:46,517 INFO L225 Difference]: With dead ends: 828 [2024-10-11 09:39:46,517 INFO L226 Difference]: Without dead ends: 372 [2024-10-11 09:39:46,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:39:46,520 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 156 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:39:46,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 536 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:39:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-11 09:39:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 330. [2024-10-11 09:39:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 200 states have (on average 1.295) internal successors, (259), 200 states have internal predecessors, (259), 120 states have call successors, (120), 9 states have call predecessors, (120), 9 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-11 09:39:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 499 transitions. [2024-10-11 09:39:46,576 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 499 transitions. Word has length 248 [2024-10-11 09:39:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:39:46,577 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 499 transitions. [2024-10-11 09:39:46,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:46,578 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 499 transitions. [2024-10-11 09:39:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 09:39:46,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:39:46,581 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:39:46,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 09:39:46,581 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:39:46,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:39:46,582 INFO L85 PathProgramCache]: Analyzing trace with hash 251911514, now seen corresponding path program 1 times [2024-10-11 09:39:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:39:46,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211256289] [2024-10-11 09:39:46,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:46,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:39:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:39:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:39:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:39:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:39:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:39:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:39:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:39:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:39:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:39:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:39:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:39:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:39:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:39:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:39:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:39:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:39:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:39:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:39:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:39:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:39:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:39:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:39:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:39:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:39:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:39:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:39:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:39:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:39:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:39:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:39:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:39:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:39:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:39:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:39:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:39:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 09:39:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:39:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 09:39:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 09:39:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 09:39:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 3 proven. 114 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 09:39:47,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:39:47,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211256289] [2024-10-11 09:39:47,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211256289] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:39:47,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048748533] [2024-10-11 09:39:47,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:47,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:39:47,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:39:47,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:39:47,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:39:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:47,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 09:39:47,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:39:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 193 proven. 114 refuted. 0 times theorem prover too weak. 2813 trivial. 0 not checked. [2024-10-11 09:39:47,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:39:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 3 proven. 114 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 09:39:48,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048748533] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:39:48,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:39:48,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-11 09:39:48,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030138368] [2024-10-11 09:39:48,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:39:48,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 09:39:48,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:39:48,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 09:39:48,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:39:48,148 INFO L87 Difference]: Start difference. First operand 330 states and 499 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2024-10-11 09:39:48,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:39:48,940 INFO L93 Difference]: Finished difference Result 596 states and 890 transitions. [2024-10-11 09:39:48,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 09:39:48,941 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 248 [2024-10-11 09:39:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:39:48,944 INFO L225 Difference]: With dead ends: 596 [2024-10-11 09:39:48,944 INFO L226 Difference]: Without dead ends: 355 [2024-10-11 09:39:48,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 568 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-10-11 09:39:48,946 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 214 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:39:48,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 844 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 09:39:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-11 09:39:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 328. [2024-10-11 09:39:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 198 states have (on average 1.292929292929293) internal successors, (256), 198 states have internal predecessors, (256), 120 states have call successors, (120), 9 states have call predecessors, (120), 9 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-11 09:39:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 496 transitions. [2024-10-11 09:39:49,014 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 496 transitions. Word has length 248 [2024-10-11 09:39:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:39:49,015 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 496 transitions. [2024-10-11 09:39:49,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2024-10-11 09:39:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 496 transitions. [2024-10-11 09:39:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 09:39:49,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:39:49,018 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:39:49,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:39:49,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:39:49,222 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:39:49,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:39:49,222 INFO L85 PathProgramCache]: Analyzing trace with hash 309169816, now seen corresponding path program 1 times [2024-10-11 09:39:49,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:39:49,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990688047] [2024-10-11 09:39:49,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:49,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:39:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:39:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:39:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:39:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:39:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:39:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:39:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:39:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:39:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:39:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:39:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:39:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:39:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:39:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:39:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:39:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:39:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:39:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:39:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:39:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:39:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:39:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:39:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:39:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:39:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:39:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:39:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:39:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:39:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:39:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:39:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:39:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:39:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:39:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:39:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:39:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 09:39:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:39:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 09:39:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 09:39:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 09:39:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 09:39:49,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:39:49,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990688047] [2024-10-11 09:39:49,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990688047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:39:49,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:39:49,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:39:49,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188172564] [2024-10-11 09:39:49,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:39:49,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:39:49,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:39:49,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:39:49,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:39:49,487 INFO L87 Difference]: Start difference. First operand 328 states and 496 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:39:49,571 INFO L93 Difference]: Finished difference Result 687 states and 1039 transitions. [2024-10-11 09:39:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:39:49,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 248 [2024-10-11 09:39:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:39:49,576 INFO L225 Difference]: With dead ends: 687 [2024-10-11 09:39:49,576 INFO L226 Difference]: Without dead ends: 443 [2024-10-11 09:39:49,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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-11 09:39:49,579 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 152 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:39:49,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 329 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:39:49,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-11 09:39:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2024-10-11 09:39:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 268 states have (on average 1.2985074626865671) internal successors, (348), 268 states have internal predecessors, (348), 160 states have call successors, (160), 12 states have call predecessors, (160), 12 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-11 09:39:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 668 transitions. [2024-10-11 09:39:49,662 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 668 transitions. Word has length 248 [2024-10-11 09:39:49,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:39:49,662 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 668 transitions. [2024-10-11 09:39:49,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 668 transitions. [2024-10-11 09:39:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 09:39:49,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:39:49,665 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:39:49,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 09:39:49,666 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:39:49,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:39:49,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1300819847, now seen corresponding path program 1 times [2024-10-11 09:39:49,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:39:49,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086778523] [2024-10-11 09:39:49,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:49,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:39:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:39:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:39:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:39:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:39:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:39:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:39:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:39:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:39:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:39:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:39:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:39:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:39:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:39:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:39:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:39:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:39:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:39:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:39:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:39:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:39:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:39:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:39:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:39:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:39:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:39:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:39:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:39:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:39:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:39:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:39:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:39:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:39:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:39:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:39:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:39:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 09:39:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:39:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 09:39:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 09:39:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 09:39:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 09:39:49,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:39:49,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086778523] [2024-10-11 09:39:49,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086778523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:39:49,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:39:49,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:39:49,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881812068] [2024-10-11 09:39:49,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:39:49,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:39:49,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:39:49,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:39:49,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:39:49,980 INFO L87 Difference]: Start difference. First operand 441 states and 668 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:39:50,308 INFO L93 Difference]: Finished difference Result 1010 states and 1532 transitions. [2024-10-11 09:39:50,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:39:50,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 248 [2024-10-11 09:39:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:39:50,314 INFO L225 Difference]: With dead ends: 1010 [2024-10-11 09:39:50,314 INFO L226 Difference]: Without dead ends: 658 [2024-10-11 09:39:50,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:39:50,317 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 181 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:39:50,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 640 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:39:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-10-11 09:39:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 647. [2024-10-11 09:39:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 388 states have (on average 1.288659793814433) internal successors, (500), 388 states have internal predecessors, (500), 240 states have call successors, (240), 18 states have call predecessors, (240), 18 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2024-10-11 09:39:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 980 transitions. [2024-10-11 09:39:50,427 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 980 transitions. Word has length 248 [2024-10-11 09:39:50,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:39:50,428 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 980 transitions. [2024-10-11 09:39:50,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:39:50,428 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 980 transitions. [2024-10-11 09:39:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 09:39:50,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:39:50,431 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:39:50,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 09:39:50,432 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:39:50,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:39:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash -599755269, now seen corresponding path program 1 times [2024-10-11 09:39:50,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:39:50,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804555006] [2024-10-11 09:39:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:39:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:39:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:39:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:39:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:39:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:39:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:39:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:39:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:39:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:39:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:39:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:39:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:39:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:39:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:39:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:39:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:39:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:39:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:39:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:39:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:39:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:39:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:39:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:39:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:39:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:39:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:39:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:39:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:39:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:39:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:39:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:39:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:39:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:39:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:39:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:39:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:53,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 09:39:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:53,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:39:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:53,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 09:39:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:53,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 09:39:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:53,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 09:39:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 24 proven. 93 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 09:39:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:39:53,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804555006] [2024-10-11 09:39:53,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804555006] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:39:53,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254682354] [2024-10-11 09:39:53,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:53,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:39:53,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:39:53,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:39:53,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 09:39:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:39:53,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 09:39:53,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:39:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1080 proven. 180 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 09:39:55,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:39:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 48 proven. 183 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2024-10-11 09:39:56,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254682354] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:39:56,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:39:56,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 27 [2024-10-11 09:39:56,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545128532] [2024-10-11 09:39:56,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:39:56,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 09:39:56,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:39:56,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 09:39:56,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-11 09:39:56,736 INFO L87 Difference]: Start difference. First operand 647 states and 980 transitions. Second operand has 27 states, 26 states have (on average 5.461538461538462) internal successors, (142), 25 states have internal predecessors, (142), 9 states have call successors, (120), 4 states have call predecessors, (120), 8 states have return successors, (120), 9 states have call predecessors, (120), 9 states have call successors, (120) [2024-10-11 09:39:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:39:59,652 INFO L93 Difference]: Finished difference Result 835 states and 1235 transitions. [2024-10-11 09:39:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 09:39:59,653 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 5.461538461538462) internal successors, (142), 25 states have internal predecessors, (142), 9 states have call successors, (120), 4 states have call predecessors, (120), 8 states have return successors, (120), 9 states have call predecessors, (120), 9 states have call successors, (120) Word has length 248 [2024-10-11 09:39:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:39:59,661 INFO L225 Difference]: With dead ends: 835 [2024-10-11 09:39:59,661 INFO L226 Difference]: Without dead ends: 277 [2024-10-11 09:39:59,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=748, Invalid=1904, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 09:39:59,666 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 880 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 624 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:39:59,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 749 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [624 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 09:39:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-11 09:39:59,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 215. [2024-10-11 09:39:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 124 states have (on average 1.2016129032258065) internal successors, (149), 124 states have internal predecessors, (149), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 09:39:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 309 transitions. [2024-10-11 09:39:59,730 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 309 transitions. Word has length 248 [2024-10-11 09:39:59,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:39:59,730 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 309 transitions. [2024-10-11 09:39:59,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 5.461538461538462) internal successors, (142), 25 states have internal predecessors, (142), 9 states have call successors, (120), 4 states have call predecessors, (120), 8 states have return successors, (120), 9 states have call predecessors, (120), 9 states have call successors, (120) [2024-10-11 09:39:59,731 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 309 transitions. [2024-10-11 09:39:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-11 09:39:59,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:39:59,735 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:39:59,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 09:39:59,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:39:59,936 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:39:59,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:39:59,937 INFO L85 PathProgramCache]: Analyzing trace with hash -447958518, now seen corresponding path program 1 times [2024-10-11 09:39:59,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:39:59,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654567072] [2024-10-11 09:39:59,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:39:59,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:40:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:40:00,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758943445] [2024-10-11 09:40:00,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:40:00,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:40:00,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:40:00,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:40:00,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 09:40:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:40:00,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:40:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:40:00,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:40:00,504 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:40:00,505 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:40:00,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 09:40:00,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 09:40:00,714 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:40:00,880 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:40:00,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:40:00 BoogieIcfgContainer [2024-10-11 09:40:00,884 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:40:00,885 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:40:00,885 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:40:00,885 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:40:00,886 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:39:32" (3/4) ... [2024-10-11 09:40:00,888 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:40:00,890 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:40:00,890 INFO L158 Benchmark]: Toolchain (without parser) took 29986.11ms. Allocated memory was 148.9MB in the beginning and 704.6MB in the end (delta: 555.7MB). Free memory was 94.6MB in the beginning and 310.6MB in the end (delta: -216.0MB). Peak memory consumption was 341.5MB. Max. memory is 16.1GB. [2024-10-11 09:40:00,891 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 148.9MB. Free memory is still 110.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:40:00,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.09ms. Allocated memory is still 148.9MB. Free memory was 94.6MB in the beginning and 76.1MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 09:40:00,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.96ms. Allocated memory is still 148.9MB. Free memory was 76.1MB in the beginning and 71.6MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:40:00,891 INFO L158 Benchmark]: Boogie Preprocessor took 102.48ms. Allocated memory is still 148.9MB. Free memory was 71.6MB in the beginning and 66.1MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:40:00,892 INFO L158 Benchmark]: RCFGBuilder took 770.38ms. Allocated memory was 148.9MB in the beginning and 232.8MB in the end (delta: 83.9MB). Free memory was 66.1MB in the beginning and 173.0MB in the end (delta: -107.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-10-11 09:40:00,892 INFO L158 Benchmark]: TraceAbstraction took 28601.13ms. Allocated memory was 232.8MB in the beginning and 704.6MB in the end (delta: 471.9MB). Free memory was 172.0MB in the beginning and 311.7MB in the end (delta: -139.7MB). Peak memory consumption was 332.1MB. Max. memory is 16.1GB. [2024-10-11 09:40:00,893 INFO L158 Benchmark]: Witness Printer took 4.92ms. Allocated memory is still 704.6MB. Free memory is still 310.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:40:00,894 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.18ms. Allocated memory is still 148.9MB. Free memory is still 110.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.09ms. Allocated memory is still 148.9MB. Free memory was 94.6MB in the beginning and 76.1MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.96ms. Allocated memory is still 148.9MB. Free memory was 76.1MB in the beginning and 71.6MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.48ms. Allocated memory is still 148.9MB. Free memory was 71.6MB in the beginning and 66.1MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 770.38ms. Allocated memory was 148.9MB in the beginning and 232.8MB in the end (delta: 83.9MB). Free memory was 66.1MB in the beginning and 173.0MB in the end (delta: -107.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 28601.13ms. Allocated memory was 232.8MB in the beginning and 704.6MB in the end (delta: 471.9MB). Free memory was 172.0MB in the beginning and 311.7MB in the end (delta: -139.7MB). Peak memory consumption was 332.1MB. Max. memory is 16.1GB. * Witness Printer took 4.92ms. Allocated memory is still 704.6MB. Free memory is still 310.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 219, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryArithmeticDOUBLEoperation at line 132. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] float var_1_27 = 31.25; [L44] float var_1_28 = 2.95; [L45] signed char var_1_29 = 10; [L46] double var_1_30 = 0.5; [L47] unsigned char var_1_31 = 0; [L48] unsigned short int var_1_32 = 1; [L49] double var_1_33 = 3.2; [L50] unsigned char var_1_34 = 2; [L51] unsigned char var_1_35 = 4; [L52] signed long int var_1_36 = -256; [L53] unsigned short int var_1_37 = 64; [L54] unsigned short int var_1_38 = 57633; [L55] unsigned short int var_1_39 = 28505; [L56] signed short int var_1_40 = 64; [L57] signed char var_1_41 = -100; [L58] unsigned short int var_1_42 = 5; [L59] signed char var_1_43 = 100; [L60] unsigned short int last_1_var_1_6 = 4; [L61] unsigned short int last_1_var_1_9 = 4; [L62] unsigned long int last_1_var_1_14 = 500; [L63] signed short int last_1_var_1_17 = 16; [L223] isInitial = 1 [L224] FCALL initially() [L225] COND TRUE 1 [L226] CALL updateLastVariables() [L213] last_1_var_1_6 = var_1_6 [L214] last_1_var_1_9 = var_1_9 [L215] last_1_var_1_14 = var_1_14 [L216] last_1_var_1_17 = var_1_17 [L226] RET updateLastVariables() [L227] CALL updateVariables() [L149] var_1_4 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L150] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L151] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] var_1_5 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L153] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L154] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] var_1_10 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] var_1_12 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L160] var_1_13 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L161] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L162] var_1_15 = __VERIFIER_nondet_ulong() [L163] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L163] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L164] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L164] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L165] var_1_16 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L167] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L167] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L168] var_1_19 = __VERIFIER_nondet_short() [L169] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L170] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L170] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] var_1_20 = __VERIFIER_nondet_short() [L172] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L173] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L173] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] var_1_21 = __VERIFIER_nondet_short() [L175] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L176] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L176] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] var_1_22 = __VERIFIER_nondet_short() [L178] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L178] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L179] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L179] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L180] var_1_24 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L181] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L182] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L182] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L183] var_1_27 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L184] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L185] var_1_28 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L186] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L187] var_1_29 = __VERIFIER_nondet_char() [L188] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L188] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L189] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L189] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L190] var_1_31 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L191] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L192] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L192] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L193] var_1_32 = __VERIFIER_nondet_ushort() [L194] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L194] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L195] CALL assume_abort_if_not(var_1_32 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L195] RET assume_abort_if_not(var_1_32 <= 65535) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L196] var_1_33 = __VERIFIER_nondet_double() [L197] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L197] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L198] var_1_35 = __VERIFIER_nondet_uchar() [L199] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L199] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L200] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L200] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L201] var_1_38 = __VERIFIER_nondet_ushort() [L202] CALL assume_abort_if_not(var_1_38 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L202] RET assume_abort_if_not(var_1_38 >= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L203] CALL assume_abort_if_not(var_1_38 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L203] RET assume_abort_if_not(var_1_38 <= 65535) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L204] var_1_39 = __VERIFIER_nondet_ushort() [L205] CALL assume_abort_if_not(var_1_39 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L205] RET assume_abort_if_not(var_1_39 >= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L206] CALL assume_abort_if_not(var_1_39 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L206] RET assume_abort_if_not(var_1_39 <= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L207] var_1_41 = __VERIFIER_nondet_char() [L208] CALL assume_abort_if_not(var_1_41 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L208] RET assume_abort_if_not(var_1_41 >= -128) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L209] CALL assume_abort_if_not(var_1_41 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L209] RET assume_abort_if_not(var_1_41 <= 127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L210] CALL assume_abort_if_not(var_1_41 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L210] RET assume_abort_if_not(var_1_41 != 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L227] RET updateVariables() [L228] CALL step() [L67] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L73] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L74] COND FALSE !((- var_1_27) >= var_1_28) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L77] EXPR var_1_23 ^ (var_1_32 % var_1_41) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L77] COND FALSE !(var_1_24 >= (var_1_23 ^ (var_1_32 % var_1_41))) [L86] var_1_40 = var_1_34 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L88] var_1_43 = var_1_24 [L89] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=5, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L90] COND TRUE last_1_var_1_14 >= stepLocal_3 [L91] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=5, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L93] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=5, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L94] COND FALSE !(\read(var_1_31)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=5, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] var_1_42 = var_1_39 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L101] COND TRUE (- var_1_14) > var_1_6 [L102] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] unsigned char stepLocal_2 = var_1_4; [L108] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=7516192750, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L109] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=7516192750, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L112] COND TRUE stepLocal_1 >= var_1_6 [L113] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L118] COND TRUE var_1_34 != ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))) [L119] var_1_36 = (((((var_1_34 - var_1_32)) < ((((((var_1_24 + var_1_26)) < (var_1_25)) ? ((var_1_24 + var_1_26)) : (var_1_25))))) ? ((var_1_34 - var_1_32)) : ((((((var_1_24 + var_1_26)) < (var_1_25)) ? ((var_1_24 + var_1_26)) : (var_1_25)))))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-2, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L121] unsigned char stepLocal_5 = var_1_1; [L122] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-2, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L123] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-2, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L130] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-2, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L131] COND TRUE ! var_1_1 [L132] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=2, var_1_35=0, var_1_36=-2, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L137] COND TRUE var_1_26 < var_1_24 [L138] var_1_34 = var_1_35 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=0, var_1_35=0, var_1_36=-2, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L140] COND TRUE (var_1_25 * (var_1_38 - var_1_34)) <= var_1_23 [L141] var_1_37 = ((var_1_39 - var_1_35) + var_1_34) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=0, var_1_35=0, var_1_36=-2, var_1_37=16383, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L228] RET step() [L229] CALL, EXPR property() [L219-L220] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; [L229] RET, EXPR property() [L229] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=0, var_1_35=0, var_1_36=-2, var_1_37=16383, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=-127, var_1_30=1/2, var_1_31=0, var_1_32=-65535, var_1_34=0, var_1_35=0, var_1_36=-2, var_1_37=16383, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.4s, OverallIterations: 12, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2287 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2246 mSDsluCounter, 5732 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3605 mSDsCounter, 941 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2461 IncrementalHoareTripleChecker+Invalid, 3402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 941 mSolverCounterUnsat, 2127 mSDtfsCounter, 2461 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2515 GetRequests, 2406 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=647occurred in iteration=10, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 548 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 3965 NumberOfCodeBlocks, 3965 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4194 ConstructedInterpolants, 0 QuantifiedInterpolants, 27244 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1698 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 51918/53040 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-11 09:40:00,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-4.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2e1352fbec5216d16d120c6803928d1b7fe6ca627ad10dd05f618180ded5608c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:40:03,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:40:03,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:40:03,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:40:03,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:40:03,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:40:03,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:40:03,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:40:03,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:40:03,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:40:03,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:40:03,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:40:03,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:40:03,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:40:03,295 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:40:03,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:40:03,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:40:03,295 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:40:03,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:40:03,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:40:03,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:40:03,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:40:03,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:40:03,298 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:40:03,298 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:40:03,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:40:03,299 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:40:03,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:40:03,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:40:03,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:40:03,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:40:03,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:40:03,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:40:03,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:40:03,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:40:03,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:40:03,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:40:03,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:40:03,303 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:40:03,304 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:40:03,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:40:03,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:40:03,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:40:03,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:40:03,307 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:40:03,307 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-clean/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-clean/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 -> 2e1352fbec5216d16d120c6803928d1b7fe6ca627ad10dd05f618180ded5608c [2024-10-11 09:40:03,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:40:03,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:40:03,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:40:03,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:40:03,679 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:40:03,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-4.i [2024-10-11 09:40:05,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:40:05,340 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:40:05,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-4.i [2024-10-11 09:40:05,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ffbbf00a/27fb9f56aabf4edaa3388bf72ebd7949/FLAGf265c1197 [2024-10-11 09:40:05,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ffbbf00a/27fb9f56aabf4edaa3388bf72ebd7949 [2024-10-11 09:40:05,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:40:05,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:40:05,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:40:05,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:40:05,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:40:05,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:40:05" (1/1) ... [2024-10-11 09:40:05,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc9ae4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:05, skipping insertion in model container [2024-10-11 09:40:05,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:40:05" (1/1) ... [2024-10-11 09:40:05,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:40:05,935 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-pr-cn_file-4.i[918,931] [2024-10-11 09:40:06,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:40:06,052 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:40:06,070 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-pr-cn_file-4.i[918,931] [2024-10-11 09:40:06,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:40:06,151 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:40:06,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06 WrapperNode [2024-10-11 09:40:06,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:40:06,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:40:06,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:40:06,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:40:06,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06" (1/1) ... [2024-10-11 09:40:06,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06" (1/1) ... [2024-10-11 09:40:06,221 INFO L138 Inliner]: procedures = 27, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 237 [2024-10-11 09:40:06,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:40:06,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:40:06,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:40:06,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:40:06,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06" (1/1) ... [2024-10-11 09:40:06,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06" (1/1) ... [2024-10-11 09:40:06,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06" (1/1) ... [2024-10-11 09:40:06,269 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-11 09:40:06,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06" (1/1) ... [2024-10-11 09:40:06,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06" (1/1) ... [2024-10-11 09:40:06,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06" (1/1) ... [2024-10-11 09:40:06,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06" (1/1) ... [2024-10-11 09:40:06,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06" (1/1) ... [2024-10-11 09:40:06,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06" (1/1) ... [2024-10-11 09:40:06,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:40:06,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:40:06,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:40:06,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:40:06,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06" (1/1) ... [2024-10-11 09:40:06,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:40:06,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:40:06,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:40:06,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:40:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:40:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:40:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:40:06,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:40:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:40:06,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:40:06,504 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:40:06,506 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:40:07,303 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 09:40:07,303 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:40:07,355 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:40:07,355 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:40:07,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:40:07 BoogieIcfgContainer [2024-10-11 09:40:07,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:40:07,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:40:07,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:40:07,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:40:07,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:40:05" (1/3) ... [2024-10-11 09:40:07,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421fae2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:40:07, skipping insertion in model container [2024-10-11 09:40:07,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:40:06" (2/3) ... [2024-10-11 09:40:07,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421fae2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:40:07, skipping insertion in model container [2024-10-11 09:40:07,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:40:07" (3/3) ... [2024-10-11 09:40:07,367 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-4.i [2024-10-11 09:40:07,386 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:40:07,386 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:40:07,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:40:07,466 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;@7f70e2b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:40:07,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:40:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 09:40:07,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 09:40:07,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:40:07,495 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:40:07,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:40:07,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:40:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash -924586243, now seen corresponding path program 1 times [2024-10-11 09:40:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:40:07,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790779579] [2024-10-11 09:40:07,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:40:07,535 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-11 09:40:07,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:40:07,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 09:40:07,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:40:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:40:07,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:40:07,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:40:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 09:40:08,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:40:08,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:40:08,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790779579] [2024-10-11 09:40:08,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790779579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:40:08,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:40:08,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:40:08,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376527688] [2024-10-11 09:40:08,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:40:08,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:40:08,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:40:08,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:40:08,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:40:08,073 INFO L87 Difference]: Start difference. First operand has 103 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:40:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:40:08,230 INFO L93 Difference]: Finished difference Result 203 states and 372 transitions. [2024-10-11 09:40:08,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:40:08,243 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 245 [2024-10-11 09:40:08,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:40:08,253 INFO L225 Difference]: With dead ends: 203 [2024-10-11 09:40:08,254 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 09:40:08,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 244 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-11 09:40:08,262 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:40:08,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:40:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 09:40:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 09:40:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 09:40:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 161 transitions. [2024-10-11 09:40:08,316 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 161 transitions. Word has length 245 [2024-10-11 09:40:08,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:40:08,318 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 161 transitions. [2024-10-11 09:40:08,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:40:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 161 transitions. [2024-10-11 09:40:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 09:40:08,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:40:08,325 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:40:08,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 09:40:08,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 09:40:08,526 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:40:08,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:40:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1611825030, now seen corresponding path program 1 times [2024-10-11 09:40:08,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:40:08,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795918710] [2024-10-11 09:40:08,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:40:08,528 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-11 09:40:08,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:40:08,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 09:40:08,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:40:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:40:08,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 09:40:08,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:40:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 379 proven. 219 refuted. 0 times theorem prover too weak. 2522 trivial. 0 not checked. [2024-10-11 09:40:10,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:40:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 222 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2024-10-11 09:40:11,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:40:11,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795918710] [2024-10-11 09:40:11,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795918710] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:40:11,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:40:11,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-10-11 09:40:11,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951735426] [2024-10-11 09:40:11,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:40:11,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 09:40:11,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:40:11,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 09:40:11,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-11 09:40:11,429 INFO L87 Difference]: Start difference. First operand 101 states and 161 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 3 states have call successors, (78), 3 states have call predecessors, (78), 7 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-10-11 09:40:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:40:12,729 INFO L93 Difference]: Finished difference Result 229 states and 352 transitions. [2024-10-11 09:40:12,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 09:40:12,730 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 3 states have call successors, (78), 3 states have call predecessors, (78), 7 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 246 [2024-10-11 09:40:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:40:12,738 INFO L225 Difference]: With dead ends: 229 [2024-10-11 09:40:12,738 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 09:40:12,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 477 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-10-11 09:40:12,741 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 186 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:40:12,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 529 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 09:40:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 09:40:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2024-10-11 09:40:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 09:40:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2024-10-11 09:40:12,786 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 246 [2024-10-11 09:40:12,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:40:12,787 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2024-10-11 09:40:12,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 3 states have call successors, (78), 3 states have call predecessors, (78), 7 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-10-11 09:40:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2024-10-11 09:40:12,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-11 09:40:12,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:40:12,794 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:40:12,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:40:12,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 09:40:12,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:40:12,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:40:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1153927032, now seen corresponding path program 1 times [2024-10-11 09:40:13,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:40:13,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599925807] [2024-10-11 09:40:13,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:40:13,001 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-11 09:40:13,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:40:13,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 09:40:13,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:40:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:40:13,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:40:13,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:40:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 193 proven. 114 refuted. 0 times theorem prover too weak. 2813 trivial. 0 not checked. [2024-10-11 09:40:14,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:40:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 3 proven. 114 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 09:40:15,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:40:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599925807] [2024-10-11 09:40:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599925807] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:40:15,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:40:15,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2024-10-11 09:40:15,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845435172] [2024-10-11 09:40:15,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:40:15,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 09:40:15,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:40:15,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 09:40:15,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:40:15,307 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (80), 3 states have call predecessors, (80), 5 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2024-10-11 09:40:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:40:16,420 INFO L93 Difference]: Finished difference Result 245 states and 358 transitions. [2024-10-11 09:40:16,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 09:40:16,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (80), 3 states have call predecessors, (80), 5 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 247 [2024-10-11 09:40:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:40:16,433 INFO L225 Difference]: With dead ends: 245 [2024-10-11 09:40:16,434 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 09:40:16,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 484 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-10-11 09:40:16,436 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 86 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:40:16,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 371 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 09:40:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 09:40:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2024-10-11 09:40:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 09:40:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2024-10-11 09:40:16,456 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 247 [2024-10-11 09:40:16,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:40:16,459 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2024-10-11 09:40:16,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (80), 3 states have call predecessors, (80), 5 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2024-10-11 09:40:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2024-10-11 09:40:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-11 09:40:16,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:40:16,466 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:40:16,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:40:16,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 09:40:16,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:40:16,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:40:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash 130743383, now seen corresponding path program 1 times [2024-10-11 09:40:16,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:40:16,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138105211] [2024-10-11 09:40:16,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:40:16,669 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-11 09:40:16,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:40:16,672 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 09:40:16,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:40:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:40:16,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 09:40:16,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:40:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 09:40:17,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:40:17,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:40:17,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138105211] [2024-10-11 09:40:17,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138105211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:40:17,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:40:17,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:40:17,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084359795] [2024-10-11 09:40:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:40:17,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:40:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:40:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:40:17,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:40:17,446 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:40:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:40:18,420 INFO L93 Difference]: Finished difference Result 318 states and 473 transitions. [2024-10-11 09:40:18,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:40:18,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 247 [2024-10-11 09:40:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:40:18,424 INFO L225 Difference]: With dead ends: 318 [2024-10-11 09:40:18,424 INFO L226 Difference]: Without dead ends: 212 [2024-10-11 09:40:18,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:40:18,425 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 200 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 09:40:18,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 435 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 09:40:18,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-11 09:40:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2024-10-11 09:40:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 123 states have internal predecessors, (152), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 09:40:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 312 transitions. [2024-10-11 09:40:18,459 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 312 transitions. Word has length 247 [2024-10-11 09:40:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:40:18,460 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 312 transitions. [2024-10-11 09:40:18,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:40:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 312 transitions. [2024-10-11 09:40:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-11 09:40:18,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:40:18,463 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:40:18,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 09:40:18,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 09:40:18,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:40:18,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:40:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash 831807961, now seen corresponding path program 1 times [2024-10-11 09:40:18,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:40:18,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416228927] [2024-10-11 09:40:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:40:18,670 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-11 09:40:18,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:40:18,673 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 09:40:18,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:40:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:40:18,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:40:18,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:40:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1047 proven. 93 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2024-10-11 09:40:20,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:40:20,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:40:20,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416228927] [2024-10-11 09:40:20,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416228927] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:40:20,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1425298183] [2024-10-11 09:40:20,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:40:20,971 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 09:40:20,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 09:40:20,974 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 09:40:20,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-11 09:40:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:40:22,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 09:40:22,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:40:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1198 proven. 177 refuted. 0 times theorem prover too weak. 1745 trivial. 0 not checked. [2024-10-11 09:40:23,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:40:24,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1425298183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:40:24,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:40:24,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-10-11 09:40:24,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855256782] [2024-10-11 09:40:24,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:40:24,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 09:40:24,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:40:24,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 09:40:24,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-11 09:40:24,414 INFO L87 Difference]: Start difference. First operand 210 states and 312 transitions. Second operand has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 16 states have internal predecessors, (105), 5 states have call successors, (80), 5 states have call predecessors, (80), 8 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2024-10-11 09:40:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:40:29,629 INFO L93 Difference]: Finished difference Result 567 states and 817 transitions. [2024-10-11 09:40:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 09:40:29,632 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 16 states have internal predecessors, (105), 5 states have call successors, (80), 5 states have call predecessors, (80), 8 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) Word has length 247 [2024-10-11 09:40:29,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:40:29,636 INFO L225 Difference]: With dead ends: 567 [2024-10-11 09:40:29,636 INFO L226 Difference]: Without dead ends: 358 [2024-10-11 09:40:29,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 09:40:29,639 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 528 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 09:40:29,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 808 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 09:40:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-11 09:40:29,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 338. [2024-10-11 09:40:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 202 states have (on average 1.2128712871287128) internal successors, (245), 202 states have internal predecessors, (245), 120 states have call successors, (120), 15 states have call predecessors, (120), 15 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-11 09:40:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 485 transitions. [2024-10-11 09:40:29,727 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 485 transitions. Word has length 247 [2024-10-11 09:40:29,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:40:29,728 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 485 transitions. [2024-10-11 09:40:29,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 16 states have internal predecessors, (105), 5 states have call successors, (80), 5 states have call predecessors, (80), 8 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2024-10-11 09:40:29,729 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 485 transitions. [2024-10-11 09:40:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-11 09:40:29,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:40:29,731 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:40:29,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:40:29,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-10-11 09:40:30,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 09:40:30,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:40:30,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:40:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1162336745, now seen corresponding path program 1 times [2024-10-11 09:40:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:40:30,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841428572] [2024-10-11 09:40:30,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:40:30,134 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-11 09:40:30,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:40:30,136 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-11 09:40:30,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:40:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:40:30,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:40:30,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:40:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 09:40:31,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:40:31,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:40:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841428572] [2024-10-11 09:40:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841428572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:40:31,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:40:31,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:40:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637085112] [2024-10-11 09:40:31,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:40:31,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:40:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:40:31,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:40:31,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:40:31,293 INFO L87 Difference]: Start difference. First operand 338 states and 485 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:40:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:40:32,258 INFO L93 Difference]: Finished difference Result 567 states and 810 transitions. [2024-10-11 09:40:32,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:40:32,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 247 [2024-10-11 09:40:32,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:40:32,273 INFO L225 Difference]: With dead ends: 567 [2024-10-11 09:40:32,273 INFO L226 Difference]: Without dead ends: 230 [2024-10-11 09:40:32,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:40:32,275 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 78 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 09:40:32,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 494 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 09:40:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-11 09:40:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 207. [2024-10-11 09:40:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 116 states have (on average 1.1637931034482758) internal successors, (135), 116 states have internal predecessors, (135), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 09:40:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 295 transitions. [2024-10-11 09:40:32,333 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 295 transitions. Word has length 247 [2024-10-11 09:40:32,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:40:32,334 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 295 transitions. [2024-10-11 09:40:32,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 09:40:32,334 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 295 transitions. [2024-10-11 09:40:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 09:40:32,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:40:32,337 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:40:32,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 09:40:32,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-11 09:40:32,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:40:32,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:40:32,539 INFO L85 PathProgramCache]: Analyzing trace with hash 980828635, now seen corresponding path program 1 times [2024-10-11 09:40:32,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:40:32,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775448701] [2024-10-11 09:40:32,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:40:32,539 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-11 09:40:32,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:40:32,543 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-11 09:40:32,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (9)] Waiting until timeout for monitored process [2024-10-11 09:40:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:40:32,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 09:40:32,847 INFO L278 TraceCheckSpWp]: Computing forward predicates...