./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.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 64943cc7b0c16bec6791eb98e547ec186ef36cc0d3d8ca148c8d164737a88411 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:01:18,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:01:18,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:01:18,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:01:18,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:01:18,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:01:18,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:01:18,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:01:18,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:01:18,169 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:01:18,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:01:18,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:01:18,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:01:18,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:01:18,173 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:01:18,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:01:18,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:01:18,174 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:01:18,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:01:18,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:01:18,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:01:18,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:01:18,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:01:18,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:01:18,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:01:18,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:01:18,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:01:18,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:01:18,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:01:18,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:01:18,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:01:18,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:01:18,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:01:18,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:01:18,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:01:18,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:01:18,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:01:18,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:01:18,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:01:18,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:01:18,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:01:18,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:01:18,184 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 -> 64943cc7b0c16bec6791eb98e547ec186ef36cc0d3d8ca148c8d164737a88411 [2024-11-12 04:01:18,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:01:18,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:01:18,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:01:18,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:01:18,491 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:01:18,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i [2024-11-12 04:01:20,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:01:20,229 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:01:20,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i [2024-11-12 04:01:20,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e5c4ccb/265de7c15ed94fe2a6c93935a0f8ebf9/FLAGb08916929 [2024-11-12 04:01:20,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e5c4ccb/265de7c15ed94fe2a6c93935a0f8ebf9 [2024-11-12 04:01:20,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:01:20,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:01:20,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:01:20,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:01:20,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:01:20,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e52679d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20, skipping insertion in model container [2024-11-12 04:01:20,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:01:20,489 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i[919,932] [2024-11-12 04:01:20,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:01:20,593 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:01:20,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i[919,932] [2024-11-12 04:01:20,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:01:20,684 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:01:20,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20 WrapperNode [2024-11-12 04:01:20,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:01:20,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:01:20,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:01:20,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:01:20,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,753 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-11-12 04:01:20,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:01:20,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:01:20,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:01:20,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:01:20,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,792 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:01:20,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:01:20,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:01:20,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:01:20,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:01:20,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20" (1/1) ... [2024-11-12 04:01:20,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:01:20,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:01:20,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:01:20,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:01:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:01:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:01:20,913 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:01:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:01:20,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:01:20,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:01:21,025 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:01:21,028 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:01:21,426 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 04:01:21,427 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:01:21,444 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:01:21,444 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:01:21,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:01:21 BoogieIcfgContainer [2024-11-12 04:01:21,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:01:21,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:01:21,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:01:21,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:01:21,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:01:20" (1/3) ... [2024-11-12 04:01:21,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3575be10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:01:21, skipping insertion in model container [2024-11-12 04:01:21,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:20" (2/3) ... [2024-11-12 04:01:21,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3575be10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:01:21, skipping insertion in model container [2024-11-12 04:01:21,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:01:21" (3/3) ... [2024-11-12 04:01:21,458 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i [2024-11-12 04:01:21,475 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:01:21,475 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:01:21,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:01:21,542 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;@2e60038c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:01:21,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:01:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 04:01:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-12 04:01:21,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:01:21,566 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:01:21,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:01:21,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:01:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2007325841, now seen corresponding path program 1 times [2024-11-12 04:01:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:01:21,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783552666] [2024-11-12 04:01:21,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:01:21,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:01:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:21,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:01:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:21,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:01:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:21,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:01:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:21,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:01:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:01:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:01:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:01:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:01:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:01:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:01:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:01:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:01:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:01:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:01:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:01:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:01:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:01:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:01:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:01:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:01:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:01:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:01:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:01:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:01:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:01:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:01:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 04:01:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 04:01:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 04:01:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 04:01:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 04:01:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 04:01:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:01:22,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783552666] [2024-11-12 04:01:22,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783552666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:01:22,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:01:22,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:01:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291752287] [2024-11-12 04:01:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:01:22,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:01:22,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:01:22,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:01:22,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:01:22,226 INFO L87 Difference]: Start difference. First operand has 96 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-12 04:01:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:01:22,275 INFO L93 Difference]: Finished difference Result 182 states and 321 transitions. [2024-11-12 04:01:22,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:01:22,278 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2024-11-12 04:01:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:01:22,289 INFO L225 Difference]: With dead ends: 182 [2024-11-12 04:01:22,289 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 04:01:22,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:01:22,299 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:01:22,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:01:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 04:01:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-12 04:01:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 04:01:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2024-11-12 04:01:22,360 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 197 [2024-11-12 04:01:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:01:22,361 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2024-11-12 04:01:22,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-12 04:01:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2024-11-12 04:01:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-12 04:01:22,369 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:01:22,370 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:01:22,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:01:22,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:01:22,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:01:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash 757584587, now seen corresponding path program 1 times [2024-11-12 04:01:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:01:22,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832462377] [2024-11-12 04:01:22,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:01:22,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:01:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:01:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:01:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:01:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:01:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:01:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:01:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:01:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:22,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:01:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:01:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:01:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:01:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:01:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:01:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:01:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:01:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:01:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:01:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:01:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:01:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:01:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:01:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:01:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:01:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:01:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:01:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:01:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 04:01:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 04:01:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 04:01:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 04:01:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 04:01:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 04:01:23,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:01:23,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832462377] [2024-11-12 04:01:23,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832462377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:01:23,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:01:23,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:01:23,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076482370] [2024-11-12 04:01:23,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:01:23,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:01:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:01:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:01:23,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:01:23,256 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 04:01:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:01:23,505 INFO L93 Difference]: Finished difference Result 262 states and 406 transitions. [2024-11-12 04:01:23,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:01:23,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-11-12 04:01:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:01:23,510 INFO L225 Difference]: With dead ends: 262 [2024-11-12 04:01:23,510 INFO L226 Difference]: Without dead ends: 176 [2024-11-12 04:01:23,511 INFO L434 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-11-12 04:01:23,512 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 106 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:01:23,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 391 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:01:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-12 04:01:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 161. [2024-11-12 04:01:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 04:01:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 252 transitions. [2024-11-12 04:01:23,562 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 252 transitions. Word has length 197 [2024-11-12 04:01:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:01:23,563 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 252 transitions. [2024-11-12 04:01:23,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 04:01:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 252 transitions. [2024-11-12 04:01:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-12 04:01:23,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:01:23,572 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:01:23,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:01:23,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:01:23,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:01:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1015750025, now seen corresponding path program 1 times [2024-11-12 04:01:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:01:23,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104156372] [2024-11-12 04:01:23,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:01:23,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:01:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:01:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:01:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:01:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:01:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:01:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:01:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:01:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:01:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:01:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:01:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:01:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:01:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:01:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:01:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:01:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:01:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:01:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:01:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:01:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:01:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:01:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:01:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:01:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:01:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:01:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:01:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 04:01:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 04:01:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 04:01:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 04:01:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:23,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 04:01:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-12 04:01:24,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:01:24,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104156372] [2024-11-12 04:01:24,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104156372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:01:24,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162633025] [2024-11-12 04:01:24,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:01:24,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:01:24,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:01:24,006 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:01:24,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 04:01:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:24,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 04:01:24,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:01:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 958 proven. 42 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-12 04:01:24,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:01:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-12 04:01:24,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162633025] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:01:24,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:01:24,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-12 04:01:24,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635711327] [2024-11-12 04:01:24,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:01:24,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:01:24,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:01:24,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:01:24,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:01:24,562 INFO L87 Difference]: Start difference. First operand 161 states and 252 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-12 04:01:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:01:24,998 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2024-11-12 04:01:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 04:01:24,998 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 197 [2024-11-12 04:01:24,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:01:25,001 INFO L225 Difference]: With dead ends: 271 [2024-11-12 04:01:25,001 INFO L226 Difference]: Without dead ends: 181 [2024-11-12 04:01:25,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-12 04:01:25,003 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 169 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:01:25,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 226 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:01:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-12 04:01:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2024-11-12 04:01:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 108 states have internal predecessors, (136), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 04:01:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 260 transitions. [2024-11-12 04:01:25,047 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 260 transitions. Word has length 197 [2024-11-12 04:01:25,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:01:25,049 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 260 transitions. [2024-11-12 04:01:25,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-12 04:01:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 260 transitions. [2024-11-12 04:01:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-12 04:01:25,053 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:01:25,053 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:01:25,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 04:01:25,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:01:25,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:01:25,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:01:25,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1016435579, now seen corresponding path program 1 times [2024-11-12 04:01:25,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:01:25,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860850199] [2024-11-12 04:01:25,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:01:25,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:01:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:01:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:01:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:01:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:01:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:01:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:01:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:01:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:01:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:01:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:01:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:01:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:01:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:01:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:01:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:01:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:01:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:01:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:01:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:01:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:01:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:01:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:01:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:01:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:01:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:01:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:01:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 04:01:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 04:01:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 04:01:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 04:01:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 04:01:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-12 04:01:25,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:01:25,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860850199] [2024-11-12 04:01:25,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860850199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:01:25,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643704552] [2024-11-12 04:01:25,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:01:25,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:01:25,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:01:25,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:01:25,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 04:01:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:25,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 04:01:26,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:01:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 36 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2024-11-12 04:01:26,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:01:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 54 proven. 36 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-12 04:01:26,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643704552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:01:26,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:01:26,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 16 [2024-11-12 04:01:26,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495226159] [2024-11-12 04:01:26,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:01:26,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 04:01:26,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:01:26,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 04:01:26,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-12 04:01:26,905 INFO L87 Difference]: Start difference. First operand 177 states and 260 transitions. Second operand has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-11-12 04:01:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:01:29,530 INFO L93 Difference]: Finished difference Result 895 states and 1299 transitions. [2024-11-12 04:01:29,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-12 04:01:29,531 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) Word has length 197 [2024-11-12 04:01:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:01:29,539 INFO L225 Difference]: With dead ends: 895 [2024-11-12 04:01:29,541 INFO L226 Difference]: Without dead ends: 786 [2024-11-12 04:01:29,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=433, Invalid=1289, Unknown=0, NotChecked=0, Total=1722 [2024-11-12 04:01:29,544 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 521 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:01:29,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1352 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 04:01:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-12 04:01:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 495. [2024-11-12 04:01:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 311 states have (on average 1.2090032154340835) internal successors, (376), 313 states have internal predecessors, (376), 160 states have call successors, (160), 23 states have call predecessors, (160), 23 states have return successors, (160), 158 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-12 04:01:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 696 transitions. [2024-11-12 04:01:29,655 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 696 transitions. Word has length 197 [2024-11-12 04:01:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:01:29,655 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 696 transitions. [2024-11-12 04:01:29,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-11-12 04:01:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 696 transitions. [2024-11-12 04:01:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-12 04:01:29,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:01:29,659 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:01:29,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 04:01:29,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-12 04:01:29,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:01:29,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:01:29,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1284387011, now seen corresponding path program 1 times [2024-11-12 04:01:29,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:01:29,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255784975] [2024-11-12 04:01:29,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:01:29,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:01:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:01:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:01:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:01:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:01:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:01:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:01:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:01:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:01:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:01:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:01:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:01:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:01:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:01:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:01:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:01:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:01:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:01:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:01:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:01:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:01:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:01:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:01:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:01:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:01:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:01:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:01:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 04:01:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 04:01:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 04:01:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 04:01:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 04:01:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-12 04:01:30,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:01:30,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255784975] [2024-11-12 04:01:30,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255784975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:01:30,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739535917] [2024-11-12 04:01:30,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:01:30,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:01:30,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:01:30,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:01:30,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 04:01:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:30,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-12 04:01:30,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:01:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1162 proven. 246 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-11-12 04:01:32,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:01:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 84 proven. 93 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2024-11-12 04:01:33,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739535917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:01:33,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:01:33,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 12] total 34 [2024-11-12 04:01:33,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297233490] [2024-11-12 04:01:33,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:01:33,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-12 04:01:33,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:01:33,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-12 04:01:33,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 04:01:33,033 INFO L87 Difference]: Start difference. First operand 495 states and 696 transitions. Second operand has 34 states, 33 states have (on average 4.575757575757576) internal successors, (151), 31 states have internal predecessors, (151), 12 states have call successors, (93), 6 states have call predecessors, (93), 11 states have return successors, (93), 12 states have call predecessors, (93), 12 states have call successors, (93) [2024-11-12 04:01:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:01:37,221 INFO L93 Difference]: Finished difference Result 1704 states and 2267 transitions. [2024-11-12 04:01:37,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2024-11-12 04:01:37,224 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.575757575757576) internal successors, (151), 31 states have internal predecessors, (151), 12 states have call successors, (93), 6 states have call predecessors, (93), 11 states have return successors, (93), 12 states have call predecessors, (93), 12 states have call successors, (93) Word has length 197 [2024-11-12 04:01:37,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:01:37,239 INFO L225 Difference]: With dead ends: 1704 [2024-11-12 04:01:37,240 INFO L226 Difference]: Without dead ends: 1298 [2024-11-12 04:01:37,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5032 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3251, Invalid=10791, Unknown=0, NotChecked=0, Total=14042 [2024-11-12 04:01:37,249 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1331 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 1054 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1054 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:01:37,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 1038 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1054 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 04:01:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2024-11-12 04:01:37,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 809. [2024-11-12 04:01:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 527 states have (on average 1.1821631878557874) internal successors, (623), 535 states have internal predecessors, (623), 229 states have call successors, (229), 52 states have call predecessors, (229), 52 states have return successors, (229), 221 states have call predecessors, (229), 229 states have call successors, (229) [2024-11-12 04:01:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1081 transitions. [2024-11-12 04:01:37,354 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1081 transitions. Word has length 197 [2024-11-12 04:01:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:01:37,355 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1081 transitions. [2024-11-12 04:01:37,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.575757575757576) internal successors, (151), 31 states have internal predecessors, (151), 12 states have call successors, (93), 6 states have call predecessors, (93), 11 states have return successors, (93), 12 states have call predecessors, (93), 12 states have call successors, (93) [2024-11-12 04:01:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1081 transitions. [2024-11-12 04:01:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-12 04:01:37,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:01:37,357 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:01:37,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 04:01:37,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:01:37,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:01:37,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:01:37,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1286234053, now seen corresponding path program 1 times [2024-11-12 04:01:37,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:01:37,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964257933] [2024-11-12 04:01:37,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:01:37,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:01:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:01:37,646 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:01:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:01:37,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:01:37,772 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:01:37,773 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:01:37,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:01:37,778 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 04:01:37,908 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:01:37,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:01:37 BoogieIcfgContainer [2024-11-12 04:01:37,911 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:01:37,912 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:01:37,912 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:01:37,912 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:01:37,913 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:01:21" (3/4) ... [2024-11-12 04:01:37,915 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:01:37,916 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:01:37,916 INFO L158 Benchmark]: Toolchain (without parser) took 17653.07ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 127.7MB in the beginning and 275.7MB in the end (delta: -148.0MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2024-11-12 04:01:37,917 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:01:37,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.68ms. Allocated memory is still 184.5MB. Free memory was 127.3MB in the beginning and 110.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 04:01:37,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.17ms. Allocated memory is still 184.5MB. Free memory was 110.3MB in the beginning and 106.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:01:37,918 INFO L158 Benchmark]: Boogie Preprocessor took 65.73ms. Allocated memory is still 184.5MB. Free memory was 106.4MB in the beginning and 100.5MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:01:37,918 INFO L158 Benchmark]: RCFGBuilder took 623.29ms. Allocated memory is still 184.5MB. Free memory was 100.5MB in the beginning and 74.7MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-12 04:01:37,919 INFO L158 Benchmark]: TraceAbstraction took 16461.53ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 73.9MB in the beginning and 275.7MB in the end (delta: -201.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:01:37,919 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 369.1MB. Free memory is still 275.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:01:37,920 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.20ms. Allocated memory is still 184.5MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.68ms. Allocated memory is still 184.5MB. Free memory was 127.3MB in the beginning and 110.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.17ms. Allocated memory is still 184.5MB. Free memory was 110.3MB in the beginning and 106.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.73ms. Allocated memory is still 184.5MB. Free memory was 106.4MB in the beginning and 100.5MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 623.29ms. Allocated memory is still 184.5MB. Free memory was 100.5MB in the beginning and 74.7MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16461.53ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 73.9MB in the beginning and 275.7MB in the end (delta: -201.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 369.1MB. Free memory is still 275.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 179. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 16; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_8 = -10; [L26] unsigned short int var_1_9 = 4; [L27] signed char var_1_10 = 8; [L28] unsigned short int var_1_12 = 64314; [L29] unsigned short int var_1_13 = 26169; [L30] signed char var_1_17 = 50; [L31] signed char var_1_18 = 16; [L32] signed char var_1_19 = 5; [L33] signed char var_1_20 = 0; [L34] signed char var_1_21 = 50; [L35] signed char var_1_22 = 16; [L36] unsigned char var_1_23 = 16; [L37] unsigned char var_1_24 = 1; [L38] unsigned char var_1_25 = 0; [L39] double var_1_27 = 0.25; [L40] double var_1_28 = 10.25; [L41] double var_1_29 = 1000.25; [L42] double var_1_30 = 9.5; [L43] float var_1_31 = 63.5; [L44] unsigned short int var_1_32 = 16; [L45] unsigned char var_1_40 = 1; [L46] unsigned char var_1_43 = 0; [L47] signed long int var_1_44 = -4; [L48] unsigned long int var_1_46 = 4; [L49] unsigned long int var_1_49 = 3576445681; [L50] double var_1_50 = 32.5; [L51] signed long int var_1_52 = -1; [L52] unsigned short int var_1_53 = 64; [L53] unsigned short int last_1_var_1_9 = 4; VAL [isInitial=0, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L176] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L126] var_1_4 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L127] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L128] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L129] var_1_6 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L130] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=-10, var_1_9=4] [L131] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=-10, var_1_9=4] [L132] var_1_8 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L133] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L134] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L135] var_1_10 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L136] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L137] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L138] var_1_12 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_12 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L139] RET assume_abort_if_not(var_1_12 >= 49150) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L140] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L141] var_1_13 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_13 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L142] RET assume_abort_if_not(var_1_13 >= 24575) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L143] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L144] var_1_18 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L145] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L146] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L147] var_1_19 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_19 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L148] RET assume_abort_if_not(var_1_19 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L149] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L150] var_1_20 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L152] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L153] var_1_21 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_21 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L154] RET assume_abort_if_not(var_1_21 >= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L155] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L156] var_1_22 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L157] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_22 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L158] RET assume_abort_if_not(var_1_22 <= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L159] var_1_25 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L160] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L161] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L161] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L162] var_1_28 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L163] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L164] var_1_29 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L165] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L166] var_1_30 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L167] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L168] var_1_43 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_43 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L169] RET assume_abort_if_not(var_1_43 >= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L170] CALL assume_abort_if_not(var_1_43 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L170] RET assume_abort_if_not(var_1_43 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L171] var_1_49 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_49 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L172] RET assume_abort_if_not(var_1_49 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L173] CALL assume_abort_if_not(var_1_49 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L173] RET assume_abort_if_not(var_1_49 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L187] RET updateVariables() [L188] CALL step() [L57] COND FALSE !((var_1_23 <= var_1_20) || var_1_6) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L64] COND FALSE !(((((4) < 0 ) ? -(4) : (4))) >= var_1_21) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L73] COND FALSE !(var_1_21 <= var_1_23) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L76] EXPR (~ var_1_10) >> ((((var_1_22) > (var_1_22)) ? (var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L76] COND FALSE !(((~ var_1_10) >> ((((var_1_22) > (var_1_22)) ? (var_1_22) : (var_1_22)))) >= var_1_10) [L79] var_1_50 = var_1_29 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L80] COND FALSE !((~ var_1_20) > var_1_20) [L83] var_1_52 = ((((var_1_21) < (var_1_21)) ? (var_1_21) : (var_1_21))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L85] var_1_53 = var_1_22 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L86] COND FALSE !((- last_1_var_1_9) < (last_1_var_1_9 + -500)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L89] var_1_17 = (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L90] COND TRUE \read(var_1_4) [L91] var_1_24 = (! var_1_25) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L95] var_1_31 = var_1_30 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L96] COND FALSE !(var_1_23 < var_1_23) [L107] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L109] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_9=4, stepLocal_0=126, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L110] COND FALSE !(stepLocal_0 < (-1 - var_1_10)) [L117] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] [L119] COND FALSE !(var_1_9 < (var_1_21 + var_1_23)) [L122] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=3576445686, var_1_28=3576445686, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return (((((((var_1_23 < var_1_23) ? ((var_1_24 && var_1_24) ? (var_1_24 ? ((var_1_24 && (var_1_24 || var_1_24)) ? (var_1_1 == ((signed char) -5)) : 1) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_1 < (-1 - var_1_10)) ? (var_1_24 ? (var_1_9 == ((unsigned short int) (var_1_10 + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))))) : (var_1_9 == ((unsigned short int) ((var_1_12 - var_1_10) - ((var_1_13 - var_1_23) - ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))))) : (var_1_9 == ((unsigned short int) var_1_13)))) && (var_1_17 == ((signed char) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22)))))) && (((- last_1_var_1_9) < (last_1_var_1_9 + -500)) ? (var_1_23 == ((unsigned char) var_1_20)) : 1)) && (var_1_4 ? (var_1_24 == ((unsigned char) (! var_1_25))) : (var_1_24 == ((unsigned char) (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)))))) && ((var_1_9 < (var_1_21 + var_1_23)) ? (var_1_27 == ((double) ((var_1_28 + var_1_29) + var_1_30))) : (var_1_27 == ((double) var_1_28)))) && (var_1_31 == ((float) var_1_30)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=3576445686, var_1_28=3576445686, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=3576445686, var_1_28=3576445686, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=3576445686, var_1_28=3576445686, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 6, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2243 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2127 mSDsluCounter, 3144 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2429 mSDsCounter, 1574 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4798 IncrementalHoareTripleChecker+Invalid, 6372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1574 mSolverCounterUnsat, 715 mSDtfsCounter, 4798 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1689 GetRequests, 1513 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5511 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=809occurred in iteration=5, InterpolantAutomatonStates: 156, 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, 5 MinimizatonAttempts, 799 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1773 NumberOfCodeBlocks, 1773 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 2156 ConstructedInterpolants, 0 QuantifiedInterpolants, 9101 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1329 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 19773/20460 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 04:01:37,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.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 64943cc7b0c16bec6791eb98e547ec186ef36cc0d3d8ca148c8d164737a88411 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:01:40,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:01:40,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:01:40,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:01:40,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:01:40,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:01:40,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:01:40,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:01:40,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:01:40,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:01:40,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:01:40,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:01:40,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:01:40,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:01:40,452 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:01:40,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:01:40,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:01:40,453 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:01:40,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:01:40,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:01:40,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:01:40,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:01:40,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:01:40,455 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:01:40,455 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:01:40,455 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:01:40,455 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:01:40,455 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:01:40,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:01:40,456 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:01:40,456 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:01:40,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:01:40,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:01:40,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:01:40,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:01:40,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:01:40,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:01:40,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:01:40,458 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:01:40,458 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:01:40,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:01:40,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:01:40,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:01:40,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:01:40,461 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 -> 64943cc7b0c16bec6791eb98e547ec186ef36cc0d3d8ca148c8d164737a88411 [2024-11-12 04:01:40,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:01:40,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:01:40,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:01:40,869 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:01:40,869 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:01:40,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i [2024-11-12 04:01:42,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:01:42,658 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:01:42,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i [2024-11-12 04:01:42,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70005c4db/054fd35930d74976aeca03da759e0166/FLAG6a4672b0a [2024-11-12 04:01:43,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70005c4db/054fd35930d74976aeca03da759e0166 [2024-11-12 04:01:43,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:01:43,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:01:43,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:01:43,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:01:43,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:01:43,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fdfa28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43, skipping insertion in model container [2024-11-12 04:01:43,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:01:43,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i[919,932] [2024-11-12 04:01:43,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:01:43,378 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:01:43,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i[919,932] [2024-11-12 04:01:43,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:01:43,490 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:01:43,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43 WrapperNode [2024-11-12 04:01:43,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:01:43,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:01:43,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:01:43,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:01:43,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,549 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-11-12 04:01:43,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:01:43,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:01:43,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:01:43,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:01:43,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,597 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:01:43,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:01:43,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:01:43,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:01:43,642 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:01:43,643 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43" (1/1) ... [2024-11-12 04:01:43,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:01:43,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:01:43,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:01:43,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:01:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:01:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:01:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:01:43,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:01:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:01:43,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:01:43,794 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:01:43,796 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:01:46,610 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 04:01:46,610 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:01:46,624 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:01:46,624 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:01:46,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:01:46 BoogieIcfgContainer [2024-11-12 04:01:46,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:01:46,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:01:46,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:01:46,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:01:46,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:01:43" (1/3) ... [2024-11-12 04:01:46,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6973fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:01:46, skipping insertion in model container [2024-11-12 04:01:46,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:01:43" (2/3) ... [2024-11-12 04:01:46,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6973fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:01:46, skipping insertion in model container [2024-11-12 04:01:46,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:01:46" (3/3) ... [2024-11-12 04:01:46,637 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i [2024-11-12 04:01:46,654 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:01:46,654 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:01:46,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:01:46,724 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;@4e04c15e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:01:46,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:01:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 04:01:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-12 04:01:46,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:01:46,745 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:01:46,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:01:46,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:01:46,753 INFO L85 PathProgramCache]: Analyzing trace with hash -151723237, now seen corresponding path program 1 times [2024-11-12 04:01:46,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:01:46,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929725540] [2024-11-12 04:01:46,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:01:46,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:01:46,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:01:46,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:01:46,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 04:01:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:47,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:01:47,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:01:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-11-12 04:01:47,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:01:47,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:01:47,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929725540] [2024-11-12 04:01:47,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929725540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:01:47,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:01:47,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:01:47,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641583118] [2024-11-12 04:01:47,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:01:47,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:01:47,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:01:47,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:01:47,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:01:47,284 INFO L87 Difference]: Start difference. First operand has 90 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-12 04:01:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:01:47,323 INFO L93 Difference]: Finished difference Result 170 states and 301 transitions. [2024-11-12 04:01:47,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:01:47,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 196 [2024-11-12 04:01:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:01:47,337 INFO L225 Difference]: With dead ends: 170 [2024-11-12 04:01:47,337 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 04:01:47,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:01:47,348 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:01:47,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:01:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 04:01:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-12 04:01:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 04:01:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2024-11-12 04:01:47,409 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 196 [2024-11-12 04:01:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:01:47,409 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2024-11-12 04:01:47,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-12 04:01:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2024-11-12 04:01:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-12 04:01:47,416 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:01:47,416 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:01:47,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 04:01:47,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:01:47,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:01:47,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:01:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash -192037471, now seen corresponding path program 1 times [2024-11-12 04:01:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:01:47,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160661994] [2024-11-12 04:01:47,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:01:47,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:01:47,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:01:47,622 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:01:47,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 04:01:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:47,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 04:01:47,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:01:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 618 proven. 72 refuted. 0 times theorem prover too weak. 1170 trivial. 0 not checked. [2024-11-12 04:01:48,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:01:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-12 04:01:49,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:01:49,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160661994] [2024-11-12 04:01:49,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160661994] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:01:49,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:01:49,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-12 04:01:49,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358285252] [2024-11-12 04:01:49,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:01:49,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:01:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:01:49,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:01:49,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:01:49,245 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-12 04:01:51,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:01:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:01:51,654 INFO L93 Difference]: Finished difference Result 169 states and 256 transitions. [2024-11-12 04:01:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 04:01:51,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 196 [2024-11-12 04:01:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:01:51,686 INFO L225 Difference]: With dead ends: 169 [2024-11-12 04:01:51,686 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 04:01:51,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:01:51,688 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 133 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:01:51,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 193 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-12 04:01:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 04:01:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-12 04:01:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 04:01:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-11-12 04:01:51,704 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 196 [2024-11-12 04:01:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:01:51,705 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-11-12 04:01:51,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-12 04:01:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-11-12 04:01:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-12 04:01:51,709 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:01:51,709 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:01:51,722 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-11-12 04:01:51,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:01:51,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:01:51,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:01:51,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1213105825, now seen corresponding path program 1 times [2024-11-12 04:01:51,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:01:51,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578846047] [2024-11-12 04:01:51,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:01:51,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:01:51,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:01:51,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:01:51,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 04:01:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:52,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 04:01:52,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:01:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 958 proven. 42 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-12 04:01:52,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:01:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-12 04:01:53,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:01:53,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578846047] [2024-11-12 04:01:53,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578846047] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:01:53,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:01:53,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-12 04:01:53,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816657540] [2024-11-12 04:01:53,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:01:53,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:01:53,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:01:53,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:01:53,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:01:53,114 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-12 04:01:56,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:01:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:01:56,211 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2024-11-12 04:01:56,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 04:01:56,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 196 [2024-11-12 04:01:56,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:01:56,234 INFO L225 Difference]: With dead ends: 177 [2024-11-12 04:01:56,234 INFO L226 Difference]: Without dead ends: 93 [2024-11-12 04:01:56,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:01:56,236 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 105 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:01:56,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 188 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-12 04:01:56,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-12 04:01:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-11-12 04:01:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 states have internal predecessors, (69), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 04:01:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-12 04:01:56,260 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 196 [2024-11-12 04:01:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:01:56,261 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-12 04:01:56,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-12 04:01:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-12 04:01:56,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-12 04:01:56,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:01:56,269 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:01:56,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 04:01:56,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:01:56,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:01:56,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:01:56,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2070744221, now seen corresponding path program 1 times [2024-11-12 04:01:56,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:01:56,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061546577] [2024-11-12 04:01:56,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:01:56,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:01:56,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:01:56,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:01:56,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 04:01:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:01:56,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 04:01:56,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:01:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 04:01:57,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:01:57,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:01:57,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061546577] [2024-11-12 04:01:57,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061546577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:01:57,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:01:57,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:01:57,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069446986] [2024-11-12 04:01:57,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:01:57,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:01:57,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:01:57,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:01:57,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:01:57,398 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 04:02:01,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:02:04,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:02:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:02:04,022 INFO L93 Difference]: Finished difference Result 268 states and 388 transitions. [2024-11-12 04:02:04,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:02:04,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-11-12 04:02:04,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:02:04,068 INFO L225 Difference]: With dead ends: 268 [2024-11-12 04:02:04,068 INFO L226 Difference]: Without dead ends: 180 [2024-11-12 04:02:04,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:02:04,074 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 80 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-12 04:02:04,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 355 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-12 04:02:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-12 04:02:04,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 165. [2024-11-12 04:02:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 96 states have internal predecessors, (116), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 04:02:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 240 transitions. [2024-11-12 04:02:04,179 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 240 transitions. Word has length 196 [2024-11-12 04:02:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:02:04,187 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 240 transitions. [2024-11-12 04:02:04,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 04:02:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 240 transitions. [2024-11-12 04:02:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-12 04:02:04,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:02:04,199 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:02:04,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 04:02:04,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:02:04,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:02:04,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:02:04,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1966057637, now seen corresponding path program 1 times [2024-11-12 04:02:04,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:02:04,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100702791] [2024-11-12 04:02:04,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:02:04,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:02:04,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:02:04,403 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:02:04,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 04:02:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:02:04,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 04:02:04,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:02:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 944 proven. 66 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-12 04:02:06,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:02:06,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:02:06,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100702791] [2024-11-12 04:02:06,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100702791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:02:06,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [848779058] [2024-11-12 04:02:06,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:02:06,824 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 04:02:06,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 04:02:06,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 04:02:06,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-12 04:02:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:02:07,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 04:02:07,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:02:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 36 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2024-11-12 04:02:08,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:02:08,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [848779058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:02:08,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:02:08,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2024-11-12 04:02:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110822256] [2024-11-12 04:02:08,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:02:08,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:02:08,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:02:08,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:02:08,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-12 04:02:08,891 INFO L87 Difference]: Start difference. First operand 165 states and 240 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-12 04:02:12,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:02:14,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:02:16,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:02:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:02:16,718 INFO L93 Difference]: Finished difference Result 366 states and 517 transitions. [2024-11-12 04:02:16,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 04:02:16,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 196 [2024-11-12 04:02:16,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:02:16,722 INFO L225 Difference]: With dead ends: 366 [2024-11-12 04:02:16,722 INFO L226 Difference]: Without dead ends: 269 [2024-11-12 04:02:16,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 552 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2024-11-12 04:02:16,728 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 60 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-12 04:02:16,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 467 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-12 04:02:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-12 04:02:16,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 263. [2024-11-12 04:02:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 156 states have (on average 1.1474358974358974) internal successors, (179), 156 states have internal predecessors, (179), 93 states have call successors, (93), 13 states have call predecessors, (93), 13 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-12 04:02:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 365 transitions. [2024-11-12 04:02:16,792 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 365 transitions. Word has length 196 [2024-11-12 04:02:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:02:16,794 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 365 transitions. [2024-11-12 04:02:16,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-12 04:02:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 365 transitions. [2024-11-12 04:02:16,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-12 04:02:16,797 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:02:16,797 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:02:16,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-12 04:02:17,010 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 (6)] Forceful destruction successful, exit code 0 [2024-11-12 04:02:17,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:02:17,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:02:17,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:02:17,199 INFO L85 PathProgramCache]: Analyzing trace with hash 740561757, now seen corresponding path program 1 times [2024-11-12 04:02:17,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:02:17,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453891658] [2024-11-12 04:02:17,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:02:17,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:02:17,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:02:17,202 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:02:17,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 04:02:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:02:17,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-12 04:02:17,531 INFO L279 TraceCheckSpWp]: Computing forward predicates...