./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.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 67842bd2132ccd8a41236e85d94558bf263880db0378e3df7d9b2f0e5d6e4ad1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:30:37,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:30:37,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:30:37,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:30:37,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:30:37,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:30:37,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:30:37,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:30:37,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:30:37,676 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:30:37,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:30:37,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:30:37,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:30:37,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:30:37,678 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:30:37,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:30:37,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:30:37,680 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:30:37,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:30:37,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:30:37,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:30:37,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:30:37,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:30:37,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:30:37,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:30:37,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:30:37,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:30:37,684 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:30:37,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:30:37,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:30:37,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:30:37,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:30:37,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:30:37,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:30:37,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:30:37,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:30:37,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:30:37,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:30:37,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:30:37,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:30:37,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:30:37,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:30:37,692 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 -> 67842bd2132ccd8a41236e85d94558bf263880db0378e3df7d9b2f0e5d6e4ad1 [2024-10-14 10:30:37,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:30:37,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:30:37,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:30:37,975 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:30:37,975 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:30:37,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i [2024-10-14 10:30:39,425 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:30:39,689 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:30:39,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i [2024-10-14 10:30:39,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0984f2c/c944818b50954f02b9b43946acb76265/FLAG842070a9b [2024-10-14 10:30:39,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0984f2c/c944818b50954f02b9b43946acb76265 [2024-10-14 10:30:39,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:30:39,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:30:39,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:30:39,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:30:39,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:30:39,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:30:39" (1/1) ... [2024-10-14 10:30:39,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d61b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:39, skipping insertion in model container [2024-10-14 10:30:39,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:30:39" (1/1) ... [2024-10-14 10:30:39,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:30:39,933 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i[919,932] [2024-10-14 10:30:40,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:30:40,020 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:30:40,030 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i[919,932] [2024-10-14 10:30:40,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:30:40,088 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:30:40,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40 WrapperNode [2024-10-14 10:30:40,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:30:40,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:30:40,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:30:40,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:30:40,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40" (1/1) ... [2024-10-14 10:30:40,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40" (1/1) ... [2024-10-14 10:30:40,170 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2024-10-14 10:30:40,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:30:40,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:30:40,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:30:40,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:30:40,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40" (1/1) ... [2024-10-14 10:30:40,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40" (1/1) ... [2024-10-14 10:30:40,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40" (1/1) ... [2024-10-14 10:30:40,211 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 10:30:40,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40" (1/1) ... [2024-10-14 10:30:40,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40" (1/1) ... [2024-10-14 10:30:40,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40" (1/1) ... [2024-10-14 10:30:40,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40" (1/1) ... [2024-10-14 10:30:40,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40" (1/1) ... [2024-10-14 10:30:40,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40" (1/1) ... [2024-10-14 10:30:40,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:30:40,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:30:40,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:30:40,245 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:30:40,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40" (1/1) ... [2024-10-14 10:30:40,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:30:40,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:30:40,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 10:30:40,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:30:40,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:30:40,362 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:30:40,363 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:30:40,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:30:40,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:30:40,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:30:40,490 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:30:40,492 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:30:41,006 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 10:30:41,007 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:30:41,058 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:30:41,059 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:30:41,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:30:41 BoogieIcfgContainer [2024-10-14 10:30:41,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:30:41,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:30:41,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:30:41,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:30:41,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:30:39" (1/3) ... [2024-10-14 10:30:41,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b372550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:30:41, skipping insertion in model container [2024-10-14 10:30:41,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:40" (2/3) ... [2024-10-14 10:30:41,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b372550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:30:41, skipping insertion in model container [2024-10-14 10:30:41,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:30:41" (3/3) ... [2024-10-14 10:30:41,069 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i [2024-10-14 10:30:41,087 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:30:41,087 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:30:41,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:30:41,158 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;@38edb10f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:30:41,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:30:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 66 states have internal predecessors, (100), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 10:30:41,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 10:30:41,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:30:41,185 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:30:41,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:30:41,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:30:41,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1023375299, now seen corresponding path program 1 times [2024-10-14 10:30:41,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:30:41,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646253265] [2024-10-14 10:30:41,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:30:41,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:30:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:41,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:30:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:41,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:30:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:41,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:30:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:41,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:30:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:41,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:30:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:41,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:30:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:30:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:30:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:30:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:30:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:30:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:30:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:30:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:30:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:30:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:30:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:30:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:30:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:30:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:30:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:30:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:30:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:30:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:30:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:30:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:30:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:30:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:30:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:30:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:30:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:30:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:30:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 10:30:42,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:30:42,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646253265] [2024-10-14 10:30:42,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646253265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:30:42,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:30:42,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:30:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824612688] [2024-10-14 10:30:42,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:30:42,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:30:42,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:30:42,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:30:42,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:30:42,349 INFO L87 Difference]: Start difference. First operand has 100 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 66 states have internal predecessors, (100), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:42,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:30:42,666 INFO L93 Difference]: Finished difference Result 287 states and 543 transitions. [2024-10-14 10:30:42,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:30:42,672 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-10-14 10:30:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:30:42,689 INFO L225 Difference]: With dead ends: 287 [2024-10-14 10:30:42,691 INFO L226 Difference]: Without dead ends: 188 [2024-10-14 10:30:42,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:30:42,704 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 82 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:30:42,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 358 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:30:42,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-14 10:30:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 173. [2024-10-14 10:30:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 10:30:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 275 transitions. [2024-10-14 10:30:42,784 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 275 transitions. Word has length 204 [2024-10-14 10:30:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:30:42,788 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 275 transitions. [2024-10-14 10:30:42,788 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:42,788 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 275 transitions. [2024-10-14 10:30:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 10:30:42,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:30:42,794 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:30:42,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:30:42,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:30:42,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:30:42,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1174866237, now seen corresponding path program 1 times [2024-10-14 10:30:42,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:30:42,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709502216] [2024-10-14 10:30:42,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:30:42,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:30:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:30:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:30:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:30:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:30:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:30:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:30:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:30:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:30:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:30:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:30:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:30:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:30:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:30:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:30:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:30:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:30:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:30:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:30:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:30:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:30:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:30:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:30:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:30:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:30:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:30:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:30:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:30:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:30:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:30:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:30:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:30:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:30:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 10:30:43,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:30:43,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709502216] [2024-10-14 10:30:43,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709502216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:30:43,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:30:43,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:30:43,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427610937] [2024-10-14 10:30:43,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:30:43,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:30:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:30:43,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:30:43,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:30:43,324 INFO L87 Difference]: Start difference. First operand 173 states and 275 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:30:43,654 INFO L93 Difference]: Finished difference Result 320 states and 516 transitions. [2024-10-14 10:30:43,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:30:43,655 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-10-14 10:30:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:30:43,660 INFO L225 Difference]: With dead ends: 320 [2024-10-14 10:30:43,660 INFO L226 Difference]: Without dead ends: 216 [2024-10-14 10:30:43,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:30:43,665 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 156 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:30:43,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 303 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:30:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-14 10:30:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 191. [2024-10-14 10:30:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 124 states have (on average 1.403225806451613) internal successors, (174), 124 states have internal predecessors, (174), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 10:30:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 302 transitions. [2024-10-14 10:30:43,695 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 302 transitions. Word has length 204 [2024-10-14 10:30:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:30:43,696 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 302 transitions. [2024-10-14 10:30:43,696 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 302 transitions. [2024-10-14 10:30:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 10:30:43,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:30:43,702 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:30:43,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:30:43,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:30:43,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:30:43,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1820948197, now seen corresponding path program 1 times [2024-10-14 10:30:43,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:30:43,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758033108] [2024-10-14 10:30:43,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:30:43,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:30:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:30:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:30:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:30:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:30:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:30:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:30:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:30:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:30:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:30:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:30:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:30:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:30:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:30:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:30:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:30:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:30:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:30:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:30:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:30:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:30:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:30:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:30:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:43,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:30:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:30:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:30:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:30:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:30:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:30:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:30:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:30:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:30:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:30:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 10:30:44,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:30:44,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758033108] [2024-10-14 10:30:44,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758033108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:30:44,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:30:44,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:30:44,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709229407] [2024-10-14 10:30:44,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:30:44,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:30:44,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:30:44,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:30:44,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:30:44,037 INFO L87 Difference]: Start difference. First operand 191 states and 302 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:30:44,306 INFO L93 Difference]: Finished difference Result 446 states and 711 transitions. [2024-10-14 10:30:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:30:44,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-10-14 10:30:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:30:44,314 INFO L225 Difference]: With dead ends: 446 [2024-10-14 10:30:44,314 INFO L226 Difference]: Without dead ends: 348 [2024-10-14 10:30:44,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:30:44,318 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 133 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:30:44,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 322 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:30:44,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-14 10:30:44,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 285. [2024-10-14 10:30:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 185 states have (on average 1.4108108108108108) internal successors, (261), 185 states have internal predecessors, (261), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-14 10:30:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 453 transitions. [2024-10-14 10:30:44,362 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 453 transitions. Word has length 205 [2024-10-14 10:30:44,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:30:44,363 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 453 transitions. [2024-10-14 10:30:44,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 453 transitions. [2024-10-14 10:30:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 10:30:44,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:30:44,368 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:30:44,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:30:44,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:30:44,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:30:44,369 INFO L85 PathProgramCache]: Analyzing trace with hash 15509863, now seen corresponding path program 1 times [2024-10-14 10:30:44,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:30:44,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047207952] [2024-10-14 10:30:44,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:30:44,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:30:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:30:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:30:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:30:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:30:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:30:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:30:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:30:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:30:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:30:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:30:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:30:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:30:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:30:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:30:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:30:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:30:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:30:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:30:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:30:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:30:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:30:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:30:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:30:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:30:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:30:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:30:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:30:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:30:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:30:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:30:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:30:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:30:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 10:30:44,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:30:44,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047207952] [2024-10-14 10:30:44,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047207952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:30:44,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:30:44,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:30:44,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327243048] [2024-10-14 10:30:44,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:30:44,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:30:44,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:30:44,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:30:44,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:30:44,663 INFO L87 Difference]: Start difference. First operand 285 states and 453 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:30:44,787 INFO L93 Difference]: Finished difference Result 530 states and 845 transitions. [2024-10-14 10:30:44,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:30:44,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-10-14 10:30:44,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:30:44,791 INFO L225 Difference]: With dead ends: 530 [2024-10-14 10:30:44,792 INFO L226 Difference]: Without dead ends: 311 [2024-10-14 10:30:44,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:30:44,796 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 73 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:30:44,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 252 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:30:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-14 10:30:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 290. [2024-10-14 10:30:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 190 states have (on average 1.394736842105263) internal successors, (265), 190 states have internal predecessors, (265), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-14 10:30:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 457 transitions. [2024-10-14 10:30:44,843 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 457 transitions. Word has length 205 [2024-10-14 10:30:44,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:30:44,844 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 457 transitions. [2024-10-14 10:30:44,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 457 transitions. [2024-10-14 10:30:44,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-14 10:30:44,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:30:44,848 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:30:44,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:30:44,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:30:44,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:30:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1475461526, now seen corresponding path program 1 times [2024-10-14 10:30:44,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:30:44,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544602474] [2024-10-14 10:30:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:30:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:30:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:30:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:30:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:30:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:30:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:30:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:30:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:30:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:30:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:30:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:30:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:30:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:30:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:30:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:30:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:30:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:30:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:30:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:30:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:30:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:30:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:30:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:30:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:30:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:30:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:30:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:30:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:30:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:30:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:30:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:30:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:30:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:30:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 10:30:45,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:30:45,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544602474] [2024-10-14 10:30:45,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544602474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:30:45,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:30:45,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:30:45,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89694247] [2024-10-14 10:30:45,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:30:45,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:30:45,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:30:45,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:30:45,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:30:45,225 INFO L87 Difference]: Start difference. First operand 290 states and 457 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:30:45,359 INFO L93 Difference]: Finished difference Result 520 states and 824 transitions. [2024-10-14 10:30:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:30:45,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-10-14 10:30:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:30:45,364 INFO L225 Difference]: With dead ends: 520 [2024-10-14 10:30:45,364 INFO L226 Difference]: Without dead ends: 311 [2024-10-14 10:30:45,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:30:45,367 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 68 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:30:45,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 251 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:30:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-14 10:30:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 272. [2024-10-14 10:30:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 172 states have (on average 1.3837209302325582) internal successors, (238), 172 states have internal predecessors, (238), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-14 10:30:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 430 transitions. [2024-10-14 10:30:45,398 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 430 transitions. Word has length 207 [2024-10-14 10:30:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:30:45,399 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 430 transitions. [2024-10-14 10:30:45,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 430 transitions. [2024-10-14 10:30:45,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 10:30:45,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:30:45,402 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:30:45,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 10:30:45,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:30:45,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:30:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1950695959, now seen corresponding path program 1 times [2024-10-14 10:30:45,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:30:45,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195395979] [2024-10-14 10:30:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:30:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:30:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:30:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:30:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:30:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:30:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:30:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:30:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:30:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:30:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:30:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:30:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:30:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:30:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:30:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:30:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:30:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:30:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:30:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:30:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:30:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:30:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:30:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:30:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:30:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:30:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:30:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:30:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:30:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:30:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:30:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:30:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:30:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:30:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 10:30:45,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:30:45,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195395979] [2024-10-14 10:30:45,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195395979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:30:45,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:30:45,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:30:45,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337904900] [2024-10-14 10:30:45,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:30:45,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:30:45,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:30:45,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:30:45,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:30:45,778 INFO L87 Difference]: Start difference. First operand 272 states and 430 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:30:45,848 INFO L93 Difference]: Finished difference Result 508 states and 805 transitions. [2024-10-14 10:30:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:30:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-10-14 10:30:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:30:45,852 INFO L225 Difference]: With dead ends: 508 [2024-10-14 10:30:45,852 INFO L226 Difference]: Without dead ends: 294 [2024-10-14 10:30:45,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:30:45,854 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 79 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:30:45,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 276 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:30:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-14 10:30:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2024-10-14 10:30:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 172 states have (on average 1.377906976744186) internal successors, (237), 172 states have internal predecessors, (237), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-14 10:30:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 429 transitions. [2024-10-14 10:30:45,897 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 429 transitions. Word has length 208 [2024-10-14 10:30:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:30:45,898 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 429 transitions. [2024-10-14 10:30:45,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 429 transitions. [2024-10-14 10:30:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 10:30:45,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:30:45,900 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:30:45,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 10:30:45,900 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:30:45,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:30:45,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2081792757, now seen corresponding path program 1 times [2024-10-14 10:30:45,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:30:45,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087179831] [2024-10-14 10:30:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:30:45,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:30:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:30:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:30:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:30:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:30:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:30:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:30:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:30:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:30:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:30:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:30:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:30:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:30:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:30:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:30:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:30:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:30:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:30:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:30:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:30:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:30:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:30:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:30:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:30:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:30:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:30:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:30:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:30:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:30:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:30:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:30:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:30:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:30:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 10:30:46,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:30:46,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087179831] [2024-10-14 10:30:46,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087179831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:30:46,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:30:46,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:30:46,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205719646] [2024-10-14 10:30:46,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:30:46,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:30:46,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:30:46,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:30:46,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:30:46,063 INFO L87 Difference]: Start difference. First operand 272 states and 429 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:30:46,255 INFO L93 Difference]: Finished difference Result 550 states and 876 transitions. [2024-10-14 10:30:46,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:30:46,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-10-14 10:30:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:30:46,259 INFO L225 Difference]: With dead ends: 550 [2024-10-14 10:30:46,260 INFO L226 Difference]: Without dead ends: 342 [2024-10-14 10:30:46,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:30:46,261 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 118 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:30:46,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 351 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:30:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-14 10:30:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 328. [2024-10-14 10:30:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 228 states have (on average 1.4210526315789473) internal successors, (324), 228 states have internal predecessors, (324), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-14 10:30:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 516 transitions. [2024-10-14 10:30:46,292 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 516 transitions. Word has length 209 [2024-10-14 10:30:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:30:46,292 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 516 transitions. [2024-10-14 10:30:46,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 516 transitions. [2024-10-14 10:30:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 10:30:46,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:30:46,296 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:30:46,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 10:30:46,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:30:46,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:30:46,297 INFO L85 PathProgramCache]: Analyzing trace with hash 14933003, now seen corresponding path program 1 times [2024-10-14 10:30:46,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:30:46,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033883555] [2024-10-14 10:30:46,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:30:46,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:30:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:30:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:30:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:30:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:30:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:30:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:30:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:30:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:30:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:30:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:30:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:30:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:30:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:30:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:30:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:30:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:30:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:30:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:30:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:30:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:30:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:30:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:30:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:30:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:30:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:30:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:30:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:30:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:30:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:30:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:30:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:30:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:30:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:30:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 10:30:46,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:30:46,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033883555] [2024-10-14 10:30:46,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033883555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:30:46,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:30:46,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:30:46,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241615938] [2024-10-14 10:30:46,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:30:46,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:30:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:30:46,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:30:46,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:30:46,777 INFO L87 Difference]: Start difference. First operand 328 states and 516 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:46,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:30:46,942 INFO L93 Difference]: Finished difference Result 618 states and 973 transitions. [2024-10-14 10:30:46,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:30:46,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-10-14 10:30:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:30:46,945 INFO L225 Difference]: With dead ends: 618 [2024-10-14 10:30:46,945 INFO L226 Difference]: Without dead ends: 349 [2024-10-14 10:30:46,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:30:46,947 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 165 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:30:46,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 245 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:30:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-14 10:30:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 328. [2024-10-14 10:30:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 228 states have (on average 1.4166666666666667) internal successors, (323), 228 states have internal predecessors, (323), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-14 10:30:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 515 transitions. [2024-10-14 10:30:47,000 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 515 transitions. Word has length 209 [2024-10-14 10:30:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:30:47,001 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 515 transitions. [2024-10-14 10:30:47,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:30:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 515 transitions. [2024-10-14 10:30:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 10:30:47,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:30:47,004 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:30:47,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 10:30:47,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:30:47,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:30:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1938161037, now seen corresponding path program 1 times [2024-10-14 10:30:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:30:47,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063493705] [2024-10-14 10:30:47,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:30:47,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:30:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:30:47,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149703662] [2024-10-14 10:30:47,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:30:47,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:30:47,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:30:47,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:30:47,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 10:30:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:30:47,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:30:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:30:47,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:30:47,589 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:30:47,590 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:30:47,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 10:30:47,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:30:47,800 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:30:47,932 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:30:47,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:30:47 BoogieIcfgContainer [2024-10-14 10:30:47,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:30:47,935 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:30:47,935 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:30:47,935 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:30:47,936 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:30:41" (3/4) ... [2024-10-14 10:30:47,937 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:30:47,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:30:47,939 INFO L158 Benchmark]: Toolchain (without parser) took 8212.82ms. Allocated memory was 155.2MB in the beginning and 299.9MB in the end (delta: 144.7MB). Free memory was 98.0MB in the beginning and 167.5MB in the end (delta: -69.5MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2024-10-14 10:30:47,939 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:30:47,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.16ms. Allocated memory is still 155.2MB. Free memory was 98.0MB in the beginning and 81.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 10:30:47,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.83ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 76.4MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 10:30:47,940 INFO L158 Benchmark]: Boogie Preprocessor took 73.02ms. Allocated memory is still 155.2MB. Free memory was 76.4MB in the beginning and 70.6MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:30:47,940 INFO L158 Benchmark]: RCFGBuilder took 814.45ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 70.6MB in the beginning and 142.8MB in the end (delta: -72.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 10:30:47,940 INFO L158 Benchmark]: TraceAbstraction took 6872.92ms. Allocated memory was 203.4MB in the beginning and 299.9MB in the end (delta: 96.5MB). Free memory was 141.8MB in the beginning and 167.5MB in the end (delta: -25.7MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2024-10-14 10:30:47,940 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 299.9MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:30:47,942 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.16ms. Allocated memory is still 155.2MB. Free memory was 98.0MB in the beginning and 81.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.83ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 76.4MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.02ms. Allocated memory is still 155.2MB. Free memory was 76.4MB in the beginning and 70.6MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 814.45ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 70.6MB in the beginning and 142.8MB in the end (delta: -72.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6872.92ms. Allocated memory was 203.4MB in the beginning and 299.9MB in the end (delta: 96.5MB). Free memory was 141.8MB in the beginning and 167.5MB in the end (delta: -25.7MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 299.9MB. Free memory is still 167.5MB. 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 someBinaryFLOATComparisonOperation at line 194, overapproximation of someBinaryDOUBLEComparisonOperation at line 194, overapproximation of bitwiseAnd at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 256; [L23] unsigned short int var_1_2 = 51640; [L24] unsigned short int var_1_3 = 5; [L25] float var_1_7 = 128.8; [L26] unsigned char var_1_8 = 2; [L27] float var_1_9 = 256.5; [L28] float var_1_10 = 7.25; [L29] signed char var_1_11 = 64; [L30] signed char var_1_12 = -16; [L31] double var_1_13 = 0.9; [L32] unsigned char var_1_14 = 1; [L33] double var_1_15 = 0.0; [L34] double var_1_16 = 1.275; [L35] unsigned short int var_1_17 = 8; [L36] unsigned short int var_1_18 = 35331; [L37] signed char var_1_19 = -128; [L38] double var_1_20 = 0.0; [L39] double var_1_21 = 0.0; [L40] signed char var_1_22 = -8; [L41] signed char var_1_23 = 50; [L42] signed char var_1_26 = 5; [L43] signed long int var_1_27 = 32; [L44] unsigned char var_1_28 = 64; [L45] signed char var_1_29 = 100; [L46] signed char var_1_30 = -1; [L47] signed char var_1_31 = 10; [L48] signed char var_1_32 = 5; [L49] signed char var_1_33 = 1; [L50] unsigned short int var_1_34 = 32; [L51] unsigned char var_1_35 = 1; [L52] signed long int var_1_36 = -8; [L53] unsigned char var_1_37 = 1; [L54] float last_1_var_1_10 = 7.25; [L55] double last_1_var_1_13 = 0.9; [L56] unsigned short int last_1_var_1_17 = 8; [L57] signed char last_1_var_1_19 = -128; [L198] isInitial = 1 [L199] FCALL initially() [L200] COND TRUE 1 [L201] CALL updateLastVariables() [L188] last_1_var_1_10 = var_1_10 [L189] last_1_var_1_13 = var_1_13 [L190] last_1_var_1_17 = var_1_17 [L191] last_1_var_1_19 = var_1_19 [L201] RET updateLastVariables() [L202] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L137] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L139] var_1_3 = __VERIFIER_nondet_ushort() [L140] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L140] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L141] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L141] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L142] var_1_8 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_9=513/2] [L143] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_9=513/2] [L144] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_9=513/2] [L144] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_9=513/2] [L145] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65, var_1_9=513/2] [L145] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65, var_1_9=513/2] [L146] var_1_9 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L147] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L148] var_1_12 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L149] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L150] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L150] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L151] var_1_14 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L152] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L153] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L153] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L154] var_1_15 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L155] RET assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L156] var_1_16 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L157] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L158] var_1_18 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_18 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L159] RET assume_abort_if_not(var_1_18 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L160] CALL assume_abort_if_not(var_1_18 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L160] RET assume_abort_if_not(var_1_18 <= 65534) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L161] var_1_20 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L162] RET assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L163] var_1_21 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L164] RET assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L165] var_1_22 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L166] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L167] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L167] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L168] var_1_26 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L169] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L170] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L170] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L171] var_1_30 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_30 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L172] RET assume_abort_if_not(var_1_30 >= -126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L173] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L173] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L174] var_1_31 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L176] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L176] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L177] var_1_33 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L178] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L179] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L179] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L180] var_1_35 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L181] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L182] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L182] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L183] var_1_37 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L184] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L185] CALL assume_abort_if_not(var_1_37 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L185] RET assume_abort_if_not(var_1_37 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L202] RET updateVariables() [L203] CALL step() [L61] COND TRUE (~ (- var_1_17)) < var_1_1 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L62] COND FALSE !(var_1_1 < -64) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L66] COND FALSE !(var_1_17 > var_1_11) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L69] COND TRUE var_1_17 <= (((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) < 0 ) ? -((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) : ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) [L70] var_1_28 = 4 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=100, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L72] COND TRUE var_1_26 <= 16 [L73] var_1_29 = (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_31) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L75] COND TRUE var_1_11 >= var_1_11 [L76] var_1_32 = ((((4) < (((((var_1_26) < ((var_1_31 - var_1_33))) ? (var_1_26) : ((var_1_31 - var_1_33)))))) ? (4) : (((((var_1_26) < ((var_1_31 - var_1_33))) ? (var_1_26) : ((var_1_31 - var_1_33))))))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L80] EXPR var_1_11 & var_1_19 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L80] EXPR (var_1_11 & var_1_19) ^ var_1_11 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L80] EXPR var_1_11 & var_1_33 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L80] COND FALSE !(((var_1_11 & var_1_19) ^ var_1_11) < (var_1_11 & var_1_33)) [L85] EXPR var_1_17 & (~ var_1_11) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L85] COND TRUE (var_1_17 & (~ var_1_11)) <= var_1_1 [L86] COND TRUE \read(var_1_35) [L87] var_1_36 = ((((var_1_11) > (((((var_1_1) < (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))) ? (var_1_1) : (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))))))) ? (var_1_11) : (((((var_1_1) < (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))) ? (var_1_1) : (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))))))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L94] signed long int stepLocal_2 = var_1_3 + last_1_var_1_19; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32638, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L95] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32638, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L106] COND TRUE var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16)) [L107] var_1_19 = ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32638, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=66, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L111] var_1_17 = (var_1_18 - var_1_3) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32638, var_1_10=29/4, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=1, var_1_18=32767, var_1_19=66, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65] [L112] COND TRUE (var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10) [L113] var_1_10 = var_1_9 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32638, var_1_10=2, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=1, var_1_18=32767, var_1_19=66, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65, var_1_9=2] [L115] COND FALSE !(var_1_10 >= var_1_10) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32638, var_1_10=2, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=1, var_1_18=32767, var_1_19=66, var_1_1=256, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65, var_1_9=2] [L120] COND TRUE (var_1_2 - var_1_3) > var_1_17 [L121] var_1_1 = (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32638, var_1_10=2, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=1, var_1_18=32767, var_1_19=66, var_1_1=1, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65, var_1_9=2] [L125] signed long int stepLocal_1 = var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))); [L126] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32766, stepLocal_1=0, stepLocal_2=32638, var_1_10=2, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=1, var_1_18=32767, var_1_19=66, var_1_1=1, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65, var_1_9=2] [L127] COND FALSE !((var_1_19 / var_1_8) < stepLocal_1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32766, stepLocal_2=32638, var_1_10=2, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=1, var_1_18=32767, var_1_19=66, var_1_1=1, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65, var_1_9=2] [L203] RET step() [L204] CALL, EXPR property() [L194-L195] return ((((((((var_1_2 - var_1_3) > var_1_17) ? (var_1_1 == ((signed long int) (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))))) : (var_1_1 == ((signed long int) 0))) && (((var_1_19 / var_1_8) < (var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))))) ? ((var_1_1 >= var_1_3) ? (var_1_7 == ((float) 0.75f)) : (var_1_7 == ((float) var_1_9))) : 1)) && (((var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10)) ? (var_1_10 == ((float) var_1_9)) : 1)) && ((var_1_10 >= var_1_10) ? ((var_1_9 < var_1_10) ? (var_1_11 == ((signed char) var_1_12)) : 1) : 1)) && (var_1_14 ? ((last_1_var_1_13 <= var_1_9) ? (var_1_13 == ((double) var_1_9)) : ((((((last_1_var_1_17) < ((var_1_2 * last_1_var_1_17))) ? (last_1_var_1_17) : ((var_1_2 * last_1_var_1_17)))) == (var_1_3 + last_1_var_1_19)) ? (var_1_13 == ((double) 8.75)) : (var_1_13 == ((double) (16.5 + ((var_1_15 - 49.35) - var_1_16)))))) : 1)) && (var_1_17 == ((unsigned short int) (var_1_18 - var_1_3)))) && ((var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16))) ? (var_1_19 == ((signed char) ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))))) : (var_1_19 == ((signed char) var_1_12))) ; [L204] RET, EXPR property() [L204] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=1, var_1_18=32767, var_1_19=66, var_1_1=1, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=65, var_1_13=9/10, var_1_14=0, var_1_17=1, var_1_18=32767, var_1_19=66, var_1_1=1, var_1_22=66, var_1_23=50, var_1_26=1, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32766, var_1_7=644/5, var_1_8=65, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 9, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 874 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 874 mSDsluCounter, 2358 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1257 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 783 IncrementalHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 1101 mSDtfsCounter, 783 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 539 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=328occurred in iteration=7, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 220 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2069 NumberOfCodeBlocks, 2069 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1643 ConstructedInterpolants, 0 QuantifiedInterpolants, 5465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 15872/15872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 10:30:47,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.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 67842bd2132ccd8a41236e85d94558bf263880db0378e3df7d9b2f0e5d6e4ad1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:30:50,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:30:50,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:30:50,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:30:50,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:30:50,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:30:50,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:30:50,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:30:50,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:30:50,394 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:30:50,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:30:50,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:30:50,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:30:50,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:30:50,396 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:30:50,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:30:50,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:30:50,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:30:50,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:30:50,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:30:50,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:30:50,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:30:50,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:30:50,399 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:30:50,399 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:30:50,399 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:30:50,399 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:30:50,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:30:50,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:30:50,400 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:30:50,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:30:50,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:30:50,401 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:30:50,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:30:50,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:30:50,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:30:50,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:30:50,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:30:50,403 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:30:50,403 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:30:50,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:30:50,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:30:50,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:30:50,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:30:50,408 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:30:50,408 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 -> 67842bd2132ccd8a41236e85d94558bf263880db0378e3df7d9b2f0e5d6e4ad1 [2024-10-14 10:30:50,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:30:50,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:30:50,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:30:50,779 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:30:50,779 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:30:50,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i [2024-10-14 10:30:52,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:30:52,574 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:30:52,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i [2024-10-14 10:30:52,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88d2e504/95d9f499f0fd4d84ad3b1e532f40bfce/FLAGbd8ce60dd [2024-10-14 10:30:52,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88d2e504/95d9f499f0fd4d84ad3b1e532f40bfce [2024-10-14 10:30:52,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:30:52,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:30:52,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:30:52,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:30:52,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:30:52,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:30:52" (1/1) ... [2024-10-14 10:30:52,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b302811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:52, skipping insertion in model container [2024-10-14 10:30:52,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:30:52" (1/1) ... [2024-10-14 10:30:52,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:30:52,824 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i[919,932] [2024-10-14 10:30:52,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:30:52,950 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:30:52,964 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i[919,932] [2024-10-14 10:30:53,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:30:53,040 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:30:53,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53 WrapperNode [2024-10-14 10:30:53,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:30:53,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:30:53,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:30:53,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:30:53,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53" (1/1) ... [2024-10-14 10:30:53,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53" (1/1) ... [2024-10-14 10:30:53,115 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-10-14 10:30:53,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:30:53,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:30:53,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:30:53,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:30:53,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53" (1/1) ... [2024-10-14 10:30:53,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53" (1/1) ... [2024-10-14 10:30:53,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53" (1/1) ... [2024-10-14 10:30:53,165 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 10:30:53,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53" (1/1) ... [2024-10-14 10:30:53,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53" (1/1) ... [2024-10-14 10:30:53,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53" (1/1) ... [2024-10-14 10:30:53,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53" (1/1) ... [2024-10-14 10:30:53,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53" (1/1) ... [2024-10-14 10:30:53,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53" (1/1) ... [2024-10-14 10:30:53,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:30:53,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:30:53,204 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:30:53,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:30:53,205 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53" (1/1) ... [2024-10-14 10:30:53,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:30:53,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:30:53,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 10:30:53,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:30:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:30:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:30:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:30:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:30:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:30:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:30:53,372 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:30:53,374 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:31:04,758 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 10:31:04,759 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:31:04,833 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:31:04,834 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:31:04,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:31:04 BoogieIcfgContainer [2024-10-14 10:31:04,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:31:04,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:31:04,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:31:04,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:31:04,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:30:52" (1/3) ... [2024-10-14 10:31:04,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebadd8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:31:04, skipping insertion in model container [2024-10-14 10:31:04,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:53" (2/3) ... [2024-10-14 10:31:04,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebadd8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:31:04, skipping insertion in model container [2024-10-14 10:31:04,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:31:04" (3/3) ... [2024-10-14 10:31:04,851 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i [2024-10-14 10:31:04,866 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:31:04,866 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:31:04,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:31:04,940 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;@1b68e15d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:31:04,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:31:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 10:31:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 10:31:04,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:04,963 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:31:04,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:04,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:04,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1721778777, now seen corresponding path program 1 times [2024-10-14 10:31:04,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:04,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069950946] [2024-10-14 10:31:04,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:04,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:31:04,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:04,990 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:31:04,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 10:31:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:05,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:31:05,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 974 proven. 0 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2024-10-14 10:31:05,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:31:05,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:05,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069950946] [2024-10-14 10:31:05,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069950946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:05,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:05,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:31:05,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441824873] [2024-10-14 10:31:05,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:05,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:31:05,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:05,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:31:05,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:31:05,714 INFO L87 Difference]: Start difference. First operand has 87 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 10:31:09,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:31:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:09,975 INFO L93 Difference]: Finished difference Result 171 states and 314 transitions. [2024-10-14 10:31:10,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:31:10,023 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 200 [2024-10-14 10:31:10,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:10,030 INFO L225 Difference]: With dead ends: 171 [2024-10-14 10:31:10,030 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 10:31:10,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:31:10,035 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:10,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 10:31:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 10:31:10,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-14 10:31:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 10:31:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2024-10-14 10:31:10,079 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 200 [2024-10-14 10:31:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:10,080 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2024-10-14 10:31:10,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 10:31:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2024-10-14 10:31:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 10:31:10,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:10,084 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:31:10,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 10:31:10,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:31:10,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:10,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:10,286 INFO L85 PathProgramCache]: Analyzing trace with hash -940320603, now seen corresponding path program 1 times [2024-10-14 10:31:10,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:10,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883804879] [2024-10-14 10:31:10,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:10,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:31:10,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:10,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:31:10,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 10:31:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:10,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 10:31:10,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 10:31:16,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:31:16,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:16,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883804879] [2024-10-14 10:31:16,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883804879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:16,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:16,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:31:16,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180136701] [2024-10-14 10:31:16,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:16,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:31:16,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:16,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:31:16,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:31:16,878 INFO L87 Difference]: Start difference. First operand 85 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:31:21,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:31:25,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:31:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:25,944 INFO L93 Difference]: Finished difference Result 240 states and 381 transitions. [2024-10-14 10:31:25,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:31:25,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 200 [2024-10-14 10:31:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:25,956 INFO L225 Difference]: With dead ends: 240 [2024-10-14 10:31:25,956 INFO L226 Difference]: Without dead ends: 156 [2024-10-14 10:31:25,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:31:25,961 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 24 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:25,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 238 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2024-10-14 10:31:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-14 10:31:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 149. [2024-10-14 10:31:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 82 states have internal predecessors, (105), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 10:31:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 233 transitions. [2024-10-14 10:31:26,004 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 233 transitions. Word has length 200 [2024-10-14 10:31:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:26,007 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 233 transitions. [2024-10-14 10:31:26,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:31:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 233 transitions. [2024-10-14 10:31:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-14 10:31:26,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:26,014 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:31:26,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 10:31:26,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:31:26,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:26,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:26,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1281043857, now seen corresponding path program 1 times [2024-10-14 10:31:26,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:26,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503590348] [2024-10-14 10:31:26,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:26,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:31:26,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:26,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:31:26,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 10:31:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:26,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 10:31:26,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 10:31:31,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:31:31,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:31,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503590348] [2024-10-14 10:31:31,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503590348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:31,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:31,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:31:31,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489672144] [2024-10-14 10:31:31,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:31,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:31:31,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:31,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:31:31,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:31:31,705 INFO L87 Difference]: Start difference. First operand 149 states and 233 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:31:35,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:31:39,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:31:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:40,200 INFO L93 Difference]: Finished difference Result 246 states and 387 transitions. [2024-10-14 10:31:40,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:31:40,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 201 [2024-10-14 10:31:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:40,204 INFO L225 Difference]: With dead ends: 246 [2024-10-14 10:31:40,204 INFO L226 Difference]: Without dead ends: 156 [2024-10-14 10:31:40,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:31:40,206 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 21 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:40,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 234 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2024-10-14 10:31:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-14 10:31:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 149. [2024-10-14 10:31:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 82 states have internal predecessors, (104), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 10:31:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 232 transitions. [2024-10-14 10:31:40,237 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 232 transitions. Word has length 201 [2024-10-14 10:31:40,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:40,238 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 232 transitions. [2024-10-14 10:31:40,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 10:31:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 232 transitions. [2024-10-14 10:31:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-14 10:31:40,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:40,245 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:31:40,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 10:31:40,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:31:40,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:40,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:40,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1324979697, now seen corresponding path program 1 times [2024-10-14 10:31:40,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:40,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867710275] [2024-10-14 10:31:40,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:40,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:31:40,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:40,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:31:40,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 10:31:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:40,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 10:31:40,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 768 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2024-10-14 10:31:51,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:31:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-14 10:31:53,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:53,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867710275] [2024-10-14 10:31:53,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867710275] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:31:53,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 10:31:53,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-14 10:31:53,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578143209] [2024-10-14 10:31:53,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 10:31:53,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 10:31:53,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:53,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 10:31:53,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-14 10:31:53,931 INFO L87 Difference]: Start difference. First operand 149 states and 232 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2024-10-14 10:32:00,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:32:02,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []