./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:39:30,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:39:30,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:39:30,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:39:30,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:39:30,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:39:30,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:39:30,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:39:30,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:39:30,900 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:39:30,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:39:30,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:39:30,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:39:30,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:39:30,903 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:39:30,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:39:30,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:39:30,906 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:39:30,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:39:30,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:39:30,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:39:30,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:39:30,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:39:30,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:39:30,908 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:39:30,910 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:39:30,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:39:30,911 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:39:30,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:39:30,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:39:30,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:39:30,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:39:30,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:39:30,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:39:30,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:39:30,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:39:30,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:39:30,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:39:30,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:39:30,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:39:30,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:39:30,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:39:30,915 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 [2024-11-08 20:39:31,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:39:31,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:39:31,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:39:31,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:39:31,178 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:39:31,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-08 20:39:32,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:39:32,866 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:39:32,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-08 20:39:32,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc07f930f/6222c8c2be8c49a6bde83993faa70905/FLAG274f3f324 [2024-11-08 20:39:32,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc07f930f/6222c8c2be8c49a6bde83993faa70905 [2024-11-08 20:39:32,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:39:32,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:39:32,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:39:32,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:39:32,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:39:32,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e22e933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32, skipping insertion in model container [2024-11-08 20:39:32,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:39:33,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i[914,927] [2024-11-08 20:39:33,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:39:33,229 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:39:33,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i[914,927] [2024-11-08 20:39:33,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:39:33,300 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:39:33,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33 WrapperNode [2024-11-08 20:39:33,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:39:33,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:39:33,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:39:33,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:39:33,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33" (1/1) ... [2024-11-08 20:39:33,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33" (1/1) ... [2024-11-08 20:39:33,371 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-11-08 20:39:33,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:39:33,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:39:33,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:39:33,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:39:33,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33" (1/1) ... [2024-11-08 20:39:33,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33" (1/1) ... [2024-11-08 20:39:33,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33" (1/1) ... [2024-11-08 20:39:33,408 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-11-08 20:39:33,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33" (1/1) ... [2024-11-08 20:39:33,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33" (1/1) ... [2024-11-08 20:39:33,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33" (1/1) ... [2024-11-08 20:39:33,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33" (1/1) ... [2024-11-08 20:39:33,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33" (1/1) ... [2024-11-08 20:39:33,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33" (1/1) ... [2024-11-08 20:39:33,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:39:33,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:39:33,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:39:33,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:39:33,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33" (1/1) ... [2024-11-08 20:39:33,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:39:33,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:39:33,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:39:33,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:39:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:39:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:39:33,532 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:39:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:39:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:39:33,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:39:33,627 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:39:33,629 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:39:34,037 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 20:39:34,037 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:39:34,052 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:39:34,052 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:39:34,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:39:34 BoogieIcfgContainer [2024-11-08 20:39:34,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:39:34,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:39:34,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:39:34,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:39:34,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:39:32" (1/3) ... [2024-11-08 20:39:34,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d77ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:39:34, skipping insertion in model container [2024-11-08 20:39:34,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:33" (2/3) ... [2024-11-08 20:39:34,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d77ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:39:34, skipping insertion in model container [2024-11-08 20:39:34,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:39:34" (3/3) ... [2024-11-08 20:39:34,061 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-08 20:39:34,078 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:39:34,078 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:39:34,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:39:34,154 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;@4168eb2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:39:34,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:39:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:39:34,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 20:39:34,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:34,180 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:34,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:34,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:34,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1292902638, now seen corresponding path program 1 times [2024-11-08 20:39:34,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:34,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302793118] [2024-11-08 20:39:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:39:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:39:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:39:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:39:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:39:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:39:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:39:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:39:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:39:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:39:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:39:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:39:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:39:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:39:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:39:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:39:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:39:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:39:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:39:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:39:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:39:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:39:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:39:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:39:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:39:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 20:39:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:39:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:39:34,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:34,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302793118] [2024-11-08 20:39:34,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302793118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:34,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:34,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:39:34,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345205647] [2024-11-08 20:39:34,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:34,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:39:34,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:39:34,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:39:34,959 INFO L87 Difference]: Start difference. First operand has 91 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:39:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:35,005 INFO L93 Difference]: Finished difference Result 175 states and 311 transitions. [2024-11-08 20:39:35,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:39:35,008 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 207 [2024-11-08 20:39:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:35,016 INFO L225 Difference]: With dead ends: 175 [2024-11-08 20:39:35,017 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 20:39:35,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-11-08 20:39:35,028 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:35,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:39:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 20:39:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-08 20:39:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:39:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-11-08 20:39:35,093 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 207 [2024-11-08 20:39:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:35,095 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-11-08 20:39:35,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:39:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-11-08 20:39:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 20:39:35,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:35,100 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:35,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:39:35,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:35,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash 983778013, now seen corresponding path program 1 times [2024-11-08 20:39:35,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:35,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236131548] [2024-11-08 20:39:35,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:35,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:39:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:39:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:39:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:39:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:39:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:39:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:39:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:39:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:39:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:39:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:39:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:39:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:39:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:39:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:39:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:39:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:39:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:39:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:39:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:39:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:39:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:39:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:39:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:39:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:39:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 20:39:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:39:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:39:36,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:36,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236131548] [2024-11-08 20:39:36,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236131548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:36,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:36,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:39:36,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619942421] [2024-11-08 20:39:36,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:36,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:39:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:36,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:39:36,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:39:36,362 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:36,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:36,465 INFO L93 Difference]: Finished difference Result 199 states and 300 transitions. [2024-11-08 20:39:36,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:39:36,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-08 20:39:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:36,469 INFO L225 Difference]: With dead ends: 199 [2024-11-08 20:39:36,469 INFO L226 Difference]: Without dead ends: 115 [2024-11-08 20:39:36,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:39:36,471 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 39 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:36,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 263 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:39:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-08 20:39:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2024-11-08 20:39:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:39:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 149 transitions. [2024-11-08 20:39:36,485 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 149 transitions. Word has length 208 [2024-11-08 20:39:36,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:36,487 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 149 transitions. [2024-11-08 20:39:36,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 149 transitions. [2024-11-08 20:39:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 20:39:36,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:36,492 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:36,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:39:36,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:36,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:36,494 INFO L85 PathProgramCache]: Analyzing trace with hash 985625055, now seen corresponding path program 1 times [2024-11-08 20:39:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:36,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325551532] [2024-11-08 20:39:36,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:36,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:39:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:39:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:39:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:39:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:39:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:39:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:39:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:39:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:39:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:39:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:39:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:39:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:39:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:39:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:39:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:39:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:39:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:39:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:39:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:39:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:39:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:39:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:39:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:39:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:39:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 20:39:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:39:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:39:37,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:37,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325551532] [2024-11-08 20:39:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325551532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:37,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:37,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:39:37,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843520134] [2024-11-08 20:39:37,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:37,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:39:37,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:37,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:39:37,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:39:37,324 INFO L87 Difference]: Start difference. First operand 97 states and 149 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-08 20:39:37,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:37,570 INFO L93 Difference]: Finished difference Result 263 states and 405 transitions. [2024-11-08 20:39:37,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:39:37,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 208 [2024-11-08 20:39:37,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:37,574 INFO L225 Difference]: With dead ends: 263 [2024-11-08 20:39:37,574 INFO L226 Difference]: Without dead ends: 169 [2024-11-08 20:39:37,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:39:37,576 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 207 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:37,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 238 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:39:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-08 20:39:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-11-08 20:39:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 110 states have (on average 1.3636363636363635) internal successors, (150), 111 states have internal predecessors, (150), 53 states have call successors, (53), 2 states have call predecessors, (53), 2 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-08 20:39:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 256 transitions. [2024-11-08 20:39:37,610 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 256 transitions. Word has length 208 [2024-11-08 20:39:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:37,614 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 256 transitions. [2024-11-08 20:39:37,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-08 20:39:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 256 transitions. [2024-11-08 20:39:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 20:39:37,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:37,620 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:37,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:39:37,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:37,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:37,621 INFO L85 PathProgramCache]: Analyzing trace with hash -602722847, now seen corresponding path program 1 times [2024-11-08 20:39:37,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:37,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231839999] [2024-11-08 20:39:37,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:37,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:39:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:39:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:39:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:39:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:39:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:39:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:39:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:39:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:39:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:39:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:39:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:39:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:39:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:39:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:39:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:39:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:39:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:39:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:39:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:39:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:39:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:39:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:39:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:39:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:39:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 20:39:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:39:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:39:42,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:42,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231839999] [2024-11-08 20:39:42,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231839999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:42,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:42,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 20:39:42,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318338420] [2024-11-08 20:39:42,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:42,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 20:39:42,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:42,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 20:39:42,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 20:39:42,949 INFO L87 Difference]: Start difference. First operand 166 states and 256 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:44,070 INFO L93 Difference]: Finished difference Result 484 states and 716 transitions. [2024-11-08 20:39:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 20:39:44,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-08 20:39:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:44,076 INFO L225 Difference]: With dead ends: 484 [2024-11-08 20:39:44,076 INFO L226 Difference]: Without dead ends: 321 [2024-11-08 20:39:44,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-11-08 20:39:44,080 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 122 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:44,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 688 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 20:39:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-08 20:39:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 244. [2024-11-08 20:39:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 182 states have (on average 1.3296703296703296) internal successors, (242), 185 states have internal predecessors, (242), 57 states have call successors, (57), 4 states have call predecessors, (57), 4 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-08 20:39:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 356 transitions. [2024-11-08 20:39:44,112 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 356 transitions. Word has length 208 [2024-11-08 20:39:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:44,112 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 356 transitions. [2024-11-08 20:39:44,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 356 transitions. [2024-11-08 20:39:44,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 20:39:44,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:44,115 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:44,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:39:44,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:44,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:44,116 INFO L85 PathProgramCache]: Analyzing trace with hash -344557409, now seen corresponding path program 1 times [2024-11-08 20:39:44,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:44,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091599159] [2024-11-08 20:39:44,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:44,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:39:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:39:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:39:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:39:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:39:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:39:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:39:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:39:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:39:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:39:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:39:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:39:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:39:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:39:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:39:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:39:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:39:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:39:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:39:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:39:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:39:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:39:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:39:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:39:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:39:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 20:39:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:39:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:39:44,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:44,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091599159] [2024-11-08 20:39:44,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091599159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:44,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:44,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:39:44,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969331400] [2024-11-08 20:39:44,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:44,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:39:44,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:44,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:39:44,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:39:44,567 INFO L87 Difference]: Start difference. First operand 244 states and 356 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:44,659 INFO L93 Difference]: Finished difference Result 674 states and 994 transitions. [2024-11-08 20:39:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:39:44,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-08 20:39:44,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:44,667 INFO L225 Difference]: With dead ends: 674 [2024-11-08 20:39:44,667 INFO L226 Difference]: Without dead ends: 433 [2024-11-08 20:39:44,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-11-08 20:39:44,669 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 66 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:44,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 264 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:39:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-08 20:39:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 431. [2024-11-08 20:39:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 308 states have (on average 1.3246753246753247) internal successors, (408), 314 states have internal predecessors, (408), 114 states have call successors, (114), 8 states have call predecessors, (114), 8 states have return successors, (114), 108 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-08 20:39:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 636 transitions. [2024-11-08 20:39:44,749 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 636 transitions. Word has length 208 [2024-11-08 20:39:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:44,751 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 636 transitions. [2024-11-08 20:39:44,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 636 transitions. [2024-11-08 20:39:44,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:39:44,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:44,754 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:44,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 20:39:44,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:44,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash -486311048, now seen corresponding path program 1 times [2024-11-08 20:39:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:44,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697232319] [2024-11-08 20:39:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:39:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:39:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:39:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:39:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:39:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:39:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:39:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:39:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:39:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:39:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:39:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:39:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:39:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:39:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:39:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:39:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:39:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:39:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:39:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:39:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:39:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:39:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:39:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:39:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:39:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 20:39:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:39:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 20:39:45,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:45,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697232319] [2024-11-08 20:39:45,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697232319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:39:45,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763588330] [2024-11-08 20:39:45,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:45,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:39:45,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:39:45,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:39:45,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 20:39:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:45,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 20:39:45,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:39:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 386 proven. 87 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2024-11-08 20:39:45,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:39:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 20:39:46,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763588330] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:39:46,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 20:39:46,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 20:39:46,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815889023] [2024-11-08 20:39:46,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 20:39:46,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 20:39:46,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:46,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 20:39:46,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:39:46,074 INFO L87 Difference]: Start difference. First operand 431 states and 636 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-08 20:39:46,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:46,346 INFO L93 Difference]: Finished difference Result 795 states and 1145 transitions. [2024-11-08 20:39:46,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 20:39:46,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 209 [2024-11-08 20:39:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:46,351 INFO L225 Difference]: With dead ends: 795 [2024-11-08 20:39:46,351 INFO L226 Difference]: Without dead ends: 367 [2024-11-08 20:39:46,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 480 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 20:39:46,354 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 107 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:46,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 200 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:39:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-08 20:39:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 343. [2024-11-08 20:39:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 224 states have (on average 1.2142857142857142) internal successors, (272), 226 states have internal predecessors, (272), 106 states have call successors, (106), 12 states have call predecessors, (106), 12 states have return successors, (106), 104 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 20:39:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 484 transitions. [2024-11-08 20:39:46,397 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 484 transitions. Word has length 209 [2024-11-08 20:39:46,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:46,398 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 484 transitions. [2024-11-08 20:39:46,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-08 20:39:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 484 transitions. [2024-11-08 20:39:46,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:39:46,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:46,401 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:46,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 20:39:46,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 20:39:46,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:46,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:46,602 INFO L85 PathProgramCache]: Analyzing trace with hash -358480210, now seen corresponding path program 1 times [2024-11-08 20:39:46,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:46,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368234777] [2024-11-08 20:39:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:46,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:39:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:39:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:39:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:39:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:39:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:39:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:39:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:39:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:39:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:39:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:39:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:39:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:39:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:39:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:39:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:39:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:39:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:39:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:39:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:39:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:39:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:39:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:39:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:39:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:39:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 20:39:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:39:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:39:46,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:46,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368234777] [2024-11-08 20:39:46,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368234777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:46,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:46,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:39:46,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040673602] [2024-11-08 20:39:46,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:46,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:39:46,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:46,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:39:46,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:39:46,884 INFO L87 Difference]: Start difference. First operand 343 states and 484 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:47,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:47,125 INFO L93 Difference]: Finished difference Result 681 states and 960 transitions. [2024-11-08 20:39:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:39:47,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-08 20:39:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:47,132 INFO L225 Difference]: With dead ends: 681 [2024-11-08 20:39:47,133 INFO L226 Difference]: Without dead ends: 494 [2024-11-08 20:39:47,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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-11-08 20:39:47,134 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 129 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:47,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 498 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:39:47,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-08 20:39:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2024-11-08 20:39:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 312 states have (on average 1.1987179487179487) internal successors, (374), 315 states have internal predecessors, (374), 159 states have call successors, (159), 18 states have call predecessors, (159), 18 states have return successors, (159), 156 states have call predecessors, (159), 159 states have call successors, (159) [2024-11-08 20:39:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 692 transitions. [2024-11-08 20:39:47,223 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 692 transitions. Word has length 209 [2024-11-08 20:39:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:47,223 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 692 transitions. [2024-11-08 20:39:47,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:47,223 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 692 transitions. [2024-11-08 20:39:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:39:47,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:47,226 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:47,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 20:39:47,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:47,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash 321578160, now seen corresponding path program 1 times [2024-11-08 20:39:47,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:47,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39455567] [2024-11-08 20:39:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:47,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:39:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:39:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:39:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:39:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:39:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:39:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:39:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:39:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:39:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:39:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:39:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:39:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:39:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:39:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:39:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:39:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:39:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:39:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:39:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:39:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:39:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:39:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:39:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:39:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:39:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 20:39:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:39:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 20:39:48,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:48,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39455567] [2024-11-08 20:39:48,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39455567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:39:48,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047172235] [2024-11-08 20:39:48,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:48,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:39:48,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:39:48,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:39:48,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 20:39:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-08 20:39:48,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:39:52,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 828 proven. 402 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2024-11-08 20:39:52,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:40:10,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047172235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:40:10,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 20:40:10,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19] total 27 [2024-11-08 20:40:10,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590537680] [2024-11-08 20:40:10,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 20:40:10,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 20:40:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:40:10,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 20:40:10,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1237, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 20:40:10,395 INFO L87 Difference]: Start difference. First operand 490 states and 692 transitions. Second operand has 27 states, 27 states have (on average 4.074074074074074) internal successors, (110), 25 states have internal predecessors, (110), 8 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 8 states have call predecessors, (66), 8 states have call successors, (66) [2024-11-08 20:40:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:40:14,369 INFO L93 Difference]: Finished difference Result 988 states and 1305 transitions. [2024-11-08 20:40:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-11-08 20:40:14,370 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.074074074074074) internal successors, (110), 25 states have internal predecessors, (110), 8 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 8 states have call predecessors, (66), 8 states have call successors, (66) Word has length 209 [2024-11-08 20:40:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:40:14,377 INFO L225 Difference]: With dead ends: 988 [2024-11-08 20:40:14,377 INFO L226 Difference]: Without dead ends: 654 [2024-11-08 20:40:14,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3815 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=2948, Invalid=9708, Unknown=0, NotChecked=0, Total=12656 [2024-11-08 20:40:14,384 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 628 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:40:14,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 788 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 20:40:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-08 20:40:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 477. [2024-11-08 20:40:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 314 states have (on average 1.1464968152866242) internal successors, (360), 318 states have internal predecessors, (360), 122 states have call successors, (122), 40 states have call predecessors, (122), 40 states have return successors, (122), 118 states have call predecessors, (122), 122 states have call successors, (122) [2024-11-08 20:40:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 604 transitions. [2024-11-08 20:40:14,466 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 604 transitions. Word has length 209 [2024-11-08 20:40:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:40:14,466 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 604 transitions. [2024-11-08 20:40:14,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.074074074074074) internal successors, (110), 25 states have internal predecessors, (110), 8 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 8 states have call predecessors, (66), 8 states have call successors, (66) [2024-11-08 20:40:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 604 transitions. [2024-11-08 20:40:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:40:14,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:14,470 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:14,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 20:40:14,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 20:40:14,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:14,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash -267479089, now seen corresponding path program 1 times [2024-11-08 20:40:14,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:40:14,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905233055] [2024-11-08 20:40:14,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:14,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:40:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:40:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:40:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:40:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:40:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:40:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:40:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:40:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:40:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:40:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:40:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:40:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:40:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:40:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:40:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:40:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:40:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:40:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:40:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:40:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:40:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:40:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:40:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:40:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:40:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:40:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:40:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:40:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:40:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:40:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:40:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:40:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 20:40:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:40:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 20:40:15,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:40:15,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905233055] [2024-11-08 20:40:15,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905233055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:40:15,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571724294] [2024-11-08 20:40:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:15,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:40:15,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:40:15,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:40:15,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 20:40:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:15,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 20:40:15,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:40:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 158 proven. 93 refuted. 0 times theorem prover too weak. 1861 trivial. 0 not checked. [2024-11-08 20:40:15,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:40:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 20:40:16,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571724294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:40:16,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 20:40:16,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-08 20:40:16,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552436024] [2024-11-08 20:40:16,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 20:40:16,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 20:40:16,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:40:16,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 20:40:16,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 20:40:16,089 INFO L87 Difference]: Start difference. First operand 477 states and 604 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-08 20:40:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:40:17,005 INFO L93 Difference]: Finished difference Result 1491 states and 1862 transitions. [2024-11-08 20:40:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 20:40:17,006 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 209 [2024-11-08 20:40:17,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:40:17,012 INFO L225 Difference]: With dead ends: 1491 [2024-11-08 20:40:17,012 INFO L226 Difference]: Without dead ends: 1017 [2024-11-08 20:40:17,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 476 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-11-08 20:40:17,016 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 147 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 20:40:17,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 734 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 20:40:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2024-11-08 20:40:17,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 684. [2024-11-08 20:40:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 452 states have (on average 1.1327433628318584) internal successors, (512), 457 states have internal predecessors, (512), 175 states have call successors, (175), 56 states have call predecessors, (175), 56 states have return successors, (175), 170 states have call predecessors, (175), 175 states have call successors, (175) [2024-11-08 20:40:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 862 transitions. [2024-11-08 20:40:17,131 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 862 transitions. Word has length 209 [2024-11-08 20:40:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:40:17,133 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 862 transitions. [2024-11-08 20:40:17,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-08 20:40:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 862 transitions. [2024-11-08 20:40:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:40:17,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:17,136 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:17,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 20:40:17,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:40:17,340 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:17,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:17,341 INFO L85 PathProgramCache]: Analyzing trace with hash -265632047, now seen corresponding path program 1 times [2024-11-08 20:40:17,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:40:17,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733523861] [2024-11-08 20:40:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:40:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:40:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:40:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:40:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:40:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:40:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:40:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:40:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:40:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:40:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:40:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:40:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:40:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:40:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:40:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:40:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:40:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:40:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:40:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:40:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:40:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:40:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:40:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:40:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:40:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:40:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:40:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:40:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:40:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:40:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:40:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:40:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 20:40:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:40:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:40:17,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:40:17,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733523861] [2024-11-08 20:40:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733523861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:40:17,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:40:17,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:40:17,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058368086] [2024-11-08 20:40:17,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:40:17,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:40:17,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:40:17,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:40:17,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:40:17,527 INFO L87 Difference]: Start difference. First operand 684 states and 862 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:40:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:40:17,617 INFO L93 Difference]: Finished difference Result 1182 states and 1487 transitions. [2024-11-08 20:40:17,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:40:17,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-08 20:40:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:40:17,622 INFO L225 Difference]: With dead ends: 1182 [2024-11-08 20:40:17,622 INFO L226 Difference]: Without dead ends: 477 [2024-11-08 20:40:17,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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-11-08 20:40:17,626 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:40:17,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:40:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-08 20:40:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2024-11-08 20:40:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 314 states have (on average 1.10828025477707) internal successors, (348), 318 states have internal predecessors, (348), 122 states have call successors, (122), 40 states have call predecessors, (122), 40 states have return successors, (122), 118 states have call predecessors, (122), 122 states have call successors, (122) [2024-11-08 20:40:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 592 transitions. [2024-11-08 20:40:17,730 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 592 transitions. Word has length 209 [2024-11-08 20:40:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:40:17,731 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 592 transitions. [2024-11-08 20:40:17,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:40:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 592 transitions. [2024-11-08 20:40:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 20:40:17,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:17,733 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:17,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 20:40:17,734 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:17,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1501399998, now seen corresponding path program 1 times [2024-11-08 20:40:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:40:17,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929396834] [2024-11-08 20:40:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:40:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:40:17,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1498907619] [2024-11-08 20:40:17,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:17,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:40:17,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:40:17,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:40:17,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 20:40:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:40:17,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:40:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:40:18,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:40:18,156 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:40:18,157 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:40:18,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 20:40:18,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:40:18,365 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:18,513 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:40:18,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:40:18 BoogieIcfgContainer [2024-11-08 20:40:18,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:40:18,519 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:40:18,519 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:40:18,519 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:40:18,520 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:39:34" (3/4) ... [2024-11-08 20:40:18,522 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:40:18,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:40:18,524 INFO L158 Benchmark]: Toolchain (without parser) took 45629.26ms. Allocated memory was 161.5MB in the beginning and 490.7MB in the end (delta: 329.3MB). Free memory was 95.1MB in the beginning and 311.6MB in the end (delta: -216.5MB). Peak memory consumption was 112.1MB. Max. memory is 16.1GB. [2024-11-08 20:40:18,524 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 96.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:40:18,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.13ms. Allocated memory is still 161.5MB. Free memory was 95.1MB in the beginning and 127.4MB in the end (delta: -32.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-11-08 20:40:18,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.04ms. Allocated memory is still 161.5MB. Free memory was 126.7MB in the beginning and 123.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:40:18,525 INFO L158 Benchmark]: Boogie Preprocessor took 65.74ms. Allocated memory is still 161.5MB. Free memory was 123.8MB in the beginning and 119.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:40:18,525 INFO L158 Benchmark]: RCFGBuilder took 614.72ms. Allocated memory is still 161.5MB. Free memory was 119.0MB in the beginning and 93.0MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 20:40:18,525 INFO L158 Benchmark]: TraceAbstraction took 44463.74ms. Allocated memory was 161.5MB in the beginning and 490.7MB in the end (delta: 329.3MB). Free memory was 92.3MB in the beginning and 312.7MB in the end (delta: -220.3MB). Peak memory consumption was 109.5MB. Max. memory is 16.1GB. [2024-11-08 20:40:18,525 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 490.7MB. Free memory is still 311.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:40:18,527 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 96.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.13ms. Allocated memory is still 161.5MB. Free memory was 95.1MB in the beginning and 127.4MB in the end (delta: -32.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.04ms. Allocated memory is still 161.5MB. Free memory was 126.7MB in the beginning and 123.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.74ms. Allocated memory is still 161.5MB. Free memory was 123.8MB in the beginning and 119.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 614.72ms. Allocated memory is still 161.5MB. Free memory was 119.0MB in the beginning and 93.0MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 44463.74ms. Allocated memory was 161.5MB in the beginning and 490.7MB in the end (delta: 329.3MB). Free memory was 92.3MB in the beginning and 312.7MB in the end (delta: -220.3MB). Peak memory consumption was 109.5MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 490.7MB. Free memory is still 311.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 186, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryArithmeticDOUBLEoperation at line 119. 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 = 16; [L55] unsigned short int last_1_var_1_6 = 4; [L56] unsigned short int last_1_var_1_9 = 4; [L57] unsigned long int last_1_var_1_14 = 500; [L58] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L190] isInitial = 1 [L191] FCALL initially() [L192] COND TRUE 1 [L193] CALL updateLastVariables() [L180] last_1_var_1_6 = var_1_6 [L181] last_1_var_1_9 = var_1_9 [L182] last_1_var_1_14 = var_1_14 [L183] last_1_var_1_17 = 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, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L193] RET updateLastVariables() [L194] CALL updateVariables() [L126] var_1_4 = __VERIFIER_nondet_uchar() [L127] 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=16, 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=16, var_1_5=0, var_1_6=4, var_1_9=4] [L127] 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=16, var_1_5=0, var_1_6=4, var_1_9=4] [L128] 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=16, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L129] var_1_5 = __VERIFIER_nondet_uchar() [L130] 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=16, 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=16, var_1_4=0, var_1_6=4, var_1_9=4] [L130] 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=16, var_1_4=0, var_1_6=4, var_1_9=4] [L131] 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=16, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L132] var_1_10 = __VERIFIER_nondet_ushort() [L133] 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=16, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L133] 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] 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=16, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] var_1_12 = __VERIFIER_nondet_double() [L136] 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=16, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L136] 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] var_1_13 = __VERIFIER_nondet_double() [L138] 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=16, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] var_1_15 = __VERIFIER_nondet_ulong() [L140] 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=16, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] 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=16, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L142] var_1_16 = __VERIFIER_nondet_ulong() [L143] 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=3221225470, 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=16, 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] 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=3221225470, 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=16, 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L145] var_1_19 = __VERIFIER_nondet_short() [L146] 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=3221225470, 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=16, 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] 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=3221225470, 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=16, 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L148] var_1_20 = __VERIFIER_nondet_short() [L149] 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=3221225470, 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=16, 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] 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=3221225470, 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=16, 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] var_1_21 = __VERIFIER_nondet_short() [L152] 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=3221225470, 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=16, 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] 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=3221225470, 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=16, 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] var_1_22 = __VERIFIER_nondet_short() [L155] 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=3221225470, 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=16, 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] 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=3221225470, 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=16, 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] 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=3221225470, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] var_1_24 = __VERIFIER_nondet_char() [L158] 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=3221225470, 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=-127, 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=16, 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=3221225470, 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=-127, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] 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=3221225470, 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=-127, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] 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=3221225470, 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=-127, 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=16, 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=3221225470, 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=-127, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] 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=3221225470, 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=-127, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L160] var_1_27 = __VERIFIER_nondet_float() [L161] 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=3221225470, 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=-127, 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=16, 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=3221225470, 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=-127, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L161] 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=3221225470, 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=-127, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L162] var_1_28 = __VERIFIER_nondet_float() [L163] 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=3221225470, 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=-127, 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=16, 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=3221225470, 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=-127, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L163] 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=3221225470, 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=-127, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L164] var_1_29 = __VERIFIER_nondet_char() [L165] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L165] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L167] var_1_31 = __VERIFIER_nondet_uchar() [L168] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L168] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L170] var_1_32 = __VERIFIER_nondet_ushort() [L171] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L173] var_1_33 = __VERIFIER_nondet_double() [L174] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, 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=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] var_1_35 = __VERIFIER_nondet_uchar() [L176] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L176] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] 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=3221225470, 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=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L194] RET updateVariables() [L195] CALL step() [L62] var_1_23 = var_1_24 [L63] 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, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L64] COND TRUE (- var_1_27) >= var_1_28 [L65] var_1_26 = ((((var_1_24) > (var_1_29)) ? (var_1_24) : (var_1_29))) 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=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L67] 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, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L72] COND FALSE !(var_1_26 < 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, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L75] COND FALSE !(var_1_34 != ((((var_1_35) < 0 ) ? -(var_1_35) : (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, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L78] var_1_37 = var_1_34 [L79] var_1_38 = var_1_35 [L80] 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=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L81] 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=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L86] 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=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L87] COND TRUE last_1_var_1_14 >= stepLocal_3 [L88] 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=3221225454, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L90] 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=3221225454, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L91] COND TRUE (- var_1_14) > var_1_6 [L92] 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=3221225454, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L97] unsigned char stepLocal_2 = var_1_4; [L98] 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=3221225454, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] 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=3221225454, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L102] COND TRUE stepLocal_1 >= var_1_6 [L103] 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=3221225454, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L108] unsigned char stepLocal_5 = var_1_1; [L109] 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=3221225454, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L110] 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=3221225454, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L117] 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=3221225454, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L118] COND TRUE ! var_1_1 [L119] 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=3221225454, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L195] RET step() [L196] CALL, EXPR property() [L186-L187] 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) ; VAL [\result=0, 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=3221225454, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L196] RET, EXPR property() [L196] 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=3221225454, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, 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=3221225454, var_1_15=2147483647, var_1_16=3221225470, 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=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, 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, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 11, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1598 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1564 mSDsluCounter, 3928 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2473 mSDsCounter, 566 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2529 IncrementalHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 566 mSolverCounterUnsat, 1455 mSDtfsCounter, 2529 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2075 GetRequests, 1908 SyntacticMatches, 4 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3905 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=684occurred in iteration=9, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 638 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 33.3s InterpolantComputationTime, 3131 NumberOfCodeBlocks, 3131 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3114 ConstructedInterpolants, 0 QuantifiedInterpolants, 15365 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1464 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 30666/31680 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-11-08 20:40:18,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:40:20,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:40:20,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:40:20,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:40:20,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:40:20,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:40:20,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:40:20,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:40:20,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:40:20,814 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:40:20,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:40:20,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:40:20,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:40:20,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:40:20,817 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:40:20,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:40:20,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:40:20,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:40:20,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:40:20,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:40:20,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:40:20,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:40:20,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:40:20,824 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:40:20,824 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:40:20,824 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:40:20,824 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:40:20,824 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:40:20,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:40:20,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:40:20,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:40:20,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:40:20,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:40:20,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:40:20,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:40:20,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:40:20,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:40:20,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:40:20,829 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:40:20,829 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:40:20,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:40:20,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:40:20,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:40:20,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:40:20,830 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 [2024-11-08 20:40:21,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:40:21,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:40:21,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:40:21,164 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:40:21,164 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:40:21,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-08 20:40:22,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:40:23,013 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:40:23,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-08 20:40:23,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ba36894/b8fb11027c7648b6b105bc770afa5302/FLAGbe49c3573 [2024-11-08 20:40:23,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ba36894/b8fb11027c7648b6b105bc770afa5302 [2024-11-08 20:40:23,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:40:23,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:40:23,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:40:23,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:40:23,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:40:23,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d0980c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23, skipping insertion in model container [2024-11-08 20:40:23,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:40:23,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i[914,927] [2024-11-08 20:40:23,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:40:23,699 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:40:23,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i[914,927] [2024-11-08 20:40:23,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:40:23,778 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:40:23,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23 WrapperNode [2024-11-08 20:40:23,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:40:23,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:40:23,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:40:23,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:40:23,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,841 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-08 20:40:23,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:40:23,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:40:23,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:40:23,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:40:23,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,886 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-11-08 20:40:23,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:40:23,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:40:23,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:40:23,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:40:23,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23" (1/1) ... [2024-11-08 20:40:23,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:40:23,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:40:23,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:40:23,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:40:24,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:40:24,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:40:24,012 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:40:24,013 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:40:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:40:24,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:40:24,102 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:40:24,105 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:40:24,885 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 20:40:24,886 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:40:24,901 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:40:24,901 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:40:24,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:40:24 BoogieIcfgContainer [2024-11-08 20:40:24,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:40:24,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:40:24,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:40:24,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:40:24,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:40:23" (1/3) ... [2024-11-08 20:40:24,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595ce577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:40:24, skipping insertion in model container [2024-11-08 20:40:24,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:23" (2/3) ... [2024-11-08 20:40:24,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595ce577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:40:24, skipping insertion in model container [2024-11-08 20:40:24,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:40:24" (3/3) ... [2024-11-08 20:40:24,911 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-08 20:40:24,927 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:40:24,928 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:40:24,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:40:25,005 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;@7419564b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:40:25,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:40:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:40:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 20:40:25,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:25,037 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:25,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:25,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:25,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1292902638, now seen corresponding path program 1 times [2024-11-08 20:40:25,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:40:25,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895286233] [2024-11-08 20:40:25,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:25,061 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-11-08 20:40:25,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:40:25,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:40:25,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 20:40:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:25,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:40:25,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:40:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 688 proven. 0 refuted. 0 times theorem prover too weak. 1424 trivial. 0 not checked. [2024-11-08 20:40:25,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:40:25,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:40:25,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895286233] [2024-11-08 20:40:25,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895286233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:40:25,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:40:25,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:40:25,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431906228] [2024-11-08 20:40:25,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:40:25,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:40:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:40:25,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:40:25,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:40:25,560 INFO L87 Difference]: Start difference. First operand has 91 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:40:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:40:25,601 INFO L93 Difference]: Finished difference Result 175 states and 311 transitions. [2024-11-08 20:40:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:40:25,603 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 207 [2024-11-08 20:40:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:40:25,611 INFO L225 Difference]: With dead ends: 175 [2024-11-08 20:40:25,611 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 20:40:25,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 206 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-11-08 20:40:25,622 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:40:25,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:40:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 20:40:25,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-08 20:40:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:40:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-11-08 20:40:25,668 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 207 [2024-11-08 20:40:25,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:40:25,668 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-11-08 20:40:25,668 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:40:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-11-08 20:40:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 20:40:25,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:25,672 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:25,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 20:40:25,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:40:25,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:25,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:25,875 INFO L85 PathProgramCache]: Analyzing trace with hash 983778013, now seen corresponding path program 1 times [2024-11-08 20:40:25,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:40:25,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412489902] [2024-11-08 20:40:25,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:25,876 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-11-08 20:40:25,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:40:25,878 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:40:25,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 20:40:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:26,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 20:40:26,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:40:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 309 proven. 177 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-11-08 20:40:27,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:40:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 180 refuted. 0 times theorem prover too weak. 1923 trivial. 0 not checked. [2024-11-08 20:40:27,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:40:27,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412489902] [2024-11-08 20:40:27,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412489902] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:40:27,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 20:40:27,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-08 20:40:27,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786685930] [2024-11-08 20:40:27,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 20:40:27,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 20:40:27,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:40:27,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 20:40:27,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-08 20:40:27,952 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-11-08 20:40:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:40:29,292 INFO L93 Difference]: Finished difference Result 197 states and 290 transitions. [2024-11-08 20:40:29,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 20:40:29,293 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) Word has length 208 [2024-11-08 20:40:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:40:29,299 INFO L225 Difference]: With dead ends: 197 [2024-11-08 20:40:29,299 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 20:40:29,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-11-08 20:40:29,301 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 63 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:40:29,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 319 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 20:40:29,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 20:40:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2024-11-08 20:40:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:40:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2024-11-08 20:40:29,330 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 208 [2024-11-08 20:40:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:40:29,330 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2024-11-08 20:40:29,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-11-08 20:40:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2024-11-08 20:40:29,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:40:29,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:29,337 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:29,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 20:40:29,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:40:29,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:29,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:29,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1635664496, now seen corresponding path program 1 times [2024-11-08 20:40:29,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:40:29,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517596870] [2024-11-08 20:40:29,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:29,547 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-11-08 20:40:29,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:40:29,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:40:29,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 20:40:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:29,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 20:40:29,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:40:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:40:30,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:40:30,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:40:30,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517596870] [2024-11-08 20:40:30,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517596870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:40:30,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:40:30,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:40:30,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204313574] [2024-11-08 20:40:30,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:40:30,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:40:30,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:40:30,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:40:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:40:30,258 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:40:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:40:31,229 INFO L93 Difference]: Finished difference Result 284 states and 404 transitions. [2024-11-08 20:40:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:40:31,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-08 20:40:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:40:31,232 INFO L225 Difference]: With dead ends: 284 [2024-11-08 20:40:31,232 INFO L226 Difference]: Without dead ends: 188 [2024-11-08 20:40:31,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 205 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-11-08 20:40:31,234 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 143 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 20:40:31,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 359 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 20:40:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-08 20:40:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2024-11-08 20:40:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 113 states have (on average 1.168141592920354) internal successors, (132), 113 states have internal predecessors, (132), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 20:40:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 264 transitions. [2024-11-08 20:40:31,270 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 264 transitions. Word has length 209 [2024-11-08 20:40:31,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:40:31,270 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 264 transitions. [2024-11-08 20:40:31,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:40:31,271 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 264 transitions. [2024-11-08 20:40:31,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:40:31,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:31,273 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:31,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 20:40:31,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:40:31,475 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:31,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:31,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1979244430, now seen corresponding path program 1 times [2024-11-08 20:40:31,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:40:31,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152456442] [2024-11-08 20:40:31,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:31,477 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-11-08 20:40:31,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:40:31,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:40:31,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 20:40:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:31,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 20:40:31,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:40:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 816 proven. 72 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2024-11-08 20:40:33,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:40:33,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:40:33,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152456442] [2024-11-08 20:40:33,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152456442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:40:33,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1170207833] [2024-11-08 20:40:33,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:33,448 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 20:40:33,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 20:40:33,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 20:40:33,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-08 20:40:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:34,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 20:40:34,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:40:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 932 proven. 135 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2024-11-08 20:40:35,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:40:36,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1170207833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:40:36,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 20:40:36,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-11-08 20:40:36,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152379741] [2024-11-08 20:40:36,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 20:40:36,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 20:40:36,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:40:36,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 20:40:36,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-08 20:40:36,156 INFO L87 Difference]: Start difference. First operand 186 states and 264 transitions. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 16 states have internal predecessors, (101), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) [2024-11-08 20:40:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:40:39,379 INFO L93 Difference]: Finished difference Result 501 states and 690 transitions. [2024-11-08 20:40:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 20:40:39,380 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 16 states have internal predecessors, (101), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) Word has length 209 [2024-11-08 20:40:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:40:39,384 INFO L225 Difference]: With dead ends: 501 [2024-11-08 20:40:39,384 INFO L226 Difference]: Without dead ends: 318 [2024-11-08 20:40:39,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 20:40:39,387 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 264 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:40:39,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 580 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 20:40:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-08 20:40:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 298. [2024-11-08 20:40:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 183 states have (on average 1.1475409836065573) internal successors, (210), 183 states have internal predecessors, (210), 99 states have call successors, (99), 15 states have call predecessors, (99), 15 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-08 20:40:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 408 transitions. [2024-11-08 20:40:39,440 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 408 transitions. Word has length 209 [2024-11-08 20:40:39,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:40:39,441 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 408 transitions. [2024-11-08 20:40:39,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 16 states have internal predecessors, (101), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) [2024-11-08 20:40:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 408 transitions. [2024-11-08 20:40:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:40:39,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:39,444 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:39,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 20:40:39,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-08 20:40:39,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 20:40:39,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:39,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:39,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1728916852, now seen corresponding path program 1 times [2024-11-08 20:40:39,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:40:39,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549714899] [2024-11-08 20:40:39,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:39,847 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-11-08 20:40:39,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:40:39,851 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:40:39,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 20:40:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:40,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 20:40:40,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:40:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:40:40,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:40:40,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:40:40,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549714899] [2024-11-08 20:40:40,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549714899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:40:40,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:40:40,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:40:40,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093650739] [2024-11-08 20:40:40,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:40:40,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:40:40,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:40:40,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:40:40,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:40:40,881 INFO L87 Difference]: Start difference. First operand 298 states and 408 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:40:41,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:40:41,550 INFO L93 Difference]: Finished difference Result 495 states and 675 transitions. [2024-11-08 20:40:41,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:40:41,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-08 20:40:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:40:41,564 INFO L225 Difference]: With dead ends: 495 [2024-11-08 20:40:41,564 INFO L226 Difference]: Without dead ends: 200 [2024-11-08 20:40:41,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 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-11-08 20:40:41,570 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 63 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 20:40:41,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 396 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 20:40:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-08 20:40:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 184. [2024-11-08 20:40:41,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 107 states have (on average 1.1214953271028036) internal successors, (120), 107 states have internal predecessors, (120), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 20:40:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 252 transitions. [2024-11-08 20:40:41,607 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 252 transitions. Word has length 209 [2024-11-08 20:40:41,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:40:41,607 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 252 transitions. [2024-11-08 20:40:41,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:40:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 252 transitions. [2024-11-08 20:40:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 20:40:41,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:41,610 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:41,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 20:40:41,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:40:41,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:41,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:41,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1104623556, now seen corresponding path program 1 times [2024-11-08 20:40:41,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:40:41,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730651468] [2024-11-08 20:40:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:41,813 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-11-08 20:40:41,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:40:41,815 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:40:41,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process