./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.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 704e29e6339fd63b233612798d0cc532362d3cecfd08254fd11a83f7be7afb70 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:55:29,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:55:30,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:55:30,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:55:30,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:55:30,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:55:30,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:55:30,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:55:30,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:55:30,106 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:55:30,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:55:30,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:55:30,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:55:30,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:55:30,108 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:55:30,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:55:30,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:55:30,110 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:55:30,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:55:30,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:55:30,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:55:30,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:55:30,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:55:30,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:55:30,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:55:30,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:55:30,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:55:30,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:55:30,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:55:30,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:55:30,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:55:30,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:55:30,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:55:30,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:55:30,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:55:30,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:55:30,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:55:30,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:55:30,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:55:30,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:55:30,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:55:30,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:55:30,124 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 -> 704e29e6339fd63b233612798d0cc532362d3cecfd08254fd11a83f7be7afb70 [2024-10-13 01:55:30,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:55:30,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:55:30,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:55:30,411 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:55:30,411 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:55:30,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i [2024-10-13 01:55:31,889 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:55:32,097 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:55:32,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i [2024-10-13 01:55:32,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6ba886f/48c9f441c8f94ecd91207a2deb0ce5a5/FLAG819f62ebc [2024-10-13 01:55:32,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6ba886f/48c9f441c8f94ecd91207a2deb0ce5a5 [2024-10-13 01:55:32,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:55:32,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:55:32,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:55:32,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:55:32,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:55:32,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd83052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32, skipping insertion in model container [2024-10-13 01:55:32,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:55:32,342 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i[919,932] [2024-10-13 01:55:32,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:55:32,464 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:55:32,480 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i[919,932] [2024-10-13 01:55:32,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:55:32,539 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:55:32,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32 WrapperNode [2024-10-13 01:55:32,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:55:32,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:55:32,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:55:32,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:55:32,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,598 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2024-10-13 01:55:32,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:55:32,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:55:32,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:55:32,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:55:32,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,630 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:55:32,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:55:32,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:55:32,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:55:32,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:55:32,658 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32" (1/1) ... [2024-10-13 01:55:32,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:55:32,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:55:32,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:55:32,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:55:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:55:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:55:32,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:55:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:55:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:55:32,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:55:32,854 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:55:32,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:55:33,221 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 01:55:33,221 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:55:33,272 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:55:33,273 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:55:33,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:55:33 BoogieIcfgContainer [2024-10-13 01:55:33,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:55:33,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:55:33,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:55:33,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:55:33,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:55:32" (1/3) ... [2024-10-13 01:55:33,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d29d01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:55:33, skipping insertion in model container [2024-10-13 01:55:33,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:32" (2/3) ... [2024-10-13 01:55:33,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d29d01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:55:33, skipping insertion in model container [2024-10-13 01:55:33,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:55:33" (3/3) ... [2024-10-13 01:55:33,284 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i [2024-10-13 01:55:33,299 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:55:33,300 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:55:33,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:55:33,376 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;@4614c2e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:55:33,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:55:33,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 01:55:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 01:55:33,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:33,404 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:33,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:33,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:33,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1713184580, now seen corresponding path program 1 times [2024-10-13 01:55:33,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:55:33,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128511858] [2024-10-13 01:55:33,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:33,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:55:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:55:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:55:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:55:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:55:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:55:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:55:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:55:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:55:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:55:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:55:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:55:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:55:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 01:55:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 01:55:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 01:55:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 01:55:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 01:55:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 01:55:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 01:55:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 01:55:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 01:55:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:55:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 01:55:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:55:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 01:55:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 01:55:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 01:55:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 01:55:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 01:55:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:33,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 01:55:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 01:55:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:55:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128511858] [2024-10-13 01:55:34,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128511858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:55:34,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:55:34,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:55:34,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747296624] [2024-10-13 01:55:34,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:55:34,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:55:34,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:55:34,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:55:34,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:55:34,045 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 01:55:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:55:34,103 INFO L93 Difference]: Finished difference Result 175 states and 312 transitions. [2024-10-13 01:55:34,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:55:34,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 191 [2024-10-13 01:55:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:55:34,120 INFO L225 Difference]: With dead ends: 175 [2024-10-13 01:55:34,120 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 01:55:34,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:55:34,132 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:55:34,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:55:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 01:55:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 01:55:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 01:55:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2024-10-13 01:55:34,189 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 191 [2024-10-13 01:55:34,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:55:34,192 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2024-10-13 01:55:34,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 01:55:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2024-10-13 01:55:34,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 01:55:34,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:34,197 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:34,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:55:34,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:34,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:34,199 INFO L85 PathProgramCache]: Analyzing trace with hash -177184372, now seen corresponding path program 1 times [2024-10-13 01:55:34,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:55:34,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182029321] [2024-10-13 01:55:34,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:34,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:55:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:55:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:55:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:55:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:55:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:55:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:55:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:55:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:55:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:55:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:55:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:55:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:55:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 01:55:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 01:55:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 01:55:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 01:55:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 01:55:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 01:55:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 01:55:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 01:55:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 01:55:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:55:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 01:55:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:55:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 01:55:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 01:55:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 01:55:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 01:55:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 01:55:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 01:55:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 01:55:34,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:55:34,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182029321] [2024-10-13 01:55:34,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182029321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:55:34,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:55:34,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:55:34,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892939156] [2024-10-13 01:55:34,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:55:34,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:55:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:55:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:55:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:55:34,557 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 01:55:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:55:34,673 INFO L93 Difference]: Finished difference Result 251 states and 390 transitions. [2024-10-13 01:55:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:55:34,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2024-10-13 01:55:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:55:34,678 INFO L225 Difference]: With dead ends: 251 [2024-10-13 01:55:34,678 INFO L226 Difference]: Without dead ends: 166 [2024-10-13 01:55:34,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:55:34,682 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 108 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:55:34,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 324 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:55:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-13 01:55:34,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2024-10-13 01:55:34,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 101 states have (on average 1.2772277227722773) internal successors, (129), 101 states have internal predecessors, (129), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 01:55:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2024-10-13 01:55:34,731 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 191 [2024-10-13 01:55:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:55:34,732 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2024-10-13 01:55:34,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 01:55:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2024-10-13 01:55:34,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 01:55:34,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:34,738 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:34,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:55:34,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:34,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash -234442674, now seen corresponding path program 1 times [2024-10-13 01:55:34,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:55:34,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092931512] [2024-10-13 01:55:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:34,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:55:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:55:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:55:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:55:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:55:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:55:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:55:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:55:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:55:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:55:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:55:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:55:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:55:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 01:55:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 01:55:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 01:55:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 01:55:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 01:55:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 01:55:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 01:55:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 01:55:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 01:55:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:55:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 01:55:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:55:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 01:55:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 01:55:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 01:55:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 01:55:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 01:55:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 01:55:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 01:55:35,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:55:35,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092931512] [2024-10-13 01:55:35,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092931512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:55:35,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:55:35,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:55:35,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328195321] [2024-10-13 01:55:35,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:55:35,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:55:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:55:35,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:55:35,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:55:35,259 INFO L87 Difference]: Start difference. First operand 164 states and 249 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 01:55:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:55:35,532 INFO L93 Difference]: Finished difference Result 437 states and 661 transitions. [2024-10-13 01:55:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:55:35,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2024-10-13 01:55:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:55:35,541 INFO L225 Difference]: With dead ends: 437 [2024-10-13 01:55:35,541 INFO L226 Difference]: Without dead ends: 274 [2024-10-13 01:55:35,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:55:35,543 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 81 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:55:35,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 375 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:55:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-13 01:55:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 219. [2024-10-13 01:55:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 125 states have (on average 1.224) internal successors, (153), 125 states have internal predecessors, (153), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-13 01:55:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 333 transitions. [2024-10-13 01:55:35,591 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 333 transitions. Word has length 191 [2024-10-13 01:55:35,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:55:35,593 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 333 transitions. [2024-10-13 01:55:35,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 01:55:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 333 transitions. [2024-10-13 01:55:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 01:55:35,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:35,601 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:35,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:55:35,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:35,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1817992399, now seen corresponding path program 1 times [2024-10-13 01:55:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:55:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547926298] [2024-10-13 01:55:35,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:55:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:55:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:55:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:55:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:55:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:55:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:55:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:35,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:55:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:55:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:55:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:55:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:55:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:55:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 01:55:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 01:55:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 01:55:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 01:55:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 01:55:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 01:55:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 01:55:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 01:55:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 01:55:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:55:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 01:55:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:55:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 01:55:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 01:55:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 01:55:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 01:55:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 01:55:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 01:55:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 01:55:36,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:55:36,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547926298] [2024-10-13 01:55:36,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547926298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:55:36,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:55:36,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:55:36,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784569632] [2024-10-13 01:55:36,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:55:36,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:55:36,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:55:36,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:55:36,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:55:36,070 INFO L87 Difference]: Start difference. First operand 219 states and 333 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 01:55:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:55:36,259 INFO L93 Difference]: Finished difference Result 446 states and 663 transitions. [2024-10-13 01:55:36,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:55:36,260 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 192 [2024-10-13 01:55:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:55:36,263 INFO L225 Difference]: With dead ends: 446 [2024-10-13 01:55:36,263 INFO L226 Difference]: Without dead ends: 283 [2024-10-13 01:55:36,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:55:36,265 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 157 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:55:36,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 284 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:55:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-13 01:55:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 278. [2024-10-13 01:55:36,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 167 states have (on average 1.215568862275449) internal successors, (203), 168 states have internal predecessors, (203), 104 states have call successors, (104), 6 states have call predecessors, (104), 6 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2024-10-13 01:55:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 411 transitions. [2024-10-13 01:55:36,319 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 411 transitions. Word has length 192 [2024-10-13 01:55:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:55:36,320 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 411 transitions. [2024-10-13 01:55:36,320 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 01:55:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 411 transitions. [2024-10-13 01:55:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 01:55:36,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:36,326 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:36,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 01:55:36,326 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:36,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:36,327 INFO L85 PathProgramCache]: Analyzing trace with hash 538128721, now seen corresponding path program 1 times [2024-10-13 01:55:36,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:55:36,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504793165] [2024-10-13 01:55:36,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:36,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:55:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:55:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:55:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:55:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:55:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:55:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:55:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:55:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:55:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:55:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:55:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:55:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:55:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 01:55:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 01:55:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 01:55:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 01:55:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 01:55:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 01:55:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 01:55:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 01:55:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 01:55:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:55:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 01:55:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:55:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 01:55:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 01:55:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 01:55:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 01:55:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 01:55:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 01:55:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 01:55:36,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:55:36,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504793165] [2024-10-13 01:55:36,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504793165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:55:36,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:55:36,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:55:36,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100779057] [2024-10-13 01:55:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:55:36,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:55:36,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:55:36,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:55:36,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:55:36,487 INFO L87 Difference]: Start difference. First operand 278 states and 411 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 01:55:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:55:36,585 INFO L93 Difference]: Finished difference Result 499 states and 737 transitions. [2024-10-13 01:55:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:55:36,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 192 [2024-10-13 01:55:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:55:36,590 INFO L225 Difference]: With dead ends: 499 [2024-10-13 01:55:36,590 INFO L226 Difference]: Without dead ends: 281 [2024-10-13 01:55:36,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:55:36,592 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 117 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:55:36,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 247 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:55:36,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-13 01:55:36,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2024-10-13 01:55:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 167 states have (on average 1.1736526946107784) internal successors, (196), 168 states have internal predecessors, (196), 104 states have call successors, (104), 6 states have call predecessors, (104), 6 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2024-10-13 01:55:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 404 transitions. [2024-10-13 01:55:36,640 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 404 transitions. Word has length 192 [2024-10-13 01:55:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:55:36,641 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 404 transitions. [2024-10-13 01:55:36,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 01:55:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 404 transitions. [2024-10-13 01:55:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-13 01:55:36,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:36,644 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:36,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 01:55:36,644 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:36,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1891274732, now seen corresponding path program 1 times [2024-10-13 01:55:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:55:36,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458934070] [2024-10-13 01:55:36,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:55:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:55:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:55:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:55:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:55:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:55:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:55:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:55:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:55:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:55:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:55:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:55:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:55:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 01:55:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 01:55:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 01:55:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 01:55:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 01:55:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 01:55:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 01:55:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 01:55:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 01:55:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:55:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 01:55:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:55:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 01:55:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 01:55:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:36,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 01:55:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:37,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 01:55:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:37,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 01:55:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:37,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 01:55:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-13 01:55:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:55:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458934070] [2024-10-13 01:55:37,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458934070] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:55:37,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998219559] [2024-10-13 01:55:37,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:37,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:55:37,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:55:37,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:55:37,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 01:55:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:37,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 01:55:37,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:55:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2024-10-13 01:55:37,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:55:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 66 proven. 21 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-13 01:55:38,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998219559] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:55:38,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:55:38,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 19 [2024-10-13 01:55:38,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206269637] [2024-10-13 01:55:38,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:55:38,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 01:55:38,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:55:38,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 01:55:38,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-10-13 01:55:38,167 INFO L87 Difference]: Start difference. First operand 278 states and 404 transitions. Second operand has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2024-10-13 01:55:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:55:40,137 INFO L93 Difference]: Finished difference Result 672 states and 941 transitions. [2024-10-13 01:55:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-13 01:55:40,138 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) Word has length 193 [2024-10-13 01:55:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:55:40,141 INFO L225 Difference]: With dead ends: 672 [2024-10-13 01:55:40,142 INFO L226 Difference]: Without dead ends: 446 [2024-10-13 01:55:40,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=661, Invalid=2309, Unknown=0, NotChecked=0, Total=2970 [2024-10-13 01:55:40,145 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 579 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:55:40,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 779 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 01:55:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-13 01:55:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 318. [2024-10-13 01:55:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 187 states have (on average 1.106951871657754) internal successors, (207), 188 states have internal predecessors, (207), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-13 01:55:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 431 transitions. [2024-10-13 01:55:40,217 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 431 transitions. Word has length 193 [2024-10-13 01:55:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:55:40,218 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 431 transitions. [2024-10-13 01:55:40,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2024-10-13 01:55:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 431 transitions. [2024-10-13 01:55:40,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 01:55:40,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:40,220 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:40,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 01:55:40,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 01:55:40,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:40,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:40,422 INFO L85 PathProgramCache]: Analyzing trace with hash -839926729, now seen corresponding path program 1 times [2024-10-13 01:55:40,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:55:40,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377488614] [2024-10-13 01:55:40,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:40,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:55:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:55:40,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:55:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:55:40,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:55:40,697 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:55:40,698 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:55:40,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 01:55:40,703 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:40,838 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:55:40,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:55:40 BoogieIcfgContainer [2024-10-13 01:55:40,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:55:40,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:55:40,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:55:40,842 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:55:40,843 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:55:33" (3/4) ... [2024-10-13 01:55:40,845 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:55:40,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:55:40,846 INFO L158 Benchmark]: Toolchain (without parser) took 8713.03ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 111.8MB in the beginning and 153.5MB in the end (delta: -41.6MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2024-10-13 01:55:40,847 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 178.3MB. Free memory was 140.1MB in the beginning and 139.9MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:55:40,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.14ms. Allocated memory is still 178.3MB. Free memory was 111.7MB in the beginning and 145.4MB in the end (delta: -33.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-13 01:55:40,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.17ms. Allocated memory is still 178.3MB. Free memory was 145.4MB in the beginning and 143.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 01:55:40,847 INFO L158 Benchmark]: Boogie Preprocessor took 56.78ms. Allocated memory is still 178.3MB. Free memory was 143.3MB in the beginning and 140.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 01:55:40,848 INFO L158 Benchmark]: RCFGBuilder took 616.94ms. Allocated memory is still 178.3MB. Free memory was 139.1MB in the beginning and 111.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 01:55:40,848 INFO L158 Benchmark]: TraceAbstraction took 7565.01ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 111.9MB in the beginning and 154.5MB in the end (delta: -42.6MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2024-10-13 01:55:40,848 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 270.5MB. Free memory was 154.5MB in the beginning and 153.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:55:40,850 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 178.3MB. Free memory was 140.1MB in the beginning and 139.9MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.14ms. Allocated memory is still 178.3MB. Free memory was 111.7MB in the beginning and 145.4MB in the end (delta: -33.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.17ms. Allocated memory is still 178.3MB. Free memory was 145.4MB in the beginning and 143.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.78ms. Allocated memory is still 178.3MB. Free memory was 143.3MB in the beginning and 140.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 616.94ms. Allocated memory is still 178.3MB. Free memory was 139.1MB in the beginning and 111.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7565.01ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 111.9MB in the beginning and 154.5MB in the end (delta: -42.6MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 270.5MB. Free memory was 154.5MB in the beginning and 153.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 211, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someUnaryDOUBLEoperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 211. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed short int var_1_26 = 10; [L43] signed short int var_1_32 = 0; [L44] signed short int var_1_33 = 10; [L45] signed long int var_1_34 = -10; [L46] double var_1_36 = 4.85; [L47] double var_1_37 = 2.5; [L48] double var_1_38 = 15.75; [L49] signed char var_1_39 = -100; [L50] signed char var_1_40 = 1; [L51] signed short int var_1_41 = -32; [L52] signed char var_1_42 = 4; [L53] signed char var_1_43 = -8; [L54] signed short int var_1_44 = -25; [L55] signed char last_1_var_1_10 = -5; [L56] signed long int last_1_var_1_21 = 1; [L57] signed long int last_1_var_1_25 = -4; [L215] isInitial = 1 [L216] FCALL initially() [L217] COND TRUE 1 [L218] CALL updateLastVariables() [L206] last_1_var_1_10 = var_1_10 [L207] last_1_var_1_21 = var_1_21 [L208] last_1_var_1_25 = var_1_25 [L218] RET updateLastVariables() [L219] CALL updateVariables() [L155] var_1_3 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L156] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L157] var_1_4 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L158] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L159] var_1_7 = __VERIFIER_nondet_short() [L160] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L160] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L161] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L161] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L162] var_1_8 = __VERIFIER_nondet_short() [L163] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=256] [L163] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=256] [L164] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=256] [L164] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=256] [L165] var_1_9 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L166] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L167] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L167] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L168] var_1_11 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L169] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L170] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L170] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L171] var_1_13 = __VERIFIER_nondet_float() [L172] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L172] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L173] var_1_14 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L174] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L175] var_1_15 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L176] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L177] var_1_16 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L178] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L179] var_1_20 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L180] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L181] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L181] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L182] var_1_22 = __VERIFIER_nondet_short() [L183] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L183] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L184] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L184] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L185] var_1_23 = __VERIFIER_nondet_short() [L186] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L186] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L187] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L187] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L188] var_1_32 = __VERIFIER_nondet_short() [L189] CALL assume_abort_if_not(var_1_32 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L189] RET assume_abort_if_not(var_1_32 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L190] CALL assume_abort_if_not(var_1_32 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L190] RET assume_abort_if_not(var_1_32 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L191] var_1_33 = __VERIFIER_nondet_short() [L192] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L192] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L193] CALL assume_abort_if_not(var_1_33 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L193] RET assume_abort_if_not(var_1_33 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L194] var_1_37 = __VERIFIER_nondet_double() [L195] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L195] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L196] var_1_38 = __VERIFIER_nondet_double() [L197] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L197] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L198] var_1_40 = __VERIFIER_nondet_char() [L199] CALL assume_abort_if_not(var_1_40 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L199] RET assume_abort_if_not(var_1_40 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L200] CALL assume_abort_if_not(var_1_40 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L200] RET assume_abort_if_not(var_1_40 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L201] var_1_43 = __VERIFIER_nondet_char() [L202] CALL assume_abort_if_not(var_1_43 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L202] RET assume_abort_if_not(var_1_43 >= -126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L203] CALL assume_abort_if_not(var_1_43 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L203] RET assume_abort_if_not(var_1_43 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L219] RET updateVariables() [L220] CALL step() [L61] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L62] COND TRUE var_1_11 <= last_1_var_1_25 [L63] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L66] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L67] COND TRUE var_1_4 >= (var_1_3 * (var_1_13 + var_1_14)) [L68] var_1_12 = (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L72] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L73] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L80] COND FALSE !(\read(var_1_19)) [L83] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L85] unsigned char stepLocal_0 = var_1_12 > var_1_12; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_0=1, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L86] COND TRUE var_1_19 || stepLocal_0 [L87] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L91] signed long int stepLocal_3 = var_1_22 + var_1_11; [L92] signed long int stepLocal_2 = (var_1_22 - var_1_23) - var_1_9; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=32513, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L93] COND FALSE !(\read(var_1_20)) [L106] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=32513, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L108] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=32513, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L109] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=32513, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=10, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L112] COND FALSE !(var_1_17 >= 25) [L123] var_1_26 = var_1_17 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=32513, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L127] var_1_34 = ((((128) < (((((var_1_1) > ((-5 + var_1_17))) ? (var_1_1) : ((-5 + var_1_17)))))) ? (128) : (((((var_1_1) > ((-5 + var_1_17))) ? (var_1_1) : ((-5 + var_1_17))))))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=32513, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L128] COND FALSE !(\read(var_1_19)) [L131] var_1_36 = ((((var_1_37) > (var_1_38)) ? (var_1_37) : (var_1_38))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=32513, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L133] var_1_39 = var_1_40 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=32513, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=0, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L134] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=32513, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=0, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L137] COND FALSE !(var_1_33 <= var_1_10) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=32513, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=0, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L140] COND TRUE (! var_1_19) || var_1_19 [L141] var_1_44 = var_1_17 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=32513, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=0, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L220] RET step() [L221] CALL, EXPR property() [L211-L212] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; [L221] RET, EXPR property() [L221] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=0, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=32640, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=-1, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=0, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=16384, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 7, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1060 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1042 mSDsluCounter, 2140 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1282 mSDsCounter, 512 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1459 IncrementalHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 512 mSolverCounterUnsat, 858 mSDtfsCounter, 1459 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 840 GetRequests, 780 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=6, InterpolantAutomatonStates: 59, 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, 6 MinimizatonAttempts, 193 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1537 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1528 ConstructedInterpolants, 0 QuantifiedInterpolants, 3254 SizeOfPredicates, 7 NumberOfNonLiveVariables, 449 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 13836/13920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 01:55:40,891 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.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 704e29e6339fd63b233612798d0cc532362d3cecfd08254fd11a83f7be7afb70 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:55:43,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:55:43,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:55:43,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:55:43,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:55:43,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:55:43,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:55:43,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:55:43,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:55:43,353 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:55:43,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:55:43,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:55:43,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:55:43,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:55:43,359 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:55:43,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:55:43,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:55:43,360 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:55:43,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:55:43,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:55:43,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:55:43,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:55:43,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:55:43,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:55:43,361 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:55:43,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:55:43,362 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:55:43,362 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:55:43,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:55:43,362 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:55:43,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:55:43,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:55:43,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:55:43,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:55:43,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:55:43,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:55:43,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:55:43,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:55:43,367 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:55:43,367 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:55:43,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:55:43,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:55:43,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:55:43,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:55:43,369 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:55:43,369 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 -> 704e29e6339fd63b233612798d0cc532362d3cecfd08254fd11a83f7be7afb70 [2024-10-13 01:55:43,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:55:43,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:55:43,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:55:43,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:55:43,722 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:55:43,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i [2024-10-13 01:55:45,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:55:45,554 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:55:45,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i [2024-10-13 01:55:45,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf35c94fc/3a201eae59094409aeaabf39cc414f8c/FLAG92388a02e [2024-10-13 01:55:45,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf35c94fc/3a201eae59094409aeaabf39cc414f8c [2024-10-13 01:55:45,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:55:45,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:55:45,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:55:45,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:55:45,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:55:45,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:55:45" (1/1) ... [2024-10-13 01:55:45,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72925a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:45, skipping insertion in model container [2024-10-13 01:55:45,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:55:45" (1/1) ... [2024-10-13 01:55:45,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:55:46,143 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i[919,932] [2024-10-13 01:55:46,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:55:46,268 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:55:46,283 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i[919,932] [2024-10-13 01:55:46,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:55:46,334 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:55:46,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46 WrapperNode [2024-10-13 01:55:46,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:55:46,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:55:46,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:55:46,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:55:46,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46" (1/1) ... [2024-10-13 01:55:46,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46" (1/1) ... [2024-10-13 01:55:46,412 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-10-13 01:55:46,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:55:46,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:55:46,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:55:46,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:55:46,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46" (1/1) ... [2024-10-13 01:55:46,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46" (1/1) ... [2024-10-13 01:55:46,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46" (1/1) ... [2024-10-13 01:55:46,455 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:55:46,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46" (1/1) ... [2024-10-13 01:55:46,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46" (1/1) ... [2024-10-13 01:55:46,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46" (1/1) ... [2024-10-13 01:55:46,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46" (1/1) ... [2024-10-13 01:55:46,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46" (1/1) ... [2024-10-13 01:55:46,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46" (1/1) ... [2024-10-13 01:55:46,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:55:46,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:55:46,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:55:46,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:55:46,492 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46" (1/1) ... [2024-10-13 01:55:46,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:55:46,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:55:46,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:55:46,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:55:46,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:55:46,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:55:46,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:55:46,607 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:55:46,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:55:46,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:55:46,736 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:55:46,738 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:55:52,965 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 01:55:52,966 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:55:53,043 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:55:53,043 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:55:53,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:55:53 BoogieIcfgContainer [2024-10-13 01:55:53,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:55:53,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:55:53,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:55:53,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:55:53,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:55:45" (1/3) ... [2024-10-13 01:55:53,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47104f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:55:53, skipping insertion in model container [2024-10-13 01:55:53,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:46" (2/3) ... [2024-10-13 01:55:53,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47104f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:55:53, skipping insertion in model container [2024-10-13 01:55:53,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:55:53" (3/3) ... [2024-10-13 01:55:53,054 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i [2024-10-13 01:55:53,070 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:55:53,070 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:55:53,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:55:53,163 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;@4ec2e5cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:55:53,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:55:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 01:55:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 01:55:53,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:53,189 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:53,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:53,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:53,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1713184580, now seen corresponding path program 1 times [2024-10-13 01:55:53,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:55:53,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567069574] [2024-10-13 01:55:53,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:53,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:55:53,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:55:53,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:55:53,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 01:55:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:53,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 01:55:53,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:55:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-10-13 01:55:53,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:55:53,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:55:53,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567069574] [2024-10-13 01:55:53,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567069574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:55:53,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:55:53,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:55:53,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536588456] [2024-10-13 01:55:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:55:53,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:55:53,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:55:53,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:55:53,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:55:53,988 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 01:55:55,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:55:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:55:55,605 INFO L93 Difference]: Finished difference Result 175 states and 312 transitions. [2024-10-13 01:55:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:55:55,628 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 191 [2024-10-13 01:55:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:55:55,636 INFO L225 Difference]: With dead ends: 175 [2024-10-13 01:55:55,636 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 01:55:55,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:55:55,647 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:55:55,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 01:55:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 01:55:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 01:55:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 01:55:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2024-10-13 01:55:55,697 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 191 [2024-10-13 01:55:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:55:55,698 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2024-10-13 01:55:55,698 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 01:55:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2024-10-13 01:55:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 01:55:55,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:55,706 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:55,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 01:55:55,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:55:55,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:55,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:55,908 INFO L85 PathProgramCache]: Analyzing trace with hash -177184372, now seen corresponding path program 1 times [2024-10-13 01:55:55,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:55:55,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875880932] [2024-10-13 01:55:55,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:55,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:55:55,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:55:55,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:55:55,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 (3)] Waiting until timeout for monitored process [2024-10-13 01:55:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:56,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 01:55:56,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:55:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 01:55:58,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:55:58,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:55:58,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875880932] [2024-10-13 01:55:58,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875880932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:55:58,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:55:58,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:55:58,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347710900] [2024-10-13 01:55:58,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:55:58,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:55:58,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:55:58,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:55:58,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:55:58,943 INFO L87 Difference]: Start difference. First operand 86 states and 134 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 01:56:00,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:56:01,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:56:01,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:56:01,651 INFO L93 Difference]: Finished difference Result 257 states and 401 transitions. [2024-10-13 01:56:01,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:56:01,669 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2024-10-13 01:56:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:56:01,673 INFO L225 Difference]: With dead ends: 257 [2024-10-13 01:56:01,673 INFO L226 Difference]: Without dead ends: 172 [2024-10-13 01:56:01,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:56:01,676 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 75 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:56:01,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 377 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 01:56:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-13 01:56:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 141. [2024-10-13 01:56:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 01:56:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 218 transitions. [2024-10-13 01:56:01,714 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 218 transitions. Word has length 191 [2024-10-13 01:56:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:56:01,715 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 218 transitions. [2024-10-13 01:56:01,716 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 01:56:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 218 transitions. [2024-10-13 01:56:01,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 01:56:01,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:56:01,719 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:56:01,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 01:56:01,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:56:01,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:56:01,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:56:01,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1875250701, now seen corresponding path program 1 times [2024-10-13 01:56:01,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:56:01,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573983112] [2024-10-13 01:56:01,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:56:01,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:56:01,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:56:01,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:56:01,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 01:56:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:56:02,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 01:56:02,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:56:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 01:56:05,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:56:05,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:56:05,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573983112] [2024-10-13 01:56:05,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573983112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:56:05,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:56:05,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:56:05,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68462180] [2024-10-13 01:56:05,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:56:05,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:56:05,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:56:05,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:56:05,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:56:05,307 INFO L87 Difference]: Start difference. First operand 141 states and 218 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 01:56:06,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:56:08,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:56:10,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:56:13,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 01:56:14,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:56:15,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 01:56:20,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 01:56:24,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 01:56:25,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 01:56:25,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:56:25,894 INFO L93 Difference]: Finished difference Result 311 states and 484 transitions. [2024-10-13 01:56:25,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:56:25,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 192 [2024-10-13 01:56:25,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:56:25,913 INFO L225 Difference]: With dead ends: 311 [2024-10-13 01:56:25,913 INFO L226 Difference]: Without dead ends: 226 [2024-10-13 01:56:25,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:56:25,916 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 120 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2024-10-13 01:56:25,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 342 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 19.9s Time] [2024-10-13 01:56:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-13 01:56:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 143. [2024-10-13 01:56:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 01:56:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 220 transitions. [2024-10-13 01:56:25,974 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 220 transitions. Word has length 192 [2024-10-13 01:56:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:56:25,978 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 220 transitions. [2024-10-13 01:56:25,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 01:56:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 220 transitions. [2024-10-13 01:56:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 01:56:25,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:56:25,985 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:56:26,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 01:56:26,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:56:26,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:56:26,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:56:26,187 INFO L85 PathProgramCache]: Analyzing trace with hash -118894005, now seen corresponding path program 1 times [2024-10-13 01:56:26,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:56:26,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38450585] [2024-10-13 01:56:26,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:56:26,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:56:26,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:56:26,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:56:26,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 01:56:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:56:26,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 01:56:26,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:56:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 896 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-13 01:56:28,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:56:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-13 01:56:29,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:56:29,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38450585] [2024-10-13 01:56:29,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38450585] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:56:29,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:56:29,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-13 01:56:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482061126] [2024-10-13 01:56:29,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:56:29,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 01:56:29,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:56:29,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 01:56:29,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 01:56:29,771 INFO L87 Difference]: Start difference. First operand 143 states and 220 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-13 01:56:32,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:56:34,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:56:36,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:56:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:56:37,976 INFO L93 Difference]: Finished difference Result 331 states and 500 transitions. [2024-10-13 01:56:37,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 01:56:37,990 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 192 [2024-10-13 01:56:37,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:56:37,993 INFO L225 Difference]: With dead ends: 331 [2024-10-13 01:56:37,993 INFO L226 Difference]: Without dead ends: 244 [2024-10-13 01:56:37,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2024-10-13 01:56:37,996 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 355 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:56:37,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 402 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-10-13 01:56:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-13 01:56:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 149. [2024-10-13 01:56:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 84 states have internal predecessors, (103), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 01:56:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 223 transitions. [2024-10-13 01:56:38,037 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 223 transitions. Word has length 192 [2024-10-13 01:56:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:56:38,038 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 223 transitions. [2024-10-13 01:56:38,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-13 01:56:38,039 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 223 transitions. [2024-10-13 01:56:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-13 01:56:38,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:56:38,041 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:56:38,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 01:56:38,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:56:38,242 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:56:38,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:56:38,243 INFO L85 PathProgramCache]: Analyzing trace with hash -3838796, now seen corresponding path program 1 times [2024-10-13 01:56:38,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:56:38,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506946438] [2024-10-13 01:56:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:56:38,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:56:38,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:56:38,245 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:56:38,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 01:56:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:56:38,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 01:56:38,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:56:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 899 proven. 42 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2024-10-13 01:56:39,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:56:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-13 01:56:39,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:56:39,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506946438] [2024-10-13 01:56:39,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506946438] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:56:39,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:56:39,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-10-13 01:56:39,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430750721] [2024-10-13 01:56:39,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:56:39,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 01:56:39,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:56:39,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 01:56:39,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 01:56:39,901 INFO L87 Difference]: Start difference. First operand 149 states and 223 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-13 01:56:42,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:56:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:56:42,535 INFO L93 Difference]: Finished difference Result 251 states and 366 transitions. [2024-10-13 01:56:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 01:56:42,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 193 [2024-10-13 01:56:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:56:42,566 INFO L225 Difference]: With dead ends: 251 [2024-10-13 01:56:42,566 INFO L226 Difference]: Without dead ends: 162 [2024-10-13 01:56:42,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-13 01:56:42,567 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 194 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:56:42,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 189 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 01:56:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-13 01:56:42,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2024-10-13 01:56:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 87 states have (on average 1.0919540229885059) internal successors, (95), 87 states have internal predecessors, (95), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 01:56:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 215 transitions. [2024-10-13 01:56:42,608 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 215 transitions. Word has length 193 [2024-10-13 01:56:42,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:56:42,609 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 215 transitions. [2024-10-13 01:56:42,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-13 01:56:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 215 transitions. [2024-10-13 01:56:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-13 01:56:42,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:56:42,613 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:56:42,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 01:56:42,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:56:42,814 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:56:42,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:56:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash -459693478, now seen corresponding path program 1 times [2024-10-13 01:56:42,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:56:42,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106183083] [2024-10-13 01:56:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:56:42,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:56:42,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:56:42,817 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:56:42,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 01:56:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:56:43,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 01:56:43,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:56:43,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 899 proven. 42 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2024-10-13 01:56:43,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:56:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-13 01:56:44,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:56:44,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106183083] [2024-10-13 01:56:44,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106183083] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:56:44,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:56:44,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-10-13 01:56:44,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197576345] [2024-10-13 01:56:44,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:56:44,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 01:56:44,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:56:44,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 01:56:44,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 01:56:44,274 INFO L87 Difference]: Start difference. First operand 154 states and 215 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-13 01:56:47,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:56:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:56:47,277 INFO L93 Difference]: Finished difference Result 252 states and 347 transitions. [2024-10-13 01:56:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 01:56:47,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 195 [2024-10-13 01:56:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:56:47,300 INFO L225 Difference]: With dead ends: 252 [2024-10-13 01:56:47,300 INFO L226 Difference]: Without dead ends: 162 [2024-10-13 01:56:47,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-13 01:56:47,301 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 143 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 01:56:47,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 188 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 01:56:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-13 01:56:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2024-10-13 01:56:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 87 states have (on average 1.0804597701149425) internal successors, (94), 87 states have internal predecessors, (94), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 01:56:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 214 transitions. [2024-10-13 01:56:47,330 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 214 transitions. Word has length 195 [2024-10-13 01:56:47,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:56:47,331 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 214 transitions. [2024-10-13 01:56:47,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-13 01:56:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 214 transitions. [2024-10-13 01:56:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-13 01:56:47,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:56:47,333 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:56:47,350 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 01:56:47,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:56:47,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:56:47,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:56:47,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1739557156, now seen corresponding path program 1 times [2024-10-13 01:56:47,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:56:47,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860524282] [2024-10-13 01:56:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:56:47,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:56:47,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:56:47,537 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:56:47,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 01:56:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:56:47,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 01:56:47,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:56:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2024-10-13 01:56:49,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:56:49,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:56:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860524282] [2024-10-13 01:56:49,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860524282] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:56:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1385514295] [2024-10-13 01:56:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:56:49,529 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 01:56:49,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 01:56:49,530 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 01:56:49,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-13 01:56:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:56:50,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 01:56:50,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:56:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2024-10-13 01:56:51,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:56:51,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1385514295] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:56:51,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:56:51,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-13 01:56:51,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077511425] [2024-10-13 01:56:51,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:56:51,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 01:56:51,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:56:51,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 01:56:51,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-13 01:56:51,997 INFO L87 Difference]: Start difference. First operand 154 states and 214 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 01:56:55,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:56:57,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:56:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:56:57,405 INFO L93 Difference]: Finished difference Result 363 states and 481 transitions. [2024-10-13 01:56:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 01:56:57,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 195 [2024-10-13 01:56:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:56:57,431 INFO L225 Difference]: With dead ends: 363 [2024-10-13 01:56:57,431 INFO L226 Difference]: Without dead ends: 273 [2024-10-13 01:56:57,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2024-10-13 01:56:57,433 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 291 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-13 01:56:57,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 559 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-13 01:56:57,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-13 01:56:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 239. [2024-10-13 01:56:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 144 states have (on average 1.0833333333333333) internal successors, (156), 145 states have internal predecessors, (156), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-13 01:56:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 320 transitions. [2024-10-13 01:56:57,475 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 320 transitions. Word has length 195 [2024-10-13 01:56:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:56:57,475 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 320 transitions. [2024-10-13 01:56:57,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 01:56:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 320 transitions. [2024-10-13 01:56:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-13 01:56:57,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:56:57,478 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:56:57,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-10-13 01:56:57,691 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 (8)] Ended with exit code 0 [2024-10-13 01:56:57,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:56:57,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:56:57,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:56:57,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1737710114, now seen corresponding path program 1 times [2024-10-13 01:56:57,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:56:57,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388435867] [2024-10-13 01:56:57,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:56:57,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:56:57,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:56:57,884 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:56:57,885 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 (10)] Waiting until timeout for monitored process [2024-10-13 01:56:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:56:58,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 01:56:58,227 INFO L278 TraceCheckSpWp]: Computing forward predicates...